Self-verifying axiom systems, the incompleteness theorem and related reflection principles
Journal of Symbolic Logic 66 (2):536-596 (2001)
| Abstract | We will study several weak axiom systems that use the Subtraction and Division primitives (rather than Addition and Multiplication) to formally encode the theorems of Arithmetic. Provided such axiom systems do not recognize Multiplication as a total function, we will show that it is feasible for them to verify their Semantic Tableaux, Herbrand, and Cut-Free consistencies. If our axiom systems additionally do not recognize Addition as a total function, they will be capable of recognizing the consistency of their Hilbert-style deductive proofs. Our axiom systems will not be strong enough to recognize their Canonical Reflection principle, but they will be capable of recognizing an approximation of it, called the "Tangibility Reflection Principle". We will also prove some new versions of the Second Incompleteness Theorem stating essentially that it is not possible to extend our exceptions to the Incompleteness Theorem much further | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesRobert E. Beaudoin (1987). Strong Analogues of Martin's Axiom Imply Axiom R. Journal of Symbolic Logic 52 (1):216-218.
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
David W. Miller (2007). Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice. Logica Universalis 1 (1).
Dan E. Willard (2006). On the Available Partial Respects in Which an Axiomatization for Real Valued Arithmetic Can Recognize Its Consistency. Journal of Symbolic Logic 71 (4):1189 - 1199.
Dan E. Willard (2002). 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 (1):465-496.
Dan E. Willard (2005). An Exploration of the Partial Respects in Which an Axiom System Recognizing Solely Addition as a Total Function Can Verify Its Own Consistency. Journal of Symbolic Logic 70 (4):1171 - 1209.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads7 ( #134,900 of 556,804 )Recent downloads (6 months)1 ( #64,847 of 556,804 )How can I increase my downloads? |
My notes
Discussion
