Linked set (original) (raw)
In mathematics, an upwards linked set A is a subset of a partially ordered set, P, in which any two of elements A have a common upper bound in P. Similarly, every pair of elements of a downwards linked set has a lower bound. Every centered set is linked, which includes, in particular, every directed set.
| Property | Value |
|---|---|
| dbo:abstract | In mathematics, an upwards linked set A is a subset of a partially ordered set, P, in which any two of elements A have a common upper bound in P. Similarly, every pair of elements of a downwards linked set has a lower bound. Every centered set is linked, which includes, in particular, every directed set. (en) |
| dbo:wikiPageID | 32926234 (xsd:integer) |
| dbo:wikiPageLength | 654 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 793985778 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Cambridge_University_Press dbr:Upper_bound dbc:Order_theory dbr:Mathematics dbr:Partially_ordered_set dbr:Centered_set dbr:Directed_set dbr:Subset |
| dbp:wikiPageUsesTemplate | dbt:Cite_book dbt:Mathlogic-stub |
| dcterms:subject | dbc:Order_theory |
| gold:hypernym | dbr:Subset |
| rdf:type | dbo:ProgrammingLanguage |
| rdfs:comment | In mathematics, an upwards linked set A is a subset of a partially ordered set, P, in which any two of elements A have a common upper bound in P. Similarly, every pair of elements of a downwards linked set has a lower bound. Every centered set is linked, which includes, in particular, every directed set. (en) |
| rdfs:label | Linked set (en) |
| owl:sameAs | freebase:Linked set wikidata:Linked set https://global.dbpedia.org/id/4qSB4 |
| prov:wasDerivedFrom | wikipedia-en:Linked_set?oldid=793985778&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Linked_set |
| is dbo:wikiPageWikiLink of | dbr:List_of_order_theory_topics dbr:Centered_set dbr:Knaster's_condition |
| is foaf:primaryTopic of | wikipedia-en:Linked_set |