Revistes Catalanes amb Accés Obert (RACO)

A direct proof of Gödel's incompleteness theorems

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.

Text complet: PDF