Computable one-to-one enumerations of effective domains

DOI10.1016/0890-5401(90)90032-DzbMath0691.68053OpenAlexW2060902871MaRDI QIDQ582908

Dieter Spreen

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90032-d

zbMATH Keywords

numberingscomplete partial orderseffective domains

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Data structures (68P05) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

How much partiality is needed for a theory of computability? ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Program self-reference in constructive Scott subdomains ⋮ Some applications of computable one-one numberings

Cites Work

• A connotational theory of program structure
• Effectively given domains
• The independence of control structures in abstract programming systems
• Computability concepts for programming language semantics
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Decomposition of Gödelnumberings into Friedbergnumberings
• Theorie der Numerierungen I
• Computability theory in admissible domains
• Godel Numberings Versus Friedberg Numberings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable one-to-one enumerations of effective domains