Editing Lattice (order) (section)

== See also ==
* {{annotated link|Join and meet}}
* {{annotated link|Map of lattices}}
* {{annotated link|Orthocomplemented lattice}}
* {{annotated link|Total order}}
* {{annotated link|Ideal (order theory)|Ideal}} and [[Filter (mathematics)|filter]] (dual notions)
* {{annotated link|Skew lattice}} (generalization to non-commutative join and meet)
* {{annotated link|Eulerian lattice}}
* {{annotated link|Post's lattice}}
* {{annotated link|Tamari lattice}}
* {{annotated link|Young–Fibonacci lattice}}
* {{annotated link|0,1-simple lattice}}

=== Applications that use lattice theory ===
{{prose|date=March 2017}}
''Note that in many applications the sets are only partial lattices: not every pair of elements has a meet or join.''
* [[Pointless topology]]
* [[Lattice of subgroups]]
* [[Spectral space]]
* [[Invariant subspace]]
* [[Closure operator]]
* [[Abstract interpretation]]
* [[Subsumption lattice]]
* [[Fuzzy set]] theory
* [[First-order logic#Algebraizations|Algebraizations of first-order logic]]
* [[Semantics of programming languages]]
* [[Domain theory]]
* [[Ontology (computer science)]]
* [[Multiple inheritance]]
* [[Formal concept analysis]] and [[Lattice Miner]] (theory and tool)
* [[Bloom filter#Compact approximators|Bloom filter]]
* [[Information flow]]
* [[Ordinal optimization]]
* [[Quantum logic]]
* [[Median graph]]
* [[Knowledge space]]
* [[Induction of regular languages#Lattice of automata|Regular language learning]]
* [[Analogical modeling]]