Transitive Relations
Transitive relations are binary relations R on a single set X where for all a, b, c in X, aRb and bRc implies aRc. Transitive relations fall into two broad classes, equivalence relations and order relations. Equivalence relations are also symmetric and reflexive, while order relations are antisymmetric (complete order) or asymmetric (partial order) and may be reflexive (inclusive order) or anti-reflexive (strict order). The algebraic structure of equivalence relations builds on transformation groups; that of order relations builds on lattice theory. For more on relations and mathematics, from a philosophical standpoint, see Lucas (1999: chpt. 9).
Read more about this topic: Finitary Relation
Famous quotes containing the word relations:
“Happy will that house be in which the relations are formed from character; after the highest, and not after the lowest order; the house in which character marries, and not confusion and a miscellany of unavowable motives.”
—Ralph Waldo Emerson (18031882)