Order, lattices, ordered algebraic structures Well-orders, well-founded orders, well-quasi-orders Concept
Partially well-ordered set
Summary
A partially well-ordered set is a partially ordered set whose order is a well-quasi-ordering. Such an order is also called a well-partial-order. It generalizes a well-order: the order need not be total, but it is well-founded and every antichain is finite. One also says that a subset of a preordered set is partially well-ordered when the restricted order has this property.
Further reading
About this page
| Tag | H0Q4BWB23T |
|---|---|
| URI | m2://H0Q4BWB23T |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06, 06A07 |
| Specializes | Well-quasi-ordering, Partial order |
| Changed | 2 November 2026 |
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.