Irreflexive transitive relation
Also known as irreflexive order · strict partial order · irreflexive partial order
7 statements · 0% with external sources · numbers in brackets are citations
3 identifiers linking strict order across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable.