The consistency of arithmetic
AbstractThe 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
Similar books and articles
A Natural First-Order System of Arithmetic Which Proves Its Own Consistency.Andrew Boucher - manuscript
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.
On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories.Leszek Aleksander Kołodziejczyk - 2006 - Journal of Symbolic Logic 71 (2):624 - 638.
A Proof of Consistency of Borkowski's Logical System Containing Peano's Arithmetic.Tadeusz Kubiński - 1963 - Studia Logica 14:197 - 225.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
The Relative Consistency of System RRC* and Some of its Extensions.Max A. Freund - 1994 - Studia Logica 53 (3):351 - 360.
Added to PP
Historical graph of downloads