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:
“Although those notes, in conformity with custom, come after the poem, the reader is advised to consult them first and then study the poem with their help, rereading them of course as he goes through its text, and perhaps after having done with the poem consulting them a third time so as to complete the picture.”
—Vladimir Nabokov (1899–1977)