Chain-complete partial order
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 (a type of countable chain) has a least upper bound; the same notion can be extended to other cardinalities of chains.
Wikipage redirect
primaryTopic
Chain-complete partial order
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 (a type of countable chain) has a least upper bound; the same notion can be extended to other cardinalities of chains.
has abstract
In mathematics, specifically o ...... other cardinalities of chains.
@en
순서론에서, 닫힌 원순서 집합(-原順序集合, 영어: closed preordered set)이란 모든 사슬이 상계를 갖는 원순서 집합이다.
@ko
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,004,422,557
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In mathematics, specifically o ...... other cardinalities of chains.
@en
순서론에서, 닫힌 원순서 집합(-原順序集合, 영어: closed preordered set)이란 모든 사슬이 상계를 갖는 원순서 집합이다.
@ko
label
Chain-complete partial order
@en
닫힌 원순서 집합
@ko