Properties of Relations
1. Symmetry
Not all relations are alike. Consider the relations "is the brother of" and "is taller than." If Saul is the brother of Larry, is Larry the brother of Saul? Clearly. But if Saul is taller than Larry, is Larry taller than Saul? Clearly not. We can describe this difference by saying that "is the brother than" is a symmetric relation while "is taller than is an asymmetric relation. We can express this in QL as follows:
R is symmetric |
(x)(y)(Rxy ⊃Ryx) |
Other examples: "is the same age as" "is the brother or sister of"
R is asymmetric |
(x)(y)(Rxy ⊃ ~Ryx) |
Other examples: "is the parent of", "is less than."
A weaker relation involving symmetry is antisymmetry. In an antisymetrical relation, the relata are symmetrical only if they are identical.
R is antisymmetric |
(x)(y)(x
≠
y &
Rxy)
⊃
~Ryx)) or (x)(y)((Rxy & Ryx) ⊃ x = y) |
examples: "less than or equal to"
Results:
Any asymmetric relation is antisymmetric:
(x)(y)(Rxy ⊃ ~Ryx) // (x)(y)((x ≠ y & Rxy) ⊃ ~Ryx)
2. Transitivity
If 2 is less than 5 and five is less than 10, then 2 is less than 10. This fact is an instance of the transitivity of the "less than" relation.
R is transitive |
(x)(y)(z)((Rxy & Ryz) ⊃ Rxz) |
Examples: "is the same age as", "is less than"
Notice that transitivity is really an A categorical proposition. What about intransitivity?
R is intransitive |
(x)(y)(z)((Rxy & Ryz) ⊃ ~Rxz) |
That's an E categorical proposition!
Examples: "is the parent of", "differs by 1 from"
We know that E categorical propositions are not the negations of A categorical propositions. So the notion of non-transitivity is different from the notion of intransitivity. We expect, and confirm, that "not transititive" is the negation of an A categorical proposition, namely, an O categorical proposition:
R is not transitive |
(∃x)(∃y)(∃z)((Rxy & Ryz) & ~Rxz) |
The final possibility is the negation of the E form, when a relation R is not intransitive:
R is not intransitive |
(∃x)(∃y)(∃z)((Rxy & Ryz) & Rxz) |
R is not intransitive
3. Reflexivity
R is reflexive
R is reflexive |
(x)Rxx |
R is irreflexive (x)~Rxx
R is irreflexive |
(x)~Rxx |
R is non-reflexive (∃x)Rxx & (∃x)~Rxx
R is non-reflexive |
(∃x)Rxx & (∃x)~Rxx |
example: x loves y
Exercise: Properties of Relations
table of contents | List of Exercises |