Ideal models of spaces

Authors:
Keye Martin
Affiliations:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK
Venue:
Theoretical Computer Science - Topology in computer science
Year:
2003

Citing 12
Cited 3

Topology

Handbook of logic in computer science (vol. 1)
Dynamical systems, measures, and fractals via domain theory

Information and Computation
Domain theory and integration

Selected papers of the workshop on Topology and completion in semantics
Domain theory

Handbook of logic in computer science (vol. 3)
A computational model for metric spaces

Theoretical Computer Science
A category of compositional domain-models for separable stone spaces

Theoretical Computer Science
A Renee Equation for Algorithmic Complexity

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Domains for Denotational Semantics

Proceedings of the 9th Colloquium on Automata, Languages and Programming
A foundation for computation

A foundation for computation
The regular spaces with countably based models

Theoretical Computer Science - Topology in computer science
When Scott is weak on the top

Mathematical Structures in Computer Science
Spaces of maximal points

Mathematical Structures in Computer Science

The regular spaces with countably based models

Theoretical Computer Science - Topology in computer science
Partial metrisability of continuous posets

Mathematical Structures in Computer Science
On computational environments of topological spaces

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ideal domains have an elementary order theoretic structure: Every element is either compact or maximal. Despite this, we establish that (1) They can model any space currently known to possess a countably based model, and (2) The metric spaces with ideal models are exactly the completely metrizable spaces.