A sequence of theories for arithmetic whose union is complete
Aldo Ursini (1977)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Displaying similar documents to “Goodstein's function.”
A sequence of theories for arithmetic whose union is complete
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
Similarity:
A direct proof of Gödel's incompleteness theorem.
José F. Prida (1986)
Collectanea Mathematica
Similarity:
An extended arithmetic of ordinal numbers
John Doner, Alfred Tarski (1969)
Fundamenta Mathematicae
Similarity:
Binumerability in a sequence of theories
Franco Parlamento (1981)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
On elementary cuts in recursively saturated models of Peano Arithmetic
Henryk Kotlarski (1984)
Fundamenta Mathematicae
Similarity:
From Foundations to Science: Justifying and Unwinding Proofs
Georg Kreisel (1977)
Zbornik Radova
Similarity:
Diagonal reasonings in mathematical logic
Zofia Adamowicz (1995)
Banach Center Publications
Similarity:
First we show a few well known mathematical diagonal reasonings. Then we concentrate on diagonal reasonings typical for mathematical logic.
Wadge degrees of -languages of deterministic Turing machines
Victor Selivanov (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We describe Wadge degrees of -languages recognizable by deterministic Turing machines. In particular, it is shown that the ordinal corresponding to these degrees is where is the first non-recursive ordinal known as the Church–Kleene ordinal. This answers a question raised in [2].
The boundedness principle in ordinal recursion
Douglas Cenzer (1974)
Fundamenta Mathematicae
Similarity: