A complete lattice is a specific type of lattice in order theory, a branch of mathematics that deals with the arrangement, comparison, and organization of elements. In a complete lattice, every subset of the lattice has both a least upper bound (supremum) and a greatest lower bound (infimum).

Ancestors (5)

  1. Lattice theory
  2. Fields of abstract algebra
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version