David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 48 (4):913-920 (1983)
In this paper we continue, from , the development of provably recursive analysis, that is, the study of real numbers defined by programs which can be proven to be correct in some fixed axiom system S. In particular we develop the provable analogue of an effective operator on the set C of recursive real numbers, namely, a provably correct operator on the set P of provably recursive real numbers. In Theorems 1 and 2 we exhibit a provably correct operator on P which is discontinuous at 0; we thus disprove the analogue of the Ceitin-Moschovakis theorem of recursive analysis, which states that every effective operator on C is (effectively) continuous. Our final theorems show, however, that no provably correct operator on P can be proven (in S) to be discontinuous
|Keywords||No keywords specified (fix it)|
|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
Volker Halbach (2002). Review: Lev D. Beklemishev, Induction Rules, Reflection Principles, and Provably Recursive Functions. [REVIEW] Bulletin of Symbolic Logic 8 (2):302-303.
Alexander Kreuzer & Ulrich Kohlenbach (2009). Ramsey's Theorem for Pairs and Provably Recursive Functions. Notre Dame Journal of Formal Logic 50 (4):427-444.
António M. Fernandes & Fernando Ferreira (2002). Groundwork for Weak Analysis. Journal of Symbolic Logic 67 (2):557-578.
Daniel Leivant (1985). Syntactic Translations and Provably Recursive Functions. Journal of Symbolic Logic 50 (3):682-688.
Markus Michelbrink (2006). A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection. Journal of Symbolic Logic 71 (4):1237 - 1283.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Lloyd Humberstone & Timothy Williamson (1997). Inverses for Normal Modal Operators. Studia Logica 59 (1):33-64.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
William J. Collins (1978). Provably Recursive Real Numbers. Notre Dame Journal of Formal Logic 19 (4):513-522.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #440,654 of 1,101,605 )
Recent downloads (6 months)1 ( #292,059 of 1,101,605 )
How can I increase my downloads?