Skip to main content
SpringerLink
Log in

Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2381))

Abstract

This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic’s Π 1 theorems. We will develop some new types of exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.

Supported by NSF Grant CCR 99-02726.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Z. Adamowicz, “Herbrand Consistency and Bounded Arithmetic”, Fundamenta Mathematica 171 (2002) pp. 279–292.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Buss, Bounded Arithmetic, Proof Theory Lecture Notes #3, Bibliopolic 1986.

    Google Scholar 

  3. M. Fitting, First Order Logic & Automated Theorem Proving, Springer Verlag 1990.

    Google Scholar 

  4. P. Hájek and P. Pudlák, Metamathematics of First Order Arithmetic, Springer Verlag 1991.

    Google Scholar 

  5. R. Jeroslow, “Consistency Statements in Formal Mathematics”, Fundamenta Mathematica 72 (1971) pp. 17–40.

    MATH  MathSciNet  Google Scholar 

  6. S. Kleene, “On the Notation of Ordinal Numbers”, Journal of Symbolic Logic 3 (1938), pp. 150–156.

    Article  MATH  Google Scholar 

  7. J. Krajícek, Bounded Propositional Logic and Complexity Theory, Cambridge University Press, 1995.

    Google Scholar 

  8. G. Kreisel and G. Takeuti, “Formally Self-Referential Propositions for Cut-Free Classical Analysis”, Dissertationes Mathematicae 118 (1974) pp. 1–55

    MathSciNet  Google Scholar 

  9. E. Nelson, Predicative Arithmetic, Math Notes, Princeton Press, 1986.

    Google Scholar 

  10. R. Parikh, “Existence and Feasibility in Arithmetic”, Journal of Symbolic Logic 36 (1971), pp. 494–508.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Paris and C. Dimitracopoulos, “A Note on the Undefinability of Cuts”, Journal of Symbolic Logic 48 (1983) pp. 564–569.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Pudlák, “Cuts, Consistency Statements and Interpretations”, Journal of Symbolic Logic 50 (1985) pp. 423–442.

    Article  MATH  MathSciNet  Google Scholar 

  13. P. Pudlák, “On the Lengths of Proofs of Consistency”, in Collegium Logicum: Annals of the Kurt Gödel Society Volume 2, published (1996) by Springer-Wien-NewYork, pp 65–86.

    Google Scholar 

  14. H. Rogers, Recursive Functions and Effective Compatibility, McGrawHill 1967.

    Google Scholar 

  15. R. Smullyan, First Order Logic, Springer Verlag, 1968.

    Google Scholar 

  16. R. Solovay, Private Communications (1994) about his generalization of one of Pudlák’s theorems from [12]. Solovay never published any of his observations about “Definable Cuts” that several logicians [4,7,9,11,12,13,19] have attributed to his private communications. We provide our short 4-page interpretation of Solovay’s revised form of Pudlák’s Incompleteness Theorem in Appendix A of [24].

    Google Scholar 

  17. G. Takeuti, Proof Theory, Studies in Logic Volume 81, North Holland, 1987.

    Google Scholar 

  18. A. Visser, “An Inside View of Exp”, Journal of Symbolic Logic 57 (1992) 131–165

    Article  MATH  MathSciNet  Google Scholar 

  19. A. Wilkie and J. Paris, “On the Scheme of Induction for Bounded Arithmetic”, Annals of Pure and Applied Logic (35) 1987, 261–302

    Article  MATH  MathSciNet  Google Scholar 

  20. D. Willard, “Self-Verifying Axiom Systems”, Third Kurt Gödel Colloquium (1993), Springer-Verlag LNCS#713, pp. 325–336.

    Google Scholar 

  21. D. Willard, “The Tangibility Reflection Principle”, Fifth Kurt Gödel Colloquium (1997), Springer-Verlag LNCS#1289, pp. 319–334.

    Google Scholar 

  22. D. Willard, “Self-Reflection Principles and NP-Hardness”, Dimacs Series # 39 (1998), pp. 297–320 (AMS Press).

    Google Scholar 

  23. D. Willard, “The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson’s Arithmetic Q”, in Semantic Tableaux 2000 Conference Proceedings, Springer Verlag LNAI#1847, pp. 415–430.

    Google Scholar 

  24. D. Willard, “Self-Verifying Systems, the Incompleteness Theorem and the Tangibility Reflection Principle”, in Journal of Symbolic Logic 66 (2001) pp. 536–596.

    Article  MATH  MathSciNet  Google Scholar 

  25. D. Willard, “How to Extend The Semantic Tableaux And Cut-Free Versions of the Second Incompleteness Theorem Almost to Robinson’s Arithmetic Q”, Journal of Symbolic Logic 67 (2002) pp. 465–496.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State University of New York at Albany, USA

    Dan E. Willard

Authors
  1. Dan E. Willard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung Wisssenbasierte Systeme 184/3, Technische Univesität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Uwe Egly

  2. Institut für Computersprachen AG Theoretische Informatik und Logik 185.2, Technische Universität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Chritian G. Fermüller

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Willard, D.E. (2002). Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem. In: Egly, U., Fermüller, C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science(), vol 2381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45616-3_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45616-3_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43929-5

  • Online ISBN: 978-3-540-45616-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation