Computability over the Partial Continuous Functionals

Normann, Dag

Normann, Dag

J. Symbolic Logic, Tome 65 (2000) no. 1, p. 1133-1142 / Harvested from Project Euclid

Résumé

We show that to every recursive total continuous functional $\Phi$ there is a PCF-definable representative $\Psi$ of $\Phi$ 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.

Publié le : 2000-09-14
Classification:

@article{1183746172,
     author = {Normann, Dag},
     title = {Computability over the Partial Continuous Functionals},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 1133-1142},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746172}
}

Normann, Dag. Computability over the Partial Continuous Functionals. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  1133-1142. http://gdmltest.u-ga.fr/item/1183746172/