Skip to main content
SpringerLink
Log in

Completeness and Compactness of Quantitative Domains

  • Conference paper
Fundamentals of Computation Theory (FCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3623))

Included in the following conference series:

  • 846 Accesses

Abstract

In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets directed-complete- ness and partial metric completeness are interdefinable. Moreover, we demonstrate that Lawson-compact, countably based domains are precisely the compact pmetric spaces that are continuously ordered.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Jung, A.: Domain Theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Oxford University Press, Oxford (1994)

    Google Scholar 

  2. Engelking, R.: General Topology. Sigma Series in Pure Mathematics. Heldermann Verlag (1989)

    Google Scholar 

  3. Flagg, R.C., Kopperman, R.: Continuity spaces: reconciling domains and metric spaces. Theoretical Computer Science 177(1), 111–138 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous lattices and domains. Encyclopedia of mathematics and its applications, vol. 93. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  5. Heckmann, R.: Power Domain Constructions (Potenzbereich-Konstruktionen). PhD Thesis, Universität des Saarlandes (1990)

    Google Scholar 

  6. Heckmann, R.: Approximation of metric spaces by partial metric spaces. Applied Categorical Structures 7, 71–83 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Künzi, H.-P.: Nonsymmetric topology. In: Bolyai Society of Mathematical Studies, vol. 4, pp. 303–338 (1993), Szekszárd, Hungary (Budapest 1995)

    Google Scholar 

  8. Künzi, H.-P., Vajner, V.: Weighted quasi-metrics. In: Papers on General Topology and Applications: Proceedings of the Eighth Summer Conference on General Topology and Its Applications. Ann. New York Acad. Sci, vol. 728, pp. 64–77 (1994)

    Google Scholar 

  9. Martin, K.: A foundation for computation. PhD Thesis, Tulane University, New Orleans LA 70118 (2000)

    Google Scholar 

  10. Martin, K.: The measurement process in domain theory. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 116. Springer, Heidelberg (2000)

    Google Scholar 

  11. Matthews, S.G.: Partial metric topology. In: Papers on General Topology and Applications: Proceedings of the Eighth Summer Conference on General Topology and Its Applications. Ann. New York Acad. Sci., vol. 728, pp. 64–77 (1994)

    Google Scholar 

  12. O’Neill, S.J.: Partial metrics, valuations and domain theory. Research Report CS-RR-293, Department of Computer Science, University of Warwick, Coventry, UK (1995)

    Google Scholar 

  13. Smyth, M.B.: Quasi-uniformities: reconciling domains and metric spaces. In: Main, M.G., Mislove, M.W., Melton, A.C., Schmidt, D. (eds.) MFPS 1987. LNCS, vol. 298, pp. 236–253. Springer, Heidelberg (1988)

    Google Scholar 

  14. Smyth, M.B.: Completeness of quasi-uniform and syntopological spaces. Journal of the London Mathematical Society 49, 385–400 (1994)

    MATH  MathSciNet  Google Scholar 

  15. Sünderhauf, P.: Quasi-uniform completeness in terms of Cauchy nets. Acta Mathematica Hungarica 69, 47–54 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Waszkiewicz, P.: Distance and measurement in domain theory. In: Brookes, S., Mislove, M. (eds.) 17th Conference on the Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science, vol. 45, Elsevier Science Publishers, Amsterdam (2001)

    Google Scholar 

  17. Waszkiewicz, P.: Quantitative continuous domains. Applied Categorical Structures 11, 41–67 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Waszkiewicz, P.: The local triangle axiom in topology and domain theory. Applied General Topology 4(1), 47–70 (2003a)

    MATH  MathSciNet  Google Scholar 

  19. Waszkiewicz, P.: Partial Metrizability of Continuous Posets, Submitted Available at: http://www.ii.uj.edu.pl/~pqw

  20. Willard, S.: General Topology. Addison-Wesley, Reading (1970)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jagiellonian University, ul. Nawojki 11, 30-072, Kraków, Poland

    Paweł Waszkiewicz

Authors
  1. Paweł Waszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Theoretische Informatik, Universität zu Lübeck, Germany

    Maciej Liśkiewicz

  2. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23538, Lübeck, Germany

    Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Waszkiewicz, P. (2005). Completeness and Compactness of Quantitative Domains. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_30

Download citation

  • DOI: https://doi.org/10.1007/11537311_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28193-1

  • Online ISBN: 978-3-540-31873-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation