Mathematical Structures in Computer Science · 2009 · 31 citations · 15 references
Natural SciencesMathematicsDiscrete MathematicsSet TheoryTopologyMetric GeometryMetric SpacesPartial OrdersPartially Ordered SetsTopological SpacesCompletenessDomain TheoryQuasi-metric Spaces
In this paper we study quasi-metric spaces using domain theory. Our main objective in this paper is to study the maximal point space problem for quasi-metric spaces. Here we prove that quasi-metric spaces that satisfy certain completeness properties, such as Yoneda and Smyth completeness, can be modelled by continuous dcpo's. To achieve this goal, we first study the partially ordered set of formal balls ( B X , ⊑) of a quasi-metric space ( X , d ). Following Edalat and Heckmann, we prove that the order properties of ( B X , ⊑) are tightly connected to topological properties of ( X , d ). In particular, we prove that ( B X , ⊑) is a continuous dcpo if ( X , d ) is algebraic Yoneda complete. Furthermore, we show that this construction gives a model for Smyth-complete quasi-metric spaces. Then, for a given quasi-metric space ( X , d ), we introduce the partially ordered set of abstract formal balls ( B X , ⊑, ≺). We prove that if the conjugate space ( X , d −1 ) of a quasi-metric space ( X , d ) is right K -complete, then the ideal completion of ( B X , ⊑, ≺) is a model for ( X , d ). This construction provides a model for any Yoneda-complete quasi-metric space ( X , d ), as well as the Sorgenfrey line, Kofner plane and Michael line.
15
Janet Kelly · Proceedings of the London Mathematical Society · 1963 · 326 citations
A computational model for metric spaces
Abbas Edalat, Reinhold Heckmann · Theoretical Computer Science · 1998 · 182 citations
Dynamical Systems, Measures, and Fractals via Domain Theory
Abbas Edalat · Information and Computation · 1995 · 133 citations
Jimmie Lawson · Mathematical Structures in Computer Science · 1997 · 118 citations