A generalization of the Second Incompleteness Theorem and some exceptions to it

Annals of Pure and Applied Logic 141 (3):472-496 (2006)
  Copy   BIBTEX

Abstract

This paper will introduce the notion of a naming convention and use this paradigm to both develop a new version of the Second Incompleteness Theorem and to describe when an axiom system can partially evade the Second Incompleteness Theorem

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2005.12.010

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Passive induction and a solution to a Paris–Wilkie open question.Dan E. Willard - 2007 - Annals of Pure and Applied Logic 146 (2-3):124-149.
Gödel’s second incompleteness theorem: How it is derived and what it delivers.Saeed Salehi - 2020 - Bulletin of Symbolic Logic 26 (3-4):241-256.
The Surprise Examination Paradox and the Second Incompleteness Theorem.Shira Kritchman & Ran Raz - unknown
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency.Dan E. Willard - 2006 - Journal of Symbolic Logic 71 (4):1189-1199.
Kolmogorov complexity and the second incompleteness theorem.Makoto Kikuchi - 1997 - Archive for Mathematical Logic 36 (6):437-443.
Incompleteness and Computability: An Open Introduction to Gödel's Theorems.Richard Zach - 2019 - Open Logic Project.
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.
Self-Verifying Axiom Systems, the Incompleteness Theorem and Related Reflection Principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.

Analytics

Added to PP
2013-12-31

Downloads
23 (#160,613)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
Passive induction and a solution to a Paris–Wilkie open question.Dan E. Willard - 2007 - Annals of Pure and Applied Logic 146 (2-3):124-149.
On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - forthcoming - Philosophia Mathematica.

View all 8 citations / Add more citations

References found in this work

On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
Extensions of some theorems of gödel and church.Barkley Rosser - 1936 - Journal of Symbolic Logic 1 (3):87-91.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.

View all 21 references / Add more references