Admissible representations of effective cpo's

DOI10.1016/0304-3975(83)90083-XzbMath0582.68050OpenAlexW2047996743MaRDI QIDQ1068562

G. Schäfer, Weihrauch, Klaus

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90083-x

zbMATH Keywords

complete partial orderGödel numberingsadmissible numberingseffective cpo

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55) Theory of numerations, effectively presented structures (03D45)

Related Items

How much partiality is needed for a theory of computability?, On the topological aspects of the theory of represented spaces, European Summer Meeting of the Association for Symbolic Logic, Admissible representations of effective cpo's, Type 2 recursion theory, Theory of representations

Cites Work

• Admissible representations of effective cpo's
• \(\mathbb{T}^\omega\) as a universal domain
• Effectively given domains
• Computability concepts for programming language semantics
• Gödel numberings of partial recursive functions
• Rekursive Wortfunktionen
• Theorie der Numerierungen I
• Berechenbare Reelle Funktionen
• Data Types as Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item