Negations and contrapositions of complete lattices
Discrete Mathematics
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
Formal concept analysis in information science
Annual Review of Information Science and Technology
Generating positive and negative exact rules using formal concept analysis: problems and solutions
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Semiconcept and protoconcept algebras: the basic theorems
Formal Concept Analysis
Treating incomplete knowledge in formal concept analysis
Formal Concept Analysis
The basic theorem on preconcept lattices
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Negation, opposition, and possibility in logical concept analysis
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Hi-index | 0.00 |
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on concepts. They have been introduced to capture the equational theory of concept algebras (Wille 2000; Kwuida 2004). They generalize Boolean algebras. Concept algebras are concept lattices, thus complete lattices, with a weak negation and a weak opposition. A special case of the representation problem for weakly dicomplemented lattices, posed in Kwuida (2004), is whether complete weakly dicomplemented lattices are isomorphic to concept algebras. In this contribution we give a negative answer to this question (Theorem 4). We also provide a new proof of a well known result due to M.H. Stone (Trans Am Math Soc 40:37---111, 1936), saying that each Boolean algebra is a field of sets (Corollary 4). Before these, we prove that the boundedness condition on the initial definition of weakly dicomplemented lattices (Definition 1) is superfluous (Theorem 1, see also Kwuida (2009)).