Relation algebra

In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation. The motivating example of a relation algebra is the algebra 2^X² of all binary relations on a set X, that is, subsets of the cartesian square X², with R•S interpreted as the usual composition of binary relations R and S, and with the converse of R interpreted as the inverse relation.

Relation algebra emerged in the 19th-century work of Augustus De Morgan and Charles Peirce, which culminated in the algebraic logic of Ernst Schröder. The equational form of relation algebra treated here was developed by Alfred Tarski and his students, starting in the 1940s. Tarski and Givant (1987) applied relation algebra to a variable-free treatment of axiomatic set theory, with the implication that mathematics founded on set theory could itself be conducted without variables.

A relation algebra (L, ∧, ∨, ⁻, 0, 1, •, I, ^{${\displaystyle {\breve {\ }}}$}) is an algebraic structure equipped with the Boolean operations of conjunction x∧y, disjunction x∨y, and negation x⁻, the Boolean constants 0 and 1, the relational operations of composition x•y and converse x^{${\displaystyle {\breve {\ }}}$}, and the relational constant I, such that these operations and constants satisfy certain equations constituting an axiomatization of relation algebras. A relation algebra is to a system of binary relations on a set containing the empty (0), complete (1), and identity (I) relations and closed under these five operations as a group is to a system of permutations of a set containing the identity permutation and closed under composition and inverse.

...
Wikipedia