Subdirect decomposition of concept lattices
This paper is a continuation of a previous paper of the author where the basic theorem for concept lattices has been given [Ordered sets, Proc. NATO Adv. Study Inst., Banff/Can. 1981, 445-470 (1982; Zbl 0491.06008)]. A concept lattice can be regarded as a complete meet-sublattice of the power set lattice of objects determined by the Galois connection given by the attributes in the obvious way. The purpose of the paper is for some special kind of context to determine the scaffolding the concept lattice which is a partial join-semilattice. From this result one can determine the concept lattice using an earlier result of the author.
- Subdirect decomposition of concept lattices
- scientific article; zbMATH DE number 4041976
- Subdirect product construction of concept lattices
- Contexts and sublattices of concept lattices
- Concept Lattices of Subcontexts of a Context
- scientific article; zbMATH DE number 6257032
- Tensorial decomposition of concept lattices
- Formal Concept Analysis
- Logical analysis of concept lattices by factorization
- Concept lattices and their applications
- A topological representation theory for lattices
- scientific article; zbMATH DE number 4043914 (Why is no real title available?)
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 3777562 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Subdirect unions in universal algebra
- Subdirekte Produkte und konjunkte Summen.
- Subdirekte Produkte vollständiger Verbände.
- Tensorial decomposition of concept lattices
- A note on the number of irreducibles of subdirect products
- Subdirect product construction of concept lattices
- On finite lattices generated by their doubly irreducible elements
- The Kurosh-Ore exchange property
- A topological representation of lattices
- Concept lattices and conceptual knowledge systems
- Generalizing semidistributivity
- Distributive laws for concept lattices
- On context patterns associated with concept lattices
- On Tamari lattices
- The generalized doubling construction and formal concept analysis
- On a dependence relation in finite lattices
- On permutation lattices
- Complete congruence lattices of two related modular lattices
- Using congruence relations to extract knowledge from concept lattices
- Cayley lattices of finite Coxeter groups are bounded
- Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
- Complete atomistic lattices are classification lattices
- Compatible attribute subcontexts of one-sided vague formal concept lattices
- Textural dependency and concept lattices
- Classification lattices are geometric for complete atomistic lattices
- Concept Lattice Orbifolds – First Steps
- scientific article; zbMATH DE number 3896990 (Why is no real title available?)
- scientific article; zbMATH DE number 4041976 (Why is no real title available?)
- Classification systems and their lattice
- Contexts and sublattices of concept lattices
- Graph Automorphisms and Cells of Lattices
- Subdirect decomposition of concept lattices
- Algorithms for k-meet-semidistributive lattices
- scientific article; zbMATH DE number 6257032 (Why is no real title available?)
- Removing critical pairs
- Mathematical aspects of concept analysis
- An elementary theory of product-line variations
- Counting formulas for glued lattices
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
This page was built for publication: Subdirect decomposition of concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793764)
