Encyclopedia.com > Dictionaries, Thesauruses, Pictures, and Press Releases > A Dictionary of Computing > January 2004

complete lattice

A Dictionary of Computing | 2004 | 281 words | Copyright

complete lattice A set D on which there is a partial ordering and in which every subset of D has both a least upper bound and a greatest lower bound in D. By contrast, the weaker notion of lattice requires only that finite subsets have least upper bounds and greatest lower bounds.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "complete lattice." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "complete lattice." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-completelattice.html

JOHN DAINTITH. "complete lattice." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-completelattice.html

Learn more about citation styles

Find thousands of answers for hundreds of subjects at Answers Encyclopedia .

All answers verified by trusted sources at Encyclopedia.com

Try Answers Encyclopedia now!

For students and teachers!

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including:

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including: