Equivalence of F with a sub-theory of peano arithmetic
| Abstract | In a short, technical note, the system of arithmetic, F, introduced in Systems for a Foundation of Arithmetic and "True" Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity, is demonstrated to be equivalent to a sub-theory of Peano Arithmetic; the sub-theory is missing, most notably, the Successor Axiom | |||||||||
| 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,709 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesJ. Michael Dunn (1980). Quantum Mathematics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Shmuel Lifsches & Saharon Shelah (1997). Peano Arithmetic May Not Be Interpretable in the Monadic Theory of Linear Orders. Journal of Symbolic Logic 62 (3):848-872.
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads10 ( #106,476 of 549,769 )Recent downloads (6 months)2 ( #37,450 of 549,769 )How can I increase my downloads? |
My notes
Discussion
