Complete Lattices

Central mathematical structure explored throughout the paper; ordered sets with special properties for all suprema and infima.

Neighborhood — ranked by edge-count

concept

Hilary A. Priestley
studies
Author of the primer on ordered sets and complete lattices for computer science.
Closure Operators
associated_with
Operators X → X'' on subsets of objects or attributes, satisfying extensivity, monotonicity and idempotence.
Powerset with Inclusion Order
cites
Family of all subsets of a set X, ordered by set inclusion; serves as a canonical example of a complete lattice.

framework

Galois Connections
associated_with
Key order-theoretic structure relating polar maps between posets; appears in concept lattice theory.

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Complete Latticeconcept0.943
process latticeconcept0.781
Hierarchical structure of concurrent expert processes envisioned for real-time monitoring applications.
Lattice as Algebraic Structureconcept0.755
Poset with join and meet operations satisfying associativity, commutativity, idempotency, and absorption laws.
semi-lattice diagramconcept0.755
Alexander’s diagram where child nodes can belong to multiple parents, representing overlapping sets and complex urban structure, in contrast to tree.
Concept Latticeconcept0.754
Central algebraic structure in FCA that orders formal concepts and preserves information from formal contexts.
Complete Compositionalityframework0.742
Strongest form of compositional theory requiring full decomposability and meaningful parts.
Is there a concept lattice?question0.740
Question posed for the driving test many-valued context.
Iceberg Latticeconcept0.731
Induced substructure of concept lattice containing only concepts with frequent intent above a minimum support threshold.