Computability over the partial continuous functionals

DOI10.2307/2586691MaRDI QIDQ4527914zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Recursion on the partial continuous functionals
• Exact real number computations relative to hereditarily total functionals.
• scientific article; zbMATH DE number 873331
• scientific article; zbMATH DE number 1531376
• scientific article; zbMATH DE number 1531361

Cited in

(15)

• Continuous and monotone machines
• Nonflatness and totality
• Exact real number computations relative to hereditarily total functionals.
• scientific article; zbMATH DE number 1088270 (Why is no real title available?)
• On the Cantor-Bendixson rank of a set that is searchable in Gödel's T
• The Veblen functions for computability theorists
• On the ubiquity of certain total type structures
• Computing with Functionals—Computability Theory or Computer Science?
• The recursion hierarchy for PCF is strict
• Models of computation for partial functions on the reals
• Computability of products of chainable continua
• Computability and the Implicit Function Theorem
• scientific article; zbMATH DE number 1531371 (Why is no real title available?)
• Towards a formal theory of computability
• Operational domain theory and topology of sequential programming languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527914)