Skip to main content

Abstract pre-orders

  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 789))

Included in the following conference series:

  • 175 Accesses

Abstract

We establish a theory of pre-orders generalized to include, among other structures, metric spaces, and strong enough to support the solution of recursive domain equations. We do this by considering pre-orders defined internally in sheaves over a complete Heyting algebra Ω. When Ω is two-valued, pre-orders internally are pre-orders externally, but when Ω is the non-negative reals with suitable Heyting algebra operations, the internal pre-orders turn into generalized ultra-metric spaces externally. In the internal logic we define the concepts of chain, convergence, completeness, compactness, etc. and it turns out that Scott's theorem about the limit/colimit coincidence of chains of complete pre-orders with mediating continuous retractions generalizes to work for any cHa Ω. The external versions of this theorem then become its well known metric variations, and corresponding theorems for as yet unexplored structures.

This article was produced while the author was on leave from Carnegie Mellon University at RISC-Linz.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J., Private communication, talk in Prague, April 15, 1993.

    Google Scholar 

  2. Ambler, S.J., First order linear logic in symmetric monoidal closed categories, D. Phil thesis, Edinburgh University, CST-87-92 and ECS-LFCS-92-194, 1992.

    Google Scholar 

  3. America, P., J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, Centrum voor Wiskunde en Informatica, Centre for Mathematics and Computer Science, Report CS-R8709, February 1987.

    Google Scholar 

  4. de Bakker, J.W., J.I. Zucker, Processes and the denotational semantics of concurrency, in Information and Control 54, 70–120, 1982.

    Google Scholar 

  5. de Bakker, J.W., J.I. Zucker, Denotational semantics of concurrency, in proceedings of the 14'th ACM Symposium: Theory of Computing, 1982.

    Google Scholar 

  6. Bishop, E., D. Bridges, Constructive Analysis, Grundlehren der mathematischen Wissenschaften, vol. 279, Springer-Verlag, 1985.

    Google Scholar 

  7. Casley, R., R.F. Crew, J. Meseguer, V. Pratt, Temporal structures, Revision of article in Mathematical Structures in Computer Science, 1(2):179–213, July 1991. Available by anonymous ftp from boole@cs.stanford.edu.

    Google Scholar 

  8. Edalat, A., M.B. Smyth, Compact metric information systems (extended abstract), Imperial College, 1992.

    Google Scholar 

  9. Eilenberg, S., G.M. Kelly, Closed categories, Proceedings of La Jolla Conference on Categorical Algebra, Springer Verlag 1966.

    Google Scholar 

  10. Fiore, M.P., private communication (draft thesis), 1993.

    Google Scholar 

  11. Fourman, M., Connections between category theory and logic, D.Phil Thesis, Linacre College, Oxford University, 1974.

    Google Scholar 

  12. Fourman, M., D.S. Scott, Sheaves and logic, in proceedings Durham 1977, Applications of Sheaves, Lecture Notes in Mathematics, vol. 753, eds.: Fourman, Mulvey, Scott. Springer Verlag, 1979.

    Google Scholar 

  13. Gierz, G., K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, A Compendium of Continuous Lattices, Springer-Verlag, 1980.

    Google Scholar 

  14. Lawvere, F.W., Metric spaces, generalized logic, and closed categories, Rend. Semi. Mat. Fis. Milano, vol. 43, pp. 135–166, 1974.

    Google Scholar 

  15. Plotkin, G., Domains, Department of Computer Science, University of Edinburgh, 1983.

    Google Scholar 

  16. Schikhof, W., Ultrametric Calculus: an introduction to p-adic analysis, Cambridge studies in advanced mathematics series; 4, Cambridge University Press, 1984.

    Google Scholar 

  17. Scott, D.S., Models for The Lambda Calculus, Manuscript, 1969, (unpublished).

    Google Scholar 

  18. Scott, D.S., Continuous lattices, in Lawvere: Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274, Springer-Verlag, Berlin 1972.

    Google Scholar 

  19. Smyth, M.B., Completeness of quasi-uniform spaces in terms of filters, To appear (slightly revised) in Journal of London Mathematical Society.

    Google Scholar 

  20. Smyth, M.B., Quasi-uniformities: reconciling domains with metric spaces, Proceedings of the 3'rd Workshop on the Mathematical Foundations of Programming Language Semantics, Tulane, April 1987, Lecture Notes in Computer Science, Vol. 298, Springer Verlag, 1988.

    Google Scholar 

  21. Smyth, M.B., Totally bounded spaces and compact ordered spaces as domains of computation, in Proceedings of the Oxford Symposium in Topology and its Applications, June 1989.

    Google Scholar 

  22. Smyth, M.B., Completeness of quasi-uniformities and syntopological spaces, Journal of London Mathematical Society, 1992, to appear.

    Google Scholar 

  23. Smyth, M.B., G.D. Plotkin, The category theoretic solution of recursive domain equations, SIAM Journal of Computing, Vol. 11, No. 4, Nov. 1992.

    Google Scholar 

  24. Troelstra, A.S., D. van Dalen, Constructivism in Mathematics — An Introduction, vol. I, II, Studies in Logic and the Foundations of Mathematics, vol. 121, North Holland 1988.

    Google Scholar 

  25. Walters, R.F.C., Sheaves and Cauchy-complete categories, Cahiers de Topologie et Geometrie Differentielle 22–3 (1981).

    Google Scholar 

  26. Walters, R.F.C., Sheaves on sites as Cauchy-complete categories, Journal of Pure and Applied Algebra 24 (1982) 95–102.

    Google Scholar 

  27. Wyler, O., Lecture Notes on Topoi and Quasitopoi, World Scientific 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Masami Hagiya John C. Mitchell

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, K.R. (1994). Abstract pre-orders. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_117

Download citation

  • DOI: https://doi.org/10.1007/3-540-57887-0_117

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48383-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics