Page "Preorder" Paragraph 5
from
Wikipedia
Consider some set P and a binary relation ≤ on P. Then ≤ is a preorder, or quasiorder, if it is reflexive and transitive, i. e., for all a, b and c in P, we have that:
Page 1 of 1.
2.300 seconds.