Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept
Bounded poset
Summary
A bounded poset is a partially ordered set that has both a greatest element and a least element. These are called top and bottom and written and , or and . Bounded posets are the setting for complements in lattices.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | B0QT3SM5DT |
|---|---|
| URI | m2://B0QT3SM5DT |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06 |
| Specializes | Partial order |
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.