<theory> A partially ordered set in which all finite subsets have a least upper bound and greatest lower bound.
This definition has been standard at least since the 1930s and probably since Dedekind worked on lattice theory in the 19th century; though he may not have used that name.
See also complete lattice, domain theory.
Last updated: 1999-12-09
Try this search on Wikipedia, OneLook, Google
Nearby terms: latency « LaTeX « Latin 1 « lattice » LAU » laundromat » LAURE