Computability theory in admissible domains

DOI10.1145/800133.804337zbMath1282.68093OpenAlexW2080955444MaRDI QIDQ5402546

No author found.

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804337

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Some results related to the continuity problem, Chain properties in Pomega, Towards Computability over Effectively Enumerable Topological Spaces, Computable one-to-one enumerations of effective domains, Unnamed Item, Algebraic relations and presentations, Total objects of domains