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 “A note on bounded arithmetic”
A sequence of theories for arithmetic whose union is complete
Binumerability in a sequence of theories
Franco Parlamento (1981)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Existence in mathematics
R. L. Goodstein (1968)
Compositio Mathematica
Similarity:
Some applications of formalized consistency proofs
G. Kreisel, Hao Wang (1955)
Fundamenta Mathematicae
Similarity:
An Ordering of the set of Sentences of Peano Arithmetic
Aleksandar Ignjatović (1985)
Publications de l'Institut Mathématique
Similarity:
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
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.
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.
A note on a result of Buss concerning bounded theories and the collection scheme.
Ferreira, Fernando (1995)
Portugaliae Mathematica
Similarity: