On Upper Weightable Spaces

Annals of the New York Academy of Sciences

Volumn 806, Issue , 1996, Pages 348-363

  Schellekens, M ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

(Weightable) quasi pseudo metrics; Complexity; Directed partial orders; Join semilattices

Indexed keywords

EID: 3142587239     PISSN: 00778923     EISSN: None     Source Type: Book Series    
DOI: 10.1111/j.1749-6632.1996.tb49180.x     Document Type: Article

References (14)

1. FLAGG, R.C. & R.D. KOPPERMAN. 1993. The asymmetric topology of Computer Science. Mathematical Foundations of Programming Semantics.
2. FLETCHER, P. & W. LINDGREN. 1982. Quasi-uniform spaces, Marcel Dekker, Inc. New York.
3. KAHN, G. 1974. The semantics of a simple language for parallel processing. Proc. IFIP Conf.
4. KÜNZI, H.P. & V. VAJNER. 1993. Weighted quasi-metrics. Proc. Summer Conf. Queens College. Papers on General Topology and Applications. 728: 64-77. Annals of the New York Academy of Sciences. New York.
5. KÜNZI, H.P. 1993. Nonsymmetric topology. Proceedings Szekszard Conference.
6. MATTHEWS, S.G. 1994. Partial metric spaces. Papers on General Topology and Applications. 728: 183-197. Annals of the New York Academy of Sciences. New York.
7. MATTHEWS, S.G. 1992. The topology of partial metric spaces. Papers on General Topology and Applications. Annals of the New York Academy of Sciences. New York.
8. MURDESHWAR, M.G. & S.A. NAIMPALLY. 1966. Quasi-uniform topological spaces. Noordhoff.
9. NACHBIN, L. 1965. Topology and order. New York Mathematical Studies, Vol. 4. Princeton, NJ.
10. SCHELLEKENS, M. 1995. The Smyth completion: a common foundation for denotational semantics and complexity analysis. Electronic Notes in Theoretical Computer Science, Vol. I. Proc. 11th Conf. on the Mathematical Foundations of Programming Semantics. Elsevier. New York. 211-232.
11. SCHELLEKENS, M. Weightable directed spaces. Manuscript.
12. SMYTH, M. 1987. Quasi-uniformities: Reconciling domains with metric spaces. Lecture Notes in Computer Science 298. Springer Verlag. New York.
13. SMYTH, M. 1991. Totally bounded spaces and compact ordered spaces as domains of computation. In: Topology and Category Theory in Computer Science. 207-229. Oxford University Press. Oxford.
14. WADGE, W.W. 1981. An extensional treatment of dataflow deadlock. Theoretical Computer Science. 13.