The quantifier complexity of NF.
Kaye, Richard (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Displaying similar documents to “Diagonal reasonings in mathematical logic”
The quantifier complexity of NF.
An unfinitizability proof by means of restricted reduced power
Andrzej Grzegorczyk (1971)
Fundamenta Mathematicae
Similarity:
On interpretability in theories containing arithmetic
Marie Hájková, Petr Hájek (1972)
Fundamenta Mathematicae
Similarity:
Some applications of formalized consistency proofs
G. Kreisel, Hao Wang (1955)
Fundamenta Mathematicae
Similarity:
A note on a result of Buss concerning bounded theories and the collection scheme.
Ferreira, Fernando (1995)
Portugaliae Mathematica
Similarity:
A sequence of theories for arithmetic whose union is complete
Aldo Ursini (1977)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Descriptive Set Theory and Infinitary Languages
John P. Burgess (1977)
Zbornik Radova
Similarity:
Binumerability in a sequence of theories
Franco Parlamento (1981)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Degrees of interpretability
Vítězslav Švejdar (1978)
Commentationes Mathematicae Universitatis Carolinae
Similarity: