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:
“Much that is urged on us new parents is useless, because we didn’t really choose it. It was pushed on us. It—whether it be Raffi videos, French lessons, or the complete works of Brazelton—might be just right for you and your particular child. But it is only right when you feel that it is. You know your family best; you decide.”
—Sonia Taitz (20th century)