Journal of Symbolic Logic 65 (3):1133-1142 (2000)
|Abstract||We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming language for computable functionals. PCF-definable is equivalent to Kleene's S1-S9-computable over the partial continuous functionals|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Erik Palmgren & Viggo Stoltenberg-Hansen (1997). A Logical Presentation of the Continuous Functionals. Journal of Symbolic Logic 62 (3):1021-1034.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Viggo Stoltenberg-Hansen & John V. Tucker (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic 9 (3):299-334.
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.
Dag Normann (2006). Computing with Functionals: Computability Theory or Computer Science? Bulletin of Symbolic Logic 12 (1):43-59.
Dag Normann (1983). Characterizing the Continuous Functionals. Journal of Symbolic Logic 48 (4):965-969.
Peter G. Hinman (1973). Degrees of Continuous Functionals. Journal of Symbolic Logic 38 (3):393-395.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Added to index2009-01-28
Total downloads2 ( #232,575 of 549,124 )
Recent downloads (6 months)0
How can I increase my downloads?