In computable analysis recursive metric spaces play an important role, since these are, roughly speaking, spaces with computable metric and limit operation. Unfortunately, the concept of a metric space is not powerful enough to capture all interesting phenomena which occur in computable analysis. So
Bicompleting weightable quasi-metric spaces and partial metric spaces
✍ Scribed by S. Oltra; S. Romaguera; E. A. Sánchez-Pérez
- Publisher
- Springer Milan
- Year
- 2002
- Tongue
- Italian
- Weight
- 147 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0009-725X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In [Sch00] a bijection has been established, for the case of semilattices, between invariant partial metrics and semivaluations. Semivaluations are a natural generalization of valuations on lattices to the context of semilattices and arise in many different contexts in Quantitative Domain Theory ([S
The complexity (quasi-metric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms . Applications of this theory to the complexity analysis of Divide and Conquer algorithms have been discussed by . Here we obtain several quasi-
## Abstract Regular left __K__‐sequentially complete quasi‐metric spaces are characterized. We deduce that these spaces are complete Aronszajn and that every metrizable space admitting a left __K__‐sequentially complete quasi‐metric is completely metrizable. We also characterize quasi‐metric spaces