... >> Mathematics >> Set Theory >> Strict Partial Order
Highest Rated Sign
Nobody has posted a sign yet.
Strict Partial Order

Definition: Given a set A, a relation < on A is called a strict partial order on A if it has the following two properties: 1) (Nonreflexivity) The relation a < a never holds. 2) (Transitivity) If a < b and b < c, then a < c.
Source: Topology (second edition) by James R. Munkres
 There are no comments for this topic.