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)

N="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 ]