November 2007
Intermediate to advanced
330 pages
10h 29m
English
In this chapter we will study the difference between properties of relations and operations on relations. We will also study types of relations such as symmetry, transitivity, reflexivity, and discuss the concept of transitive closure (Warshall’s algorithm).
Relations are sets of tuples, so we can apply set operations. The intersection of two relations gives pairs satisfying both relations. The union gives pairs satisfying one-the union of “brother-of” and “sister-of” is “sibling-of”. Complement gives pairs not satisfying both relations.
Definition If R is a relation on A × B, then R–1 is a relation on B × A given by R–1 = {(b,a)|(a,b) R}. It is just the relation ...
Read now
Unlock full access