Skip to main content

On residuated approximations

  • Part 3: Categorical Aspects From Topology
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Birkhoff, Lattice Theory, Vol. XXV, AMS Colloquium Publications 1967.

    Google Scholar 

  2. T.S. Blyth and M.F. Janowitz, Residuation Theory, Pergamon Press, Oxford, 1972.

    Google Scholar 

  3. G.D. Crown, “Projectives and injectives in the category of complete lattices with residuated mappings”, Math. Ann. 187, (1970) 295–299.

    Google Scholar 

  4. G. Gierz, K.H. Hofmann, K. Keimal, J.D. Lawson, M. Mislove, and D.S. Scott, A Compendium of Continuous Lattices, Springer-Verlag, Berlin 1980.

    Google Scholar 

  5. G. Herden, “Some aspects of clustering functions”, SIAM J. Alg. Disc. Math. 5, (1984) 101–116.

    Google Scholar 

  6. H. Herrlich and M. Hušek, “Galois Connections”, Mathematical Foundations of Programming Semantics, Manhattan, KS, 1985, Lecture Notes in Computer Science 239, Springer-Verlag, Berlin 1986.

    Google Scholar 

  7. M.F. Janowitz, “An order-theoretic model for cluster analysis”, SIAM J. Appl. Math. 34, (1978) 55–72.

    Google Scholar 

  8. M.F. Janowitz, “An order-theoretic foundation for automatic classification”, preprint.

    Google Scholar 

  9. M.F. Janowitz, “An order-theoretic model for numerical taxonomy”, preprint.

    Google Scholar 

  10. M.F. Janowitz, “Working Report: Seminar on Distribution Function Clustering”, preprint.

    Google Scholar 

  11. A. Melton, D.A. Schmidt, G.E. Strecker “Galois Connections and Computer Science Applications”, Proceedings of the Summer Workshop on Category Theory and Computer Programming, Guildford, U.K., 1985, Lecture Notes in Computer Science 240, Springer-Verlag, Berlin, 1985.

    Google Scholar 

  12. G. Pickert, “Bemerkungen über Galois-Verbindungen”, Archiv Math. 3, (1952) 285–289.

    Google Scholar 

  13. D. Scott “Continuous Lattices”, Lecture Notes in athematics 274 pp. 97–136, Springer-Verlag, Berlin 1972.

    Google Scholar 

  14. B. Schweizer and A. SklarProbabalistic Metric Spaces, North Holland, Amsterdam, 1983.

    Google Scholar 

  15. P. Wegner “Programming language semantics”, Formal Semantics of Programming Languages, R. Rustin, ed., Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 149–248.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. Ehrig H. Herrlich H. -J. Kreowski G. Preuß

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andréka, H., Greechie, R.J., Strecker, G.E. (1989). On residuated approximations. In: Ehrig, H., Herrlich, H., Kreowski, H.J., Preuß, G. (eds) Categorical Methods in Computer Science With Aspects from Topology. Lecture Notes in Computer Science, vol 393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51722-7_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-51722-7_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46787-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics