Journal of Symbolic Logic 50 (2):442-450 (1985)
|Abstract||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)|
|Through your library||Configure|
Similar books and articles
Christopher Moore (1996). Recursion Theory on the Reals and Continuous-Time Computation. Theoretical Computer Science 162:23--44.
Andreas Weiermann (1998). How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. Journal of Symbolic Logic 63 (4):1348-1370.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Solomon Feferman, Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams.
Helmut Schwichtenberg (1999). Monotone Majorizable Functionals. Studia Logica 62 (2):283-289.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.
Peter G. Hinman (1973). Degrees of Continuous Functionals. Journal of Symbolic Logic 38 (3):393-395.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,556 of 548,987 )
Recent downloads (6 months)0
How can I increase my downloads?