Boolean Substructures in Formal Concept Analysis
Abstract: It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only if the context contains an n-dimensional contra-nominal scale as subcontext. In this work, we investigate more closely the interplay between the Boolean subcontexts of a given finite context and the Boolean suborders of its concept lattice. To this end, we define mappings from the set of subcontexts of a context to the set of suborders of its concept lattice and vice versa and study their structural properties. In addition, we introduce closed-subcontexts as an extension of closed relations to investigate the set of all sublattices of a given lattice.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.