Article contents
Discontinuities of provably correct operators on the provably recursive real numbers
Published online by Cambridge University Press: 12 March 2014
Abstract
In this paper we continue, from [2], 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 of recursive real numbers, namely, a provably correct operator on the set
of provably recursive real numbers. In Theorems 1 and 2 we exhibit a provably correct operator on
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
is (effectively) continuous. Our final theorems show, however, that no provably correct operator on
can be proven (in S) to be discontinuous.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1983
References
REFERENCES
- 4
- Cited by