Recursion theoretic operators and morphisms on numbered sets

DOI10.4064/FM-119-1-49-62MaRDI QIDQ3340845zbMATH OpenOpenAlexFDO

Authors Henk Barendregt, Giuseppe Longo

Publication date 1983

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/211416

zbMATH Keywords

continuitycomplete partial ordersenumeration operatorstype 2 computabilitypartial operatorsCanonical numberingsCantor's topologycomputable operators on type 2 setsScott's topologyTuring operators

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 4087654
• Type 2 recursion theory
• scientific article; zbMATH DE number 3887669
• scientific article; zbMATH DE number 4037847
• scientific article; zbMATH DE number 3933051

Cited in

(7)

• Type 2 recursion theory
• Computability in higher types, P and the completeness of type assignment
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Generic objects in recursion theory. II: Operations on recursive approximation spaces
• scientific article; zbMATH DE number 3957084 (Why is no real title available?)

This page was built for publication: Recursion theoretic operators and morphisms on numbered sets

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