In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.
Complete lattices must not be confused with complete partial orders (cpos), which constitute a strictly more general class of partially ordered sets. More specific complete lattices are complete Boolean algebras and complete Heyting algebras (locales).
Read more about Complete Lattice: Formal Definition, Examples, Morphisms of Complete Lattices, Representation, Further Results
Famous quotes containing the word complete:
“Silence is to all creatures thus attacked the only means of salvation; it fatigues the Cossack charges of the envious, the enemy’s savage ruses; it results in a cruising and complete victory.”
—Honoré De Balzac (1799–1850)