Computability over the partial continuous functionals

Computability over the partial continuous functionals

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of symbolic logic 2000-09, Vol.65 (3), p.1133-1142
1. Verfasser: Normann, Dag
Format: Artikel
Sprache:eng
Schlagworte:
Computability
Conceptual hierarchies
Induction assumption
Logical theorems
Mathematical functions
Mathematical logic
Mathematical theorems
Mathematics
Natural numbers
Programming languages
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0022-4812
1943-5886
DOI:10.2307/2586691