Computability over the partial continuous functionals

Journal of Symbolic Logic 65 (3):1133-1142 (2000)
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)
Categories (categorize this paper)
DOI 10.2307/2586691
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,781
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Axiomatic Recursion Theory and the Continuous Functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Characterizing the Continuous Functionals.Dag Normann - 1983 - Journal of Symbolic Logic 48 (4):965-969.
Degrees of Continuous Functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
Added to PP index

Total downloads
57 ( #95,465 of 2,199,496 )

Recent downloads (6 months)
1 ( #299,438 of 2,199,496 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature