When Is a Concept Algebra Boolean?
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.
Unable to display preview. Download preview PDF.
- 1.Balbes, R., Dwinger, P.: Distributive lattices. University of Missouri Press (1974)Google Scholar
- 2.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)Google Scholar
- 3.Ganter, B., Kwuida, L.: Representing weak dicomplementations on finite distributive lattices. Preprint MATH-AL-10-2002Google Scholar
- 4.Grätzer, G.: Distributive Lattices. Springer, Heidelberg (1970)Google Scholar