A direct proof of Gödel's incompleteness theorem

Autores: José F. Prida
Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 37, Fasc. 1, 1986, págs. 81-83
Idioma: inglés
Títulos paralelos:
- Una prueba directa del teorema de incompletitud de Gödel
Enlaces
- Texto completo
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.