How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
From MaRDI portal
Publication:4532626
DOI10.2178/jsl/1190150055zbMath1004.03050OpenAlexW1993364664MaRDI QIDQ4532626
Publication date: 6 February 2003
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1190150055
Related Items
2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Herbrand consistency of some finite fragments of bounded arithmetical theories ⋮ Herbrand consistency of some arithmetical theories ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Passive induction and a solution to a Paris-Wilkie open question ⋮ 2006–07 Winter Meeting of the Association for Symbolic Logic ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ 2006 Annual Meeting of the Association for Symbolic Logic ⋮ A generalization of the second incompleteness theorem and some exceptions to it ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ 2002 Annual Meeting of the Association for Symbolic Logic ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ 2007-2008 Winter Meeting of the Association for Symbolic Logic ⋮ 2008 Annual Meeting of the Association for Symbolic Logic ⋮ 2005 Annual Meeting of the Association for Symbolic Logic ⋮ On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories ⋮ An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency ⋮ On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency ⋮ 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 ⋮ Polynomially bounded recursive realizability
Cites Work
