complete lattice

views updated

complete lattice A set D on which there is a partial ordering and in which every subset of D has both a least upper bound and a greatest lower bound in D. By contrast, the weaker notion of lattice requires only that finite subsets have least upper bounds and greatest lower bounds.