Recursion theoretic operators and morphisms on numbered sets

DOI10.4064/fm-119-1-49-62zbMath0548.03023OpenAlexW1522696447MaRDI QIDQ3340845

Hendrik Pieter Barendregt

Publication date: 1983

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

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

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

Related Items

On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Computability in higher types, P\(\omega\) and the completeness of type assignment, Type 2 recursion theory