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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,174

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
127 (#96,668)

6 months
1 (#413,740)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references