Let S be the set of all strings of English letters.
Chapter 12, Problem 1E(choose chapter or problem)
Problem 1E
Let S be the set of all strings of English letters. Determine whether these relations are reflexive, irreflexive, symmetric, antisymmetric, and/or transitive.
a) R1 = {(a, b) | a and b have no letters in common}
b) R2 = {(a, b) | a and b are not the same length}
c) R3 = {(a, b) | a is longer than b)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer