Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept
Weak ordering
Summary
A weak ordering ranks the elements of a set where ties are allowed. In its strict form it is a strict partial order in which incomparability is transitive. Then the elements fall into classes of tied elements, and these classes are totally ordered. Weak orderings model rankings with ties, such as the results of a race with shared places.
Further reading
About this page
| Tag | PW2NKAPXWA |
|---|---|
| URI | m2://PW2NKAPXWA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06, 06A05 |
| Specializes | Strict partial order |
| Same as | |
| 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.