A direct proof of Gödel's incompleteness theorem
ISSN: 0010-0757
Año de publicación: 1986
Volumen: 37
Fascículo: 1
Páginas: 81-83
Tipo: Artículo
Otras publicaciones en: Collectanea mathematica
Resumen
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.