Sciweavers

FCT
2005
Springer

Completeness and Compactness of Quantitative Domains

14 years 26 days ago
Completeness and Compactness of Quantitative Domains
In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets directed-completeness and partial metric completeness are interdefinable. Moreover, we demonstrate that Lawson-compact, countably based domains are precisely the compact pmetric spaces that are continuously ordered.
Pawel Waszkiewicz
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where FCT
Authors Pawel Waszkiewicz
Comments (0)