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)

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 ]