Definition:Strict Ordering/Asymmetric and Transitive

Definition
Let $\mathcal R$ be a relation on a set $S$.

Then $\mathcal R$ is a strict ordering (on $S$) iff the following two conditions hold:

Also see

 * Equivalence of Definitions of Strict Ordering