Order and strongly sober compactifications
Topology and category theory in computer science
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Power domains and iterated function systems
Information and Computation
The Versatile Continuous Order
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
A category of compositional domain-models for separable stone spaces
Theoretical Computer Science
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
The regular spaces with countably based models
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
Measuring the probabilistic powerdomain
Theoretical Computer Science - Special issue on automata, languages and programming
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
Partial metrisability of continuous posets
Mathematical Structures in Computer Science
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
On computational environments of topological spaces
Theoretical Computer Science
Lawson topology of the space of formal balls and the hyperbolic topology
Theoretical Computer Science
A computable approach to measure and integration theory
Information and Computation
The space of formal balls and models of quasi-metric spaces
Mathematical Structures in Computer Science
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls†
Mathematical Structures in Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper shows that it is precisely the complete metrizable separable metric spaces that can be realized as the set of maximal points of an ω-continuous dcpo, where the set of maximal points is topologized with the relative Scott topology.