David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
The system called F is essentially a sub-theory of Frege Arithmetic without the ad infinitum assumption that there is always a next number. In a series of papers (Systems for a Foundation of Arithmetic, True” Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity) it was shown that F proves a large number of basic arithmetic truths, such as the Euclidean Algorithm, Unique Prime Factorization (i.e. the Fundamental Law of Arithmetic), and Quadratic Reciprocity, indeed a sizable amount of arithmetic. In particular, F proves some (but not all) of the Peano Axioms; that is, F proves the axioms of a sub-theory - call it FPA - of second-order Peano-Arithmetic. This short technical note will demonstrate that the converse also holds, in the following sense. F has the same language as second-order Peano Arithmetic except that, in addition, it has a two-place predicate symbol “Μ”. Then it is possible to provide a definition, indeed a reasonable definition, for “Μ” such that FPA proves all the axioms of F. So F and FPA effectively have the same proof-theoretic strength. In particular FPA, which lacks the Successor Axiom stating that every natural number has a successor, is able to prove the Euclidean Algorithm, Unique Prime Factorization, and Quadratic Reciprocity, indeed (again) a sizable amount of arithmetic.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
Charles Sayward (2005). Why Axiomatize Arithmetic? Sorites 16:54-61.
Richard Heck (1993). The Development of Arithmetic in Frege's Grundgesetze der Arithmetik. Journal of Symbolic Logic 58 (2):579-601.
J. 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.
Charles Sayward (2000). Remarks on Peano Arithmetic. Russell 20:27-32.
Richard Kaye (1991). Model-Theoretic Properties Characterizing Peano Arithmetic. Journal of Symbolic Logic 56 (3):949-963.
Added to index2010-12-22
Total downloads13 ( #125,691 of 1,099,913 )
Recent downloads (6 months)5 ( #67,010 of 1,099,913 )
How can I increase my downloads?