"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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesDan 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.
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.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads41 ( #28,484 of 556,837 )Recent downloads (6 months)3 ( #27,255 of 556,837 )How can I increase my downloads? |
My notes
Discussion
