On effective topological spaces

DOI10.2307/2586596zbMath0915.03038OpenAlexW2010975208MaRDI QIDQ4391431

Dieter Spreen

Publication date: 27 June 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586596

zbMATH Keywords

continuous functionalsopen setsScott domainseffective continuitycanonical topology of effectively given metric spaceseffectively presented topological spacessemidecidable sets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of numerations, effectively presented structures (03D45)

Related Items (19)

Towards a descriptive set theory for domain-like structures ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ On images of partial computable functions over computable Polish spaces ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Some results related to the continuity problem ⋮ On Turing degrees of points in computable topology ⋮ Recursive quasi-metric spaces. ⋮ Computability on subsets of metric spaces. ⋮ Computable and Continuous Partial Homomorphisms on Metric Partial Algebras ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Program self-reference in constructive Scott subdomains ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Strong reducibility of partial numberings ⋮ Outline of partial computability in computable topology ⋮ On higher effective descriptive set theory ⋮ Unnamed Item ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total sets and objects in domain theory
• Continuity and comprehension in intuitionistic formal systems
• Computability concepts for programming language semantics
• On some decision problems in programming
• Effective inseparability in a topological setting
• Effective operations on partial recursive functions
• A Comparison of Five “Computable” Operators
• Discontinuities of provably correct operators on the provably recursive real numbers
• Effectively given domains and lambda-calculus models
• Theorie der Numerierungen I
• Completeness of Quasi-Uniform and Syntopological Spaces
• Processes and the denotational semantics of concurrency
• On Effectively Computable Operators

This page was built for publication: On effective topological spaces