Linked set
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.
≈ 2 min read
Linked set. encyclopegia.org, snapshot enwiki-001172828926. /a/linked-set
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
References
edit edit source- Fremlin, David H. (1984). Consequences of Martin's axiom. Cambridge tracts in mathematics, no. 84. Cambridge: Cambridge University Press. ISBN 0-521-25091-9.
- Antisymmetric
- Asymmetric
- Boolean algebra
- Completeness
- Connected
- Covering
- Dense
- Directed
- (Partial) Equivalence
- Foundational
- Heyting algebra
- Homogeneous
- Idempotent
- Lattice
- Partially ordered set
- Prefix order
- Preorder
- Reflexive
- Semilattice
- Semiorder
- Symmetric
- Tolerance
- Total
- Transitive
- Well-founded
- Well-quasi-ordering (Better)
- (Pre) Well-order
Text derived from https://en.wikipedia.org/w/index.php?oldid=1172828926 under CC BY-SA 4.0; modifications have been made.