Computability over the partial continuous functionals

DOI10.2307/2586691zbMath0964.03048OpenAlexW2016385284MaRDI QIDQ4527914

Dag Normann

Publication date: 16 July 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586691

zbMATH Keywords

recursive functionalspartial continuous functionalsPlotkin's programming language for computable functionalstotal continuous functional

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items (8)

Nonflatness and totality ⋮ On the ubiquity of certain total type structures ⋮ On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T ⋮ Unnamed Item ⋮ Operational domain theory and topology of sequential programming languages ⋮ Continuous and monotone machines ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ Exact real number computations relative to hereditarily total functionals.

This page was built for publication: Computability over the partial continuous functionals