# complete lattice

Also found in: Wikipedia.

## complete lattice

[kəm′plēt ′lad·əs] (mathematics)

A partially ordered set in which every subset has both a supremum and an infimum.

McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

## complete lattice

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.

This article is provided by FOLDOC - Free Online Dictionary of Computing (

**foldoc.org**)Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: