Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Krajewski, Stanissław
1974.
Predicative Expansions of Axiomatic Theories.
Mathematical Logic Quarterly,
Vol. 20,
Issue. 28-29,
p.
435.
Krajewski, S.
1976.
Set Theory and Hierarchy Theory A Memorial Tribute to Andrzej Mostowski.
Vol. 537,
Issue. ,
p.
121.
Murawski, Roman
1977.
On expandability of models of Peano arithmetic. III.
Studia Logica,
Vol. 36,
Issue. 3,
p.
181.
Mycielski, Jan
1983.
The Meaning of the ConjectureP≠NPfor Mathematical Logic.
The American Mathematical Monthly,
Vol. 90,
Issue. 2,
p.
129.
Pudlák, Pavel
1983.
Some prime elements in the lattice of interpretability types.
Transactions of the American Mathematical Society,
Vol. 280,
Issue. 1,
p.
255.
Manuel, Corrada C.
1985.
Methods in Mathematical Logic.
Vol. 1130,
Issue. ,
p.
69.
Lavine, Shaughan
1995.
Finite mathematics.
Synthese,
Vol. 103,
Issue. 3,
p.
389.
Pudlák, Pavel
1998.
Handbook of Proof Theory.
Vol. 137,
Issue. ,
p.
547.
Corcoran, John
2006.
Schemata: The Concept of Schema in the History of Logic.
Bulletin of Symbolic Logic,
Vol. 12,
Issue. 2,
p.
219.
Visser, Albert
2008.
Pairs, sets and sequences in first-order theories.
Archive for Mathematical Logic,
Vol. 47,
Issue. 4,
p.
299.
VISSER, ALBERT
2009.
CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN.
The Review of Symbolic Logic,
Vol. 2,
Issue. 03,
p.
570.
Kudinov, Oleg V.
Selivanov, Victor L.
and
Yartseva, Lyudmila V.
2010.
Programs, Proofs, Processes.
Vol. 6158,
Issue. ,
p.
246.
Беклемишев, Лев Дмитриевич
and
Beklemishev, Lev Dmitrievich
2010.
Теоремы Гeделя о неполноте и границы их применимости. I.
Успехи математических наук,
Vol. 65,
Issue. 5,
p.
61.
Visser, A.
2011.
Can We Make the Second Incompleteness Theorem Coordinate Free?.
Journal of Logic and Computation,
Vol. 21,
Issue. 4,
p.
543.
Jeřábek, Emil
2012.
Sequence encoding without induction.
Mathematical Logic Quarterly,
Vol. 58,
Issue. 3,
p.
244.
Visser, Albert
2012.
The Second Incompleteness Theorem and Bounded Interpretations.
Studia Logica,
Vol. 100,
Issue. 1-2,
p.
399.
Visser, Albert
2012.
Vaught's Theorem on Axiomatizability by a Scheme.
The Bulletin of Symbolic Logic,
Vol. 18,
Issue. 3,
p.
382.
Pudlák, Pavel
2013.
Logical Foundations of Mathematics and Computational Complexity.
p.
1.
Visser, Albert
2014.
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories.
Mathematical Logic Quarterly,
Vol. 60,
Issue. 1-2,
p.
92.
Nicolai, Carlo
2016.
A Note on Typed Truth and Consistency Assertions.
Journal of Philosophical Logic,
Vol. 45,
Issue. 1,
p.
89.