A Natural First-Order System of Arithmetic Which Proves Its Own Consistency

Abstract

Herein is presented a natural first-order arithmetic system which can prove its own consistency, both in the weaker Godelian sense using traditional Godel numbering and, more importantly, in a more robust and direct sense; yet it is strong enough to prove many arithmetic theorems, including the Euclidean Algorithm, Quadratic Reciprocity, and Bertrand’s Postulate.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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
2011-11-12

Downloads
413 (#50,254)

6 months
1 (#1,515,053)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references