Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 14
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Salehi, Saeed 2013. Herbrand consistency of some finite fragments of bounded arithmetical theories. Archive for Mathematical Logic, Vol. 52, Issue. 3-4, p. 317.


    Neeman, Itay 2012. 2011 North American Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 18, Issue. 02, p. 275.


    Willard, Dan E. 2009. Some specially formulated axiomizations for I<mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">Σ</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math> manage to evade the Herbrandized version of the Second Incompleteness Theorem. Information and Computation, Vol. 207, Issue. 10, p. 1078.


    Laskowski, Chris 2008. 2008 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 14, Issue. 03, p. 418.


    Remmel, Jeffrey 2008. 2007-2008 Winter Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 14, Issue. 03, p. 402.


    Groszek, Marcia 2007. 2006–07 Winter Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 13, Issue. 03, p. 375.


    Valeriote, Matthew 2007. 2006 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 13, Issue. 01, p. 120.


    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.


    Steel, John 2006. 2005 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 12, Issue. 01, p. 143.


    Wainer, Stan S. 2006. 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05. Bulletin of Symbolic Logic, Vol. 12, Issue. 02, p. 310.


    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. 2006. The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem. Electronic Notes in Theoretical Computer Science, Vol. 165, p. 213.


    2003. 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02. Bulletin of Symbolic Logic, Vol. 9, Issue. 01, p. 71.


    2003. 2002 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic, Vol. 9, Issue. 01, p. 51.


    ×

How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q

  • Dan E. Willard (a1)
  • DOI: http://dx.doi.org/10.2178/jsl/1190150055
  • Published online: 01 March 2014
Abstract
Abstract

Let us recall that Raphael Robinson's Arithmetic Q is an axiom system that differs from Peano Arithmetic essentially by containing no Induction axioms [13], [18]. We will generalize the semantic-tableaux version of the Second Incompleteness Theorem almost to the level of System Q. We will prove that there exists a single rather long Π1 sentence, valid in the standard model of the Natural Numbers and denoted as V. such that if α is any finite consistent extension of Q + V then α will be unable to prove its Semantic Tableaux consistency. The same result will also apply to axiom systems α with infinite cardinality when these infinite-sized axiom systems satisfy a minor additional constraint, called the Conventional Encoding Property.

Our formalism will also imply that the semantic-tableaux version of the Second Incompleteness Theorem generalizes for the axiom system IΣ0, as well as for all its natural extensions. (This answers an open question raised twenty years ago by Paris and Wilkie [15].)

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[3]Z. Adamowicz and P. Zbierski , On Hebrand consistency in weak theories, Archive for Mathematical Logic, vol. 40 (2001), pp. 399413.

[7]M. Fitting , First order logic and automated theorem proving, Springer-Verlag, 1990.

[10]J. Krajícek , Bounded propositional logic and complexity theory, Cambridge University Press, 1995.

[14]E. Nelson , Predicative arithmetic, Princeton University Press, 1986.

[17]P. Pudlák , On the lengths of proofs of consistency, Collegium logicum: Annals of the Kurt GÖdel society, vol. 2, Springer-Wien-NewYork in cooperation with Technische UniversitÄt Wien, 1996, pp. 6586.

[20]R. Smullyan , First order logic, Springer-Verlag, 1968.

[24]A. Wilkie and J. Paris , On the scheme of induction for bounded arithmetic, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 261302.

[30]C. Wrathall , Rudimentary predicates and relative computation, Siam Journal on Computing, vol. 7 (1978), pp. 194209.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×