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:
“What I expect from my male friends is that they are polite and clean. What I expect from my female friends is unconditional love, the ability to finish my sentences for me when I am sobbing, a complete and total willingness to pour their hearts out to me, and the ability to tell me why the meat thermometer isn’t supposed to touch the bone.”
—Anna Quindlen (20th century)