Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept
Strict partial order
Summary
A strict partial order is a binary relation that is irreflexive and transitive. It is the "strictly less than" version of a partial order. Strict partial orders on a set correspond one to one with partial orders on the same set. So either one can serve as the basic notion.
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Partially_ordered_set, Strict partial orders
About this page
| Tag | 60FNZ35H6R |
|---|---|
| URI | m2://60FNZ35H6R |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06 |
| 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)
The writing levels say how complete the text of a page is. They do not measure its truth.