structural:expansion
Calculus of relations

Developments in algebraic logic have facilitated usage of binary relations. The calculus of relations includes the algebra of sets, extended by composition of relations and the use of converse relations. The inclusion R ⊆ S, {\displaystyle R\subseteq S,} meaning that a R b {\displaystyle aRb} implies a S b {\displaystyle aSb}, sets the scene in a lattice of relations. But since P ⊆ Q ≡ (P ∩ Q ¯ = ∅) ≡ (P ∩ Q = P), {\displaystyle P\subseteq Q\equiv (P\cap {\bar {Q}}=\varnothing)\equiv (P\cap Q=P),} the inclusion symbol is superfluous. Nevertheless, composition of relations and manipulation of the operators according to Schröder rules, provides a calculus to work in the power set of A × B. {\displaystyle A\times B.}

In contrast to homogeneous relations, the composition of relations operation is only a partial function. The necessity of matching target to source of composed relations has led to the suggestion that the study of heterogeneous relations is a chapter of category theory as in the category of sets, except that the morphisms of this category are relations. The objects of the category Rel are sets, and the relation-morphisms compose as required in a category.