A direct proof of Gödel's incompleteness theorem

  1. F. Prida, José
Revista:
Collectanea mathematica

ISSN: 0010-0757

Any de publicació: 1986

Volum: 37

Fascicle: 1

Pàgines: 81-83

Tipus: Article

DIALNET GOOGLE SCHOLAR lock_openAccés obert editor

Altres publicacions en: Collectanea mathematica

Resum

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.

Fuente de los datos: Dialnet