Resumen de A direct proof of Gödel's incompleteness theorem

José F. Prida

• An unusual enumeration of partial recursive functions is defined starting from the equivalence between recursiveness and representability in Peano arithmetic. This allows us to obtain by a double diagonalization an undecidable formula expressing a property of Peano arithmetic, equivalent to its consistency.