Axiomatic Recursion Theory and the Continuous Functionals
Thompson, Simon
J. Symbolic Logic, Tome 50 (1985) no. 1, p. 442-450 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 1985-06-14
Classification:  
@article{1183741850,
     author = {Thompson, Simon},
     title = {Axiomatic Recursion Theory and the Continuous Functionals},
     journal = {J. Symbolic Logic},
     volume = {50},
     number = {1},
     year = {1985},
     pages = { 442-450},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741850}
}

Thompson, Simon. Axiomatic Recursion Theory and the Continuous Functionals. J. Symbolic Logic, Tome 50 (1985) no. 1, pp.  442-450. http://gdmltest.u-ga.fr/item/1183741850/