About: Chain-complete partial order

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
  • 순서론에서 닫힌 원순서 집합(-原順序集合, 영어: closed preordered set)이란 모든 사슬이 상계를 갖는 원순서 집합이다. (ko)
dbo:wikiPageID
  • 1012798 (xsd:integer)
dbo:wikiPageLength
  • 3261 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1118379047 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • 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. (en)
  • 순서론에서 닫힌 원순서 집합(-原順序集合, 영어: closed preordered set)이란 모든 사슬이 상계를 갖는 원순서 집합이다. (ko)
rdfs:label
  • Chain-complete partial order (en)
  • 닫힌 원순서 집합 (ko)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License