1 Answers
In mathematics, specifically order theory, a partially ordered set is chain-complete if every chain in it has a least upper bound. It is ω-complete when every increasing sequence of elements has a least upper bound; the same notion can be extended to other cardinalities of chains.
4 views
Answered