COMPLETE LATTICE
\kəmplˈiːt lˈatɪs], \kəmplˈiːt lˈatɪs], \k_ə_m_p_l_ˈiː_t l_ˈa_t_ɪ_s]\
Sort: Oldest first
-
A lattice is a partial ordering of a set under a relationwhere all finite subsets have a least upper bound and agreatest lower bound. A complete lattice also has these forinfinite subsets. Every finite lattice is complete. Someauthors drop the requirement for greatest lower bounds.
By Denis Howe
