Linked from

The 28 pages that link to Partially ordered set, each with the reason it gives.

• SubsetNarrower topic: The subsets of any set form a partially ordered set under inclusion.

• SupremumNarrower topic: A supremum is defined relative to an order, which need not compare every pair of elements.

• Lattice (order theory)Narrower topic: A lattice is a partially ordered set with joins and meets for every pair.

• Monotonic functionNarrower topic: Monotonicity generalizes from ordered numbers to functions between partially ordered sets.

• Zorn's lemmaNarrower topic: Zorn's lemma begins with this structure and asks whether it contains a maximal element.

• InfimumNarrower topic: Infima are defined through order, including orders that are not total.

• Least elementNarrower topic: The least element is defined within this structure.

• Hasse diagramNarrower topic: A Hasse diagram is a compact drawing of a finite partially ordered set.

• Monotone functionNarrower topic: Monotonicity is defined by comparing inputs and outputs in such ordered sets.

• AntichainNarrower topic: Antichains are defined as subsets of a partially ordered set.

• Chain (order theory)Narrower topic: A chain is a subset of this structure, inheriting its order.

• Heyting algebraNarrower topic: The lattice order supplies the comparison used to define Heyting implication.

• Maximal elementNarrower topic: Maximality is defined relative to the order relation on this set.

• Minimal elementNarrower topic: Minimality is defined relative to the partial order on this set.

• Martin's axiomNarrower topic: Conditions in the axiom's forcing formulation are ordered by extension.

• Dilworth's theoremNarrower topic: Dilworth’s theorem applies to finite sets with this structure.

• Sperner's theoremNarrower topic: Sperner's theorem is an extremal result about a particular partially ordered set.

• Absorption lawNarrower topic: Lattices and their meet and join operations are defined from partial orders.

• Krull's theoremNarrower topic: Ideal inclusion gives the ordering to which the maximal-element argument applies.

• 1/3–2/3 conjectureNarrower topic: The conjecture concerns incomparable pairs in finite partially ordered sets.

• Greatest element and least elementNarrower topic: Greatest and least elements are defined relative to this broader kind of ordered structure.

• Join and meetNarrower topic: Joins and meets are defined relative to this order relation.

• Rasiowa–Sikorski lemmaNarrower topic: The lemma’s conditions and conclusion are expressed using an order on a countable set.

• Teichmüller–Tukey lemmaNarrower topic: The lemma seeks a maximal family under the partial order of inclusion.