A direct proof of Gödel's incompleteness theorem.

José F. Prida

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A direct proof of Gödel's incompleteness theorem.”

A sequence of theories for arithmetic whose union is complete

Aldo Ursini (1977)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

A nonstandard approach to arithmetic.

JOSÉ F. PRIDA (1999)

Revista de la Real Academia de Ciencias Exactas Físicas y Naturales

Similarity:

Arithmetical classification of the set of all provably recursive functions

Vítězslav Švejdar (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The set of all indices of all functions provably recursive in any reasonable theory $T$ is shown to be recursively isomorphic to $U \times \bar{U}$ , where $U$ is $Π_{2}$ -complete set.

Binumerability in a sequence of theories

Franco Parlamento (1981)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

An Ordering of the set of Sentences of Peano Arithmetic

Aleksandar Ignjatović (1985)

Publications de l'Institut Mathématique

Similarity:

Recursive Arithmetic of Skolem II.

H.A. Pogorzelski (1962)

Mathematica Scandinavica

Similarity:

Quantification of number-theoretic functions

S. C. Kleene (1959-1960)

Compositio Mathematica

Similarity:

The strength of Turing determinacy within second order arithmetic

Antonio Montalbán, Richard A. Shore (2016)

Fundamenta Mathematicae

Similarity:

We investigate the reverse mathematical strength of Turing determinacy up to Σ₅⁰, which is itself not provable in second order arithmetic.