"True" arithmetic can prove its own consistency

Abstract

Using an axiomatization of second-order arithmetic (essentially second-order Peano Arithmetic without the Successor Axiom), arithmetic's basic operations are defined and its fundamental laws, up to unique prime factorization, are proven. Two manners of expressing a system's consistency are presented - the "Godel" consistency, where a wff is represented by a natural number, and the "real" consistency, where a wff is represented as a second-order sequence, which is a stronger notion. It is shown that the system can prove at least its Godel consistency and that closely allied systems can prove their real consistency

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

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
562 (#32,721)

6 months
1 (#1,478,500)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

No references found.

Add more references