Article contents
Axiomatic recursion theory and the continuous functionals
Published online by Cambridge University Press: 12 March 2014
Abstract
We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a theory. We also discuss Hyland's proposal from [4] for a scheme with which to supplement S1–S9, and show that this augmented set of schemes fails to generate countable recursion. We make another proposal to which the methods of this section do not apply.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1985
References
REFERENCE
- 1
- Cited by