KnowraPartial orderLinked fromLinked fromThe 28 pages that link to Partial order, each with the reason it gives.All 28Broader topic 5Related 9Narrower topic 7Compared with 7Topological sortingNarrower topic: A DAG’s reachability relation defines precedence constraints that a topological order extends.Least elementNarrower topic: Leastness is defined relative to the relation ordering the set.Hasse diagramNarrower topic: The underlying relation determines which elements are comparable in the diagram.Upper boundNarrower topic: Upper bounds are defined relative to an order, which need not compare every pair of elements.Kleene fixed-point theoremNarrower topic: The theorem compares approximations using an order rather than numerical distance.Infimum and supremumNarrower topic: Infima and suprema are defined relative to an order, which need not compare every pair.Kruskal's tree theoremNarrower topic: Well-quasi-orders generalize partial orders by permitting distinct elements to be equivalent.