References

  1. J. Adámek, H. Herrlich & G. E. Strecker (2009): Abstract and Concrete Categories, second edition. Dover Publications, New York.
  2. G. Birkhoff (1940): Lattice Theory, first edition 25. American Mathematical Society Colloquium Publications.
  3. G. Birkhoff (1967): Lattice Theory, third edition 25. American Mathematical Society Colloquium Publications.
  4. T. S. Blyth (1970): Sur certaines images homomorphes des demi-groupes ordonnés,. Bull. Soc. Math. France 94, pp. 101–111.
  5. J. T. Denniston, A. Melton & S. E. Rodabaugh: Lattice-valued predicate transformers, Chu games, and lattice-valued transformer systems. Under revision.
  6. J. T. Denniston, A. Melton & S. E. Rodabaugh (2013): Formal concept analysis and lattice-valued Chu systems. Fuzzy Sets and Systems 216, pp. 52–90, doi:10.1016/j.fss.2012.09.002.
  7. M. Erné, J. Koslowski, A. Melton & G. E. Strecker (1993): A primer on Galois connections. In: Proceedings of the 1991 Summer Conference on General Topology and Applications in Honor of Mary Ellen Rudin and Her Work 704. Annals of the New York Academy of Sciences, pp. 103–125, doi:10.1111/j.1749-6632.1993.tb52513.x.
  8. B. Ganter, G. Stumme & R. Wille (2005): Formal Concept Analysis: Foundations and Applications. Lecture Notes in Artificial Intelligence 3626. Springer Verlag, Berlin, Heidelberg, New York, doi:10.1007/b105806.
  9. B. Ganter & R. Wille (1996): Formale Begriffsanalyse: Mathematishce Grundlagen. Springer Verlag, Berlin, Heidelberg, New York, doi:10.1007/978-3-642-61450-7. English edition was published in 1999..
  10. P. T. Johnstone (1982): Stone Spaces. Cambridge University Press, Cambridge.
  11. J. M. McDill, A. C. Melton & G. E. Strecker (1987): A category of Galois connections. Lecture Notes in Computer Science 283. Springer Verlag, Berlin, Heidelberg, New York, pp. 290–300. Available at http://dx.doi.org/10.1007/3-540-18508-9_32.
  12. A. Melton, D. A. Schmidt & G. E. Strecker (1986): Galois connections and computer science applications. Lecture Notes in Computer Science 240. Springer Verlag, Berlin, Heidelberg, New York, pp. 299–312. Available at http://dx.doi.org/10.1007/3-540-17162-2_130.
  13. O. Ore (1944): Galois connexions. Trans. Amer. Math. Soc. 55, pp. 493–513, doi:10.1090/S0002-9947-1944-0010555-7.
  14. J. Schmidt (1953): Beitraege zur filtertheorie II. Math. Nachr. 10, pp. 197–232, doi:10.1002/mana.19530100309.
  15. G. Stumme (2002): Efficient data mining based on formal concept analysis. In: A. Hameurlain, R. Cicchetti & R. Traunmueller: Database and Expert Systems Applications, Lecture Notes in Computer Science 2453. Springer Verlag, Berlin, Heidelberg, New York, pp. 534–546. Available at http://dx.doi.org/10.1007/3-540-46146-9_53.
  16. S. J. Vickers (1989): Topology Via Logic. Cambridge University Press, Cambridge.
  17. B. Vormbrock & R. Wille (2005): Semiconcept and protoconcept algebras: the basic theorems, chapter 2, pp. 34–48. Springer Verlag, Berlin, Heidelberg. Available at http://dx.doi.org/10.1007/11528784_2.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org