Results 1 
3 of
3
A simple proof of Parsons' theorem
"... Let I# 1 be the fragment of elementary Peano Arithmetic in which induction is restricted to #1formulas. More than three decades ago, Charles Parsons showed that the provably total functions of I# 1 are exactly the primitive recursive functions. In this paper, we observe that Parsons' resul ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Let I# 1 be the fragment of elementary Peano Arithmetic in which induction is restricted to #1formulas. More than three decades ago, Charles Parsons showed that the provably total functions of I# 1 are exactly the primitive recursive functions. In this paper, we observe that Parsons' result is a consequence of Herbrand's theorem concerning the of universal theories. We give a selfcontained proof requiring only basic knowledge of mathematical logic.
Primitive Recursive Arithmetic and its Role in the Foundations of Arithmetic: Historical and Philosophical Reflections In Honor of Per MartinLöf on the Occasion of His Retirement
"... We discuss both the historical roots of Skolem’s primitive recursive arithmetic, its essential role in the foundations of arithmetic, its relation to the finitism of Hilbert and Bernays, and its relation to Kant’s philosophy of mathematics. 1. Skolem tells us in the Concluding Remark of his seminal ..."
Abstract
 Add to MetaCart
(Show Context)
We discuss both the historical roots of Skolem’s primitive recursive arithmetic, its essential role in the foundations of arithmetic, its relation to the finitism of Hilbert and Bernays, and its relation to Kant’s philosophy of mathematics. 1. Skolem tells us in the Concluding Remark of his seminal paper on primitive recursive arithmetic (PRA), “The foundations of arithmetic established by means of the recursive mode of thought, without use of apparent variables ranging over infinite domains ” [1923], that the paper was written in 1919 after he had studied Whitehead and Russell’s Principia Mathematica and in reaction to that work. His specific complaint about the foundations of arithmetic (i.e. number theory) in that work was, as implied by his title, the essential role in it of logic and in particular quantification over infinite domains, even for the understanding of the most elementary propositions of arithmetic such as polynomial equations; and he set about to eliminate these infinitary quantifications by means of the “recursive mode of thought. ” On this ground, not only polynomial equations, but all primitive recursive formulas stand on their own feet without logical underpinning. 2. Skolem’s 1923 paper did not include a formal system of arithmetic, but as he noted in his 1946 address, “The development of recursive arithmetic” [1947], formalization of the methods used in that paper results in one of the many equivalent systems we refer to as PRA. Let me stop here and briefly describe one such system. ∗Is paper is loosely based on the Skolem Lecture that I gave at the University of Oslo in June, 2010. The present paper has profited, both with respect to what it now contains and with respect to what it no longer contains, from the discussion following that lecture. 1 We admit the following finitist types1 of objects: