Journal of Symbolic Logic 50 (2):442-450 (1985)
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
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
The Continuous Functionals; Computations, Recursions and Degrees.Dag Normann - 1981 - Annals of Mathematical Logic 21 (1):1-26.
Citations of this work BETA
No citations found.
Similar books and articles
Recursion Theory on the Reals and Continuous-Time Computation.Christopher Moore - 1996 - Theoretical Computer Science 162:23--44.
How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
Generalized Recursion Theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York: American Elsevier Pub. Co..
Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams.Solomon Feferman - 1995 - Annals of Pure and Applied Logic 81 (1-3):75-113.
Computability Over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Added to index2009-01-28
Total downloads9 ( #458,311 of 2,158,920 )
Recent downloads (6 months)1 ( #353,777 of 2,158,920 )
How can I increase my downloads?