David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 26 (3):311-339 (1997)
A realizability notion that employs only Kalmar elementary functions is defined, and, relative to it, the soundness of EA-(Π₁⁰-IR), a fragment of Heyting Arithmetic (HA) with names and axioms for all elementary functions and induction rule restricted to Π₁⁰ formulae, is proved. As a corollary, it is proved that the provably recursive functions of EA-(Π₁⁰-IR) are precisely the elementary functions. Elementary realizability is proposed as a model of strict arithmetic constructivism, which allows only those constructive procedures for which the amount of computational resources required can be bounded in advance
|Categories||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
Steve Awodey, Carsten Butz & Alex Simpson (2007). Relating First-Order Set Theories and Elementary Toposes. Bulletin of Symbolic Logic 13 (3):340-358.
Zlatan Damnjanovic (1994). Elementary Functions and LOOP Programs. Notre Dame Journal of Formal Logic 35 (4):496-522.
Robert R. Tompkins (1968). On Kleene's Recursive Realizability as an Interpretation for Intuitionistic Elementary Number Theory. Notre Dame Journal of Formal Logic 9 (4):289-293.
George Mills (1978). A Model of Peano Arithmetic with No Elementary End Extension. Journal of Symbolic Logic 43 (3):563-567.
Lou van Den Dries (1988). On the Elementary Theory of Restricted Elementary Functions. Journal of Symbolic Logic 53 (3):796 - 808.
Lou van den Dries (1988). On the Elementary Theory of Restricted Elementary Functions. Journal of Symbolic Logic 53 (3):796-808.
Jaap Van Oosten (1990). Lifschitz' Realizability. Journal of Symbolic Logic 55 (2):805 - 821.
Zlatan Damnjanovic (1994). Strictly Primitive Recursive Realizability, I. Journal of Symbolic Logic 59 (4):1210-1227.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Added to index2009-01-28
Total downloads44 ( #53,802 of 1,696,586 )
Recent downloads (6 months)7 ( #79,846 of 1,696,586 )
How can I increase my downloads?