A complete lattice is a specific type of lattice in order theory, a branch of mathematics that deals with the arrangement, comparison, and organization of elements. In a complete lattice, every subset of the lattice has both a least upper bound (supremum) and a greatest lower bound (infimum).
Articles by others on the same topic
A complete lattice is a partially ordered set in which every subset has a meet and a join, including the empty subset.