Order, lattices, ordered algebraic structures Definition
Omega-complete partial order
Builds on Partial orderSupremumDirected-complete partial order
Definition
Let be a partially ordered set. An -chain in is a sequence with . The poset is an omega-complete partial order, or -cpo, if every -chain in has a supremum in .
Remarks
Some authors also require a least element. Every directed-complete partial order is an -cpo, since the set of terms of an -chain is directed. Example: with for all ; an -chain is either eventually constant, with supremum its final value, or unbounded in , with supremum . Non-example: itself, since the chain has no supremum. The converse fails for the set of countable ordinals with their usual order. It is an -cpo, because a countable set of countable ordinals has a countable supremum. But the directed set itself has no supremum in .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Directed-complete partial order concept
- Partial order concept
- Supremum concept
- Omega-complete partial order definition
Further reading
About this page
| Tag | KR1F39C0SP |
|---|---|
| URI | m2://KR1F39C0SP |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B35, 06A06, 68Q55 |
| Defines | Omega-complete partial order |
| Uses | Partial order, Supremum, Directed-complete 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.
What links here
No page links to this page yet.