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)|
References found in this work BETA
Provably Recursive Real Numbers.William J. Collins - 1978 - Notre Dame Journal of Formal Logic 19 (4):513-522.
Citations of this work BETA
No citations found.
Similar books and articles
Review: Lev D. Beklemishev, Induction Rules, Reflection Principles, and Provably Recursive Functions. [REVIEW]Volker Halbach - 2002 - Bulletin of Symbolic Logic 8 (2):302-303.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Groundwork for Weak Analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
Syntactic Translations and Provably Recursive Functions.Daniel Leivant - 1985 - Journal of Symbolic Logic 50 (3):682-688.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
Variations on a Theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Inverses for Normal Modal Operators.Lloyd Humberstone & Timothy Williamson - 1997 - Studia Logica 59 (1):33-64.
Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Added to index2009-01-28
Total downloads13 ( #340,343 of 2,146,257 )
Recent downloads (6 months)4 ( #185,332 of 2,146,257 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.