The consistency of arithmetic
| Abstract | The paper presents a proof of the consistency of Peano Arithmetic (PA) that does not lie in deducing its consistency as a theorem in an axiomatic system. PA’s consistency cannot be proved in PA, and to deduce its consistency in some stronger system PA+ is self-defeating, since the stronger system may itself be inconsistent. Instead, a semantic proof is constructed which demonstrates consistency not relative to the consistency of some other system but in an absolute sense | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesMax A. Freund (1994). The Relative Consistency of System RRC* and Some of its Extensions. Studia Logica 53 (3):351 - 360.
Tadeusz Kubiński (1963). A Proof of Consistency of Borkowski's Logical System Containing Peano's Arithmetic. Studia Logica 14:197 - 225.
Leszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
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.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads51 ( #20,569 of 549,198 )Recent downloads (6 months)4 ( #19,303 of 549,198 )How can I increase my downloads? |
My notes
Discussion
