Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 50, Issue 2 (1985), 442-450.
Axiomatic Recursion Theory and the Continuous Functionals
We define, in the spirit of Fenstad , 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  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.
J. Symbolic Logic, Volume 50, Issue 2 (1985), 442-450.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Thompson, Simon. Axiomatic Recursion Theory and the Continuous Functionals. J. Symbolic Logic 50 (1985), no. 2, 442--450. https://projecteuclid.org/euclid.jsl/1183741850