Linked set
Mathematical concept regarding posets in (partial) order theory
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
- Fremlin, David H. (1984). Consequences of Martin's axiom. Cambridge tracts in mathematics, no. 84. Cambridge: Cambridge University Press. ISBN 0-521-25091-9.
- v
- t
- e
Order theory
- Binary relation
- Boolean algebra
- Cyclic order
- Lattice
- Partial order
- Preorder
- Total order
- Weak ordering
- Antisymmetric
- Asymmetric
- Boolean algebra
- Completeness
- Connected
- Covering
- Dense
- Directed
- (Partial) Equivalence
- Foundational
- Heyting algebra
- Homogeneous
- Idempotent
- Lattice
- Reflexive
- Partial order
- Prefix order
- Preorder
- Semilattice
- Semiorder
- Symmetric
- Total
- Tolerance
- Transitive
- Well-founded
- Well-quasi-ordering (Better)
- (Pre) Well-order
- Alexandrov topology & Specialization preorder
- Ordered topological vector space
- Normal cone
- Order topology
- Order topology
- Topological vector lattice
- Antichain
- Cofinal
- Cofinality
- Comparability
- Duality
- Filter
- Hasse diagram
- Ideal
- Net
- Subnet
- Order morphism
- Order type
- Ordered field
- Ordered vector space
- Partially ordered group
- Upper set
- Young's lattice
 | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
