Journal of Symbolic Logic

Axiomatic Recursion Theory and the Continuous Functionals

Simon Thompson

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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.

Article information

Source
J. Symbolic Logic, Volume 50, Issue 2 (1985), 442-450.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183741850

Mathematical Reviews number (MathSciNet)
MR793124

Zentralblatt MATH identifier
0589.03031

JSTOR
links.jstor.org

Citation

Thompson, Simon. Axiomatic Recursion Theory and the Continuous Functionals. J. Symbolic Logic 50 (1985), no. 2, 442--450. https://projecteuclid.org/euclid.jsl/1183741850


Export citation