The prototype for ordering relations is ≤. Although a case could be made for using < as the prototypical ordering relation. These two relations differ in one important sense: ≤ is reflexive and ...The prototype for ordering relations is ≤. Although a case could be made for using < as the prototypical ordering relation. These two relations differ in one important sense: ≤ is reflexive and < is irreflexive. Various authors, having made different choices as to which of these is the more prototypical, have defined ordering relations in slightly different ways. The majority view seems to be that an ordering relation is reflexive (which means that ordering relations are modeled after ≤)
