Handbook of logic in computer science (vol. 1)
Mathematical theory of domains
Mathematical theory of domains
Handbook of logic in computer science (vol. 3)
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
An abstract data type for real numbers
Theoretical Computer Science
Domain representations of topological spaces
Theoretical Computer Science
Computable analysis: an introduction
Computable analysis: an introduction
Real number computation through gray code embedding
Theoretical Computer Science
Computational Dimension of Topological Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Uniform Domains and Uniform Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
A Stream Calculus of Bottomed Sequences for Real Number Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Every compact metric space $X$ is homeomorphically embedded in an $\omega$-algebraic domain $D$ as the set of minimal limit (that is, non-finite) elements. Moreover, $X$ is a retract of the set $L(D)$ of all limit elements of $D$. Such a domain $D$ can be chosen so that it has property M and finite-branching, and the height of $L(D)$ is equal to the small inductive dimension of $X$. We also show that the small inductive dimension of $L(D)$ as a topological space is equal to the height of $L(D)$ for domains with property M. These results give a characterisation of the dimension of a space $X$ as the minimal height of $L(D)$ in which $X$ is embedded as the set of minimal elements. The domain in which we embed an $n$-dimensional compact metric space $X$ ($n \leq \infinity$) has a concrete structure in that it consists of finite/infinite sequences in $\{0,1,\bot\}$ with at most $n$ copies of $\bot$.