Abstract
Concept algebras are concept lattices enriched by a weak negation and a weak opposition. The introduction of these two operations was motivated by the search of a negation on formal concepts. These weak operations form a weak dicomplementation. A weakly dicomplemented lattice is a bounded lattice equipped with a weak dicomplementation. (Weakly) dicomplemented lattices abstract (at least for finite distributive lattices) concept algebras. Distributive double p-algebras and Boolean algebras are some special subclasses of the class of weakly dicomplemented lattices. We investigate in the present work the connection between weak dicomplementations and complementation notions like semicomplementation, pseudocomplementation, complementation or orthocomplementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balbes, R., Dwinger, P.: Distributive lattices. University of Missouri Press (1974)
Boole, G.: An investigation of the laws of thought on which are founded the mathematical theories of logic and probabilities. Macmillan, Basingstoke (1854); Reprinted by Dover Publ., New york (1958)
Ganter, B., Kwuida, L.: Representing weak dicomplementations on finite distributive lattices. Preprint MATH-AL-10-2002
Grätzer, G.: Distributive Lattices. Springer, Heidelberg (1970)
Gramaglia, H., Vaggione, D.: A note on distributive double p-algebras. Czech. Math. J. 48(2), 321–327 (1998)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)
Katriňák, T.: The structure of distributive double p-algebras. Regularity and congruences. Algebra Universalis 3(2), 238–246 (1973)
Wille, R.: Boolean Concept Logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwuida, L. (2004). When Is a Concept Algebra Boolean?. In: Eklund, P. (eds) Concept Lattices. ICFCA 2004. Lecture Notes in Computer Science(), vol 2961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24651-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24651-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21043-6
Online ISBN: 978-3-540-24651-0
eBook Packages: Springer Book Archive