Elements of Generalized Ultrametric Domain Theory

textabstractA generalized ultrametric space is an ordinary ultrametric space in which the distance need not be symmetric, and where different elements may have distance 0. Our interest in generalized ultrametric spaces is primarily motivated by the following observations: 1. (possibly nondeterministic) transition systems can be naturally endowed with a generalized ultrametric that captures their operational behavior in terms of simulations; 2. the category of generalized ultrametric spaces contains both the categories of preorders and of ordinary ultrametric spaces as full subcategories. A theory of generalized ultrametric spaces is developed along the lines of the work by Smyth and Plotkin (1982) and America and Rutten (1989), such that its restriction to preorders and ordinary ultrametric spaces yields (more and less) familiar facts. Our work has in common with other recent work along the same lines---by Flagg and Kopperman, and Wagner---that it is directly based on Lawvere's V-categorical interpretation of metric spaces, and uses results on quasimetrics by Smyth. It is different in being far less general, and consequently a number of new results, specific for generalized ultrametric spaces, is obtained. In particular, domain equations are solved by means of metric adjoint pairs, and the notions of (generalized) totally-boundedness and bifinite (or `SFU') domain are introduced and characterized.

[1]  Franck van Breugel,et al.  Solving Domain Equations in a Category of Compact Metric Spaces. , 1994 .

[2]  Ralph Kopperman,et al.  Continuity Spaces: Reconciling Domains and Metric Spaces , 1997, Theor. Comput. Sci..

[3]  Jan Rutten Elements of generalized ultrametric domain theory , 1996 .

[4]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[5]  Kim R. Wagner,et al.  Solving Recursive Domain Equations with Enriched Categories. , 1994 .

[6]  Glynn Winskel,et al.  Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.

[7]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[8]  Jan J. M. M. Rutten,et al.  Solutions of functorial and non-functorial metric domain equations , 1995, MFPS.

[9]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  Jan J. M. M. Rutten,et al.  On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.

[11]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[12]  Pierre America,et al.  Solving Reflexive Domain Equations in a Category of Complete Metric Spaces , 1987, J. Comput. Syst. Sci..

[13]  A. Jung,et al.  Cartesian closed categories of domains , 1989 .

[14]  Marcello M. Bonsangue,et al.  Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding , 1995, Theor. Comput. Sci..

[15]  Michael B. Smyth,et al.  Totally bounded spaces and compact ordered spaces as domains of computation , 1991 .

[16]  Robert E. Kent The Metric Closure Powerspace Construction , 1987, MFPS.

[17]  Michael B. Smyth,et al.  Quasi Uniformities: Reconciling Domains with Metric Spaces , 1987, MFPS.

[18]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[19]  G. M. Kelly,et al.  A notion of limit for enriched categories , 1975, Bulletin of the Australian Mathematical Society.