Skip to main content

Powerset trilattices

  • Conference paper
  • First Online:
Conceptual Structures: Theory, Tools and Applications (ICCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1453))

Included in the following conference series:

Abstract

The Boolean lattices are fundamental algebraic structures in Lattice Theory and Mathematical Logic. Since the triadic approach to Formal Concept Analysis gave rise to the triadic generalization of lattices, the trilattices, it is natural to ask for the triadic analogue of Boolean lattices, the Boolean trilattices. The first step in establishing Boolean trilattices is the study of powerset trilattices, which are the the triadic generalization of powerset lattices. In this paper, an order-theoretic characterization of the powerset trilattices as certain B-trilattices is presented. In particular, the finite B-trilattices are (up to isomorphism) just the finite powerset trilattices. They have 3n elements. Further topics are the triadic de Morgan laws, the cycles of triadic complements as the triadic complementation and the atomic cycles, which take over the role of the atoms in the theory of Boolean lattices.

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. K. Biedermann: How Triadic Diagrams Represent Conceptual Structures. In: D. Lukose, H. Delugach, M. Keeler, L. Searle, J. Sowa (eds.), Conceptual Structures: Fulfilling Peirce's Dream, Lecture Notes in Artificial Intelligence 1257. Springer-Verlag, Berlin-Heidelberg-New York 1997, 304–317.

    Google Scholar 

  2. K. Biedermann: An Equational Theory for Trilattices. FB4-Preprint, TU Darmstadt 1998.

    Google Scholar 

  3. B.A. Davey, H.A. Priestley: Introduction to Lattices and Order. Cambridge University Press, Cambridge 1990.

    Google Scholar 

  4. G. Grätzer: Universal Algebra. Springer-Verlag, Berlin-Heidelberg-New York, 1979.

    Google Scholar 

  5. B. Ganter, R. Wille: Formale Begriffsanalyse: Mathematische Grundlagen. Springer, Berlin-Heidelberg 1996.

    Google Scholar 

  6. F. Lehmann, R. Wille: A Triadic Approach to Formal Concept Analysis. In: G. Ellis, R. Levinson, W. Rich and J.G. Sowa (ed.). Conceptual Structures: Applications, Implementations and Theory. Lecture Notes in Artificial Intelligence 954. Springer-Verlag, Berlin-Heidelberg-New York 1995, 32–43.

    Google Scholar 

  7. J. D. Monk, R. Bonnet (eds.): Handbook of Boolean Algebras. Elsevier Science Publishers B.V., Amsterdam-New York 1989.

    Google Scholar 

  8. R. Wille: The Basic Theorem of Triadic Concept Analysis. Order 12 (1995), 149–158.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Wille: Conceptual Graphs and Formal Concept Analysis. In: D. Lukose, H. Delugach, M. Keeler, L. Searle (eds.): Conceptual Structures: Fulfilling Peirce's Dream. Springer, Berlin-Heidelberg-New York 1997, 290–303.

    Google Scholar 

  10. R. Wille, M. Zickwolff: Grundlegung einer Triadischen Begriffsanalyse. In: G. Stumme, R. Wille: Wissensverarbeitung: Methoden und Anwendungen. Springer, Berlin-Heidelberg 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marie-Laure Mugnier Michel Chein

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biedermann, K. (1998). Powerset trilattices. In: Mugnier, ML., Chein, M. (eds) Conceptual Structures: Theory, Tools and Applications. ICCS 1998. Lecture Notes in Computer Science, vol 1453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054916

Download citation

  • DOI: https://doi.org/10.1007/BFb0054916

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics