Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

FCT
2005
Springer

favoriteEmaildiscussreport

111views Applied Computing» more FCT 2005»

Completeness and Compactness of Quantitative Domains

14 years 4 months ago

Completeness and Compactness of Quantitative Domains

Download www.tcs.uj.edu.pl

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 interdeﬁnable. Moreover, we demonstrate that Lawson-compact, countably based domains are precisely the compact pmetric spaces that are continuously ordered.

Pawel Waszkiewicz

Real-time Traffic

Compact Pmetric Spaces | FCT 2005 | Order Completeness | Partial Metric Completeness |

claim paper

Related Content

» Quantitative Domains Groupoids and Linear Logic

» Complete Axioms for Categorical FixedPoint Operators

» A Complete Multivalued SAT Solver

» Quantitative analysis of EGR proteins binding to DNA assessing additivity in both the bind...

» Avoiding the Disk Bottleneck in the Data Domain Deduplication File System

» From Local Patterns to Global Models Towards Domain Driven Educational Process Mining

» Remembering Why to Remember PerformanceGuided CaseBase Maintenance

» Box Constraint Collections for Adhoc Constraints

» MultiDomain Surety Modeling and Analysis for High Assurance Systems

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FCT
Authors	Pawel Waszkiewicz

Comments (0)