Totally bounded spaces and compact ordered spaces as domains of computation
Topology and category theory in computer science
Handbook of logic in computer science (vol. 3)
Continuity spaces: reconciling domains and metric spaces
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Generalized metric spaces: completion, topology, and power domains via the Yoneda embedding
Theoretical Computer Science
A computational model for metric spaces
Theoretical Computer Science
The essence of ideal completion in quantitative form
Theoretical Computer Science
Partial Metrics, Valuations and Domain Theory
Partial Metrics, Valuations and Domain Theory
A foundation for computation
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
The Hausdorff fuzzy quasi-metric
Fuzzy Sets and Systems
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls†
Mathematical Structures in Computer Science
Hyperspaces of a weightable quasi-metric space: Application to models in the theory of computation
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In this article, we characterise all continuous posets that are partially metrisable in their Scott topology. We present conditions for pmetrisability, which are both necessary and sufficient, in terms of measurements, domain-theoretic bases and, in a more general setting, in terms of radially convex metrics. These conditions, together with their refinements and generalisations, set a natural hierarchy on the class of partially metrised posets. We locate the class of countably-based continuous dcpos within this hierarchy.