Expressing and capturing the primitive recursive functions
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
The last Episode wasn’t about logic or formal theories at all: it was about common-or-garden arithmetic and the informal notion of computability. We noted that addition can be defined in terms of repeated applications of the successor function. Multiplication can be defined in terms of repeated applications of addition. The exponential and factorial functions can be defined, in different ways, in terms of repeated applications of multiplication. There’s already a pattern emerging here! The main task in the last Episode was to get clear about this pattern. So first we said more about the idea of defining one function in terms of repeated applications of another function. Tidied up, that becomes the idea of defining a function by primitive recursion (Defn. 27).
|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
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Joachim Lambek & Philip Scott (2005). An Exactification of the Monoid of Primitive Recursive Functions. Studia Logica 81 (1):1 - 18.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Arnold Beckmann (2002). Proving Consistency of Equational Theories in Bounded Arithmetic. Journal of Symbolic Logic 67 (1):279-296.
Michael Rathjen (1992). A Proof-Theoretic Characterization of the Primitive Recursive Set Functions. Journal of Symbolic Logic 57 (3):954-969.
Andreas Weiermann (1998). How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. Journal of Symbolic Logic 63 (4):1348-1370.
Charles Sayward (2000). Remarks on Peano Arithmetic. Russell 20 (1):27-32.
Zlatan Damnjanovic (1994). Strictly Primitive Recursive Realizability, I. Journal of Symbolic Logic 59 (4):1210-1227.
G. L. McColm (1989). Some Restrictions on Simple Fixed Points of the Integers. Journal of Symbolic Logic 54 (4):1324-1345.
Added to index2009-11-28
Total downloads5 ( #506,084 of 1,902,204 )
Recent downloads (6 months)0
How can I increase my downloads?