David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Max 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.
Added to index2009-01-28
Total downloads59 ( #28,635 of 1,101,953 )
Recent downloads (6 months)6 ( #52,474 of 1,101,953 )
How can I increase my downloads?