David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 49 (4):1319-1332 (1984)
A type-structure of partial effective functionals over the natural numbers, based on a canonical enumeration of the partial recursive functions, is developed. These partial functionals, defined by a direct elementary technique, turn out to be the computable elements of the hereditary continuous partial objects; moreover, there is a commutative system of enumerations of any given type by any type below (relative numberings). By this and by results in  and , the Kleene-Kreisel countable functionals and the hereditary effective operations (HEO) are easily characterized
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Giuseppe Longo (1988). On Church's Formal Theory of Functions and Functionals. Annals of Pure and Applied Logic 40 (2):93-133.
Similar books and articles
Dag Normann (2006). Computing with Functionals: Computability Theory or Computer Science? Bulletin of Symbolic Logic 12 (1):43-59.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
Jeremy Avigad (1998). Predicative Functionals and an Interpretation of ID<Ω. Annals of Pure and Applied Logic 92 (1):1-34.
Helmut Schwichtenberg (1999). Monotone Majorizable Functionals. Studia Logica 62 (2):283-289.
Viggo Stoltenberg-Hansen & John V. Tucker (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic 9 (3):299-334.
Solomon Feferman (1996). Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams. Annals of Pure and Applied Logic 81 (1-3):75-113.
Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Peter G. Hinman (1973). Degrees of Continuous Functionals. Journal of Symbolic Logic 38 (3):393-395.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Added to index2009-01-28
Total downloads8 ( #250,895 of 1,699,674 )
Recent downloads (6 months)3 ( #206,271 of 1,699,674 )
How can I increase my downloads?