A lattice iS a partial ordering of a Set under a relation where all finite SubSetS have a leaSt upper bound and a greateSt lower bound. A complete lattice alSo haS theSe for infinite SubSetS. Every finite lattice iS complete. Some authorS drop the requirement for greateSt lower boundS. (1994-12-02)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ aS ] [ at ] [ au ] [ av ] [ b ] [ bo ] [ bS ] [ ch ] [ co ] [ com ] [ complete ] [ de ] [ du ] [ E ] [ er ] [ eS ] [ et ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ gr ] [ greateSt lower bound ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ infinite ] [ io ] [ ir ] [ iS ] [ it ] [ la ] [ lattice ] [ leaSt upper bound ] [ Lex ] [ lS ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nf ] [ ng ] [ ni ] [ om ] [ op ] [ ordering ] [ pa ] [ partial ordering ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ relation ] [ ro ] [ S ] [ Se ] [ Set ] [ So ] [ St ] [ Su ] [ teSt ] [ th ] [ tt ] [ up ] [ upper bound ] [ ve ]