Dynamical systems, measures, and fractals via domain theory
Information and Computation
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Elements of generalized ultrametric domain theory
Theoretical Computer Science
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
On the Yoneda completion of a quasi-metric space
Theoretical Computer Science
Mathematical Structures in Computer Science
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Fundamental study: Complete and directed complete Ω-categories
Theoretical Computer Science
Theoretical Computer Science
On Domain Theory over Girard Quantales
Fundamenta Informaticae
The space of formal balls and models of quasi-metric spaces
Mathematical Structures in Computer Science
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
Continuity in quantitative domains
Fuzzy Sets and Systems
The limit–colimit coincidence theorem for -categories
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We generalise the construction of the formal ball model for metric spaces due to A. Edalat and R. Heckmann in order to obtain computational models for separated -categories. We fully describe -categories that are (a)Yoneda complete (b)continuous Yoneda complete via their formal ball models. Our results yield solutions to two open problems in the theory of quasi-metric spaces by showing that: (a)a quasi-metric space X is Yoneda complete if and only if its formal ball model is a dcpo, and (b)a quasi-metric space X is continuous and Yoneda complete if and only if its formal ball model BX is a domain that admits a simple characterisation of approximation.