A sequence of theories for arithmetic whose union is complete
Aldo Ursini (1977)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Aldo Ursini (1977)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
JOSÉ F. PRIDA (1999)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
Vítězslav Švejdar (1999)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The set of all indices of all functions provably recursive in any reasonable theory is shown to be recursively isomorphic to , where is -complete set.
Franco Parlamento (1981)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Aleksandar Ignjatović (1985)
Publications de l'Institut Mathématique
Similarity:
H.A. Pogorzelski (1962)
Mathematica Scandinavica
Similarity:
S. C. Kleene (1959-1960)
Compositio Mathematica
Similarity:
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.