Linked from

The 15 pages that link to Lattice (order theory), each with the reason it gives.

• Boolean algebraNarrower topic: Meet and join in a Boolean algebra are precisely these two bounds.

• Partial orderBroader topic: Lattices impose additional completeness on pairwise bounds.

• Partially ordered setBroader topic: Lattices add well-defined joins and meets to partial order structure.

• LatticeCompared with: The shared name describes a different structure, defined by order rather than integer vector combinations.

• InfimumRelated: Its pairwise meets are infima guaranteed by the lattice structure.

• Abstract interpretationRelated: Lattice structure organizes abstract facts by precision and supports joins at control-flow merges.

• Upper boundNarrower topic: Joins generalize least upper bounds from subsets to pairs.

• Algebraic structureBroader topic: Lattices illustrate structures defined through order-related operations rather than familiar arithmetic.

• Fundamental theorem of Galois theoryRelated: The theorem’s inclusion-reversing bijection relates the field and subgroup lattices.

• Order theoryBroader topic: Lattices add two fundamental operations to partial order.

• Absorption lawNarrower topic: Its meet and join operations satisfy the absorption identities.

• De Morgan's lawsNarrower topic: The laws describe how complementation interacts with a lattice's meet and join.

• Greatest element and least elementNarrower topic: Lattices provide pairwise join and meet operations that generalize greatest and least elements.

• Infimum and supremumNarrower topic: Pairwise infima and suprema are called meets and joins in lattice theory.

• Join and meetNarrower topic: A lattice is precisely an order where pairwise joins and meets always exist.