Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Chain_complete> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Chain_complete abstract "In order-theoretic mathematics, a partially ordered set in 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.".
- Chain_complete wikiPageID "1012798".
- Chain_complete wikiPageRevisionID "606173278".
- Chain_complete hasPhotoCollection Chain_complete.
- Chain_complete subject Category:Order_theory.
- Chain_complete comment "In order-theoretic mathematics, a partially ordered set in 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.".
- Chain_complete label "Chain complete".
- Chain_complete sameAs m.03z4sm.
- Chain_complete sameAs Q5067920.
- Chain_complete sameAs Q5067920.
- Chain_complete wasDerivedFrom Chain_complete?oldid=606173278.
- Chain_complete isPrimaryTopicOf Chain_complete.