Order, lattices, ordered algebraic structures Complete lattices and completions Concept
Completeness in order theory
Summary
In order theory, a completeness property of a partially ordered set says that every subset of a certain kind has a supremum, or an infimum. All subsets give complete lattices, and nonempty bounded subsets give conditionally complete lattices. Directed subsets give directed-complete partial orders. These notions organize much of lattice theory and domain theory.
Further reading
About this page
| Tag | Q72NHN7ATC |
|---|---|
| URI | m2://Q72NHN7ATC |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06B23, 06A06 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.