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 “Binumerability in a sequence of theories”
A sequence of theories for arithmetic whose union is complete
An Ordering of the set of Sentences of Peano Arithmetic
Aleksandar Ignjatović (1985)
Publications de l'Institut Mathématique
Similarity:
Some remarks on bicommutability
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
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.
Existence in mathematics
R. L. Goodstein (1968)
Compositio Mathematica
Similarity:
A direct proof of Gödel's incompleteness theorem.
José F. Prida (1986)
Collectanea Mathematica
Similarity:
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
Similarity:
Some proofs of undecidability of arithmetic
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
Farhi arithmetic functions associated to Lucas sequences
Qing-Zhong Ji (2011)
Acta Arithmetica
Similarity:
Arithmetic functions on Beatty sequences
Abercrombie Alex G., Banks William D., Shparlinski Igor E. (2009)
Acta Arithmetica
Similarity: