Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
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.
wilkie, A.J.
1986.
Logic Colloquium '84.
Vol. 120,
Issue. ,
p.
329.
Krajíček, Jan
1987.
A note on proofs of falsehood.
Archiv für Mathematische Logik und Grundlagenforschung,
Vol. 26,
Issue. 1,
p.
169.
Wilkie, A.J.
and
Paris, J.B.
1987.
On the scheme of induction for bounded arithmetic formulas.
Annals of Pure and Applied Logic,
Vol. 35,
Issue. ,
p.
261.
Visser, Albert
1990.
Mathematical Logic.
p.
175.
Visser, Albert
1991.
The formalization of Interpretability.
Studia Logica,
Vol. 50,
Issue. 1,
p.
81.
Pudlák, Pavel
1996.
Collegium Logicum.
Vol. 2,
Issue. ,
p.
65.
Sheard, Michael
1998.
Induction the Hard Way.
The American Mathematical Monthly,
Vol. 105,
Issue. 4,
p.
348.
Willard, Dan E.
2002.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 2381,
Issue. ,
p.
281.
Willard, Dan E.
2005.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 3702,
Issue. ,
p.
292.
Willard, Dan E.
2006.
A generalization of the Second Incompleteness Theorem and some exceptions to it.
Annals of Pure and Applied Logic,
Vol. 141,
Issue. 3,
p.
472.
Willard, Dan E.
2007.
Passive induction and a solution to a Paris–Wilkie open question.
Annals of Pure and Applied Logic,
Vol. 146,
Issue. 2-3,
p.
124.
Buss, Samuel R.
2008.
New Computational Paradigms.
p.
213.
Willard, Dan E.
2009.
Some specially formulated axiomizations for IΣ0manage to evade the Herbrandized version of the Second Incompleteness Theorem.
Information and Computation,
Vol. 207,
Issue. 10,
p.
1078.
Kaye, Richard
2013.
The arithmetic of cuts in models of arithmetic.
Mathematical Logic Quarterly,
Vol. 59,
Issue. 4-5,
p.
332.
FISCHER, MARTIN
2014.
TRUTH AND SPEED-UP.
The Review of Symbolic Logic,
Vol. 7,
Issue. 2,
p.
319.
Krajíček, Jan
2019.
Proof Complexity.
Willard, Dan E
2021.
About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction.
Journal of Logic and Computation,
Vol. 31,
Issue. 1,
p.
375.