Relation algebra
G. Schmidt · Cambridge University Press eBooks · 2010
Concerning syntax and notation, everything is now available to work with. We take this opportunity to have a closer look at the algebraic laws of relation algebra. In particular, we will be interested in how they can be traced back to a small subset of rules which can serve as axioms. We present them now and discuss them immediately afterwards. We should stress that we work with heterogeneous relations. This contrasts greatly with the traditional work of the relation algebra community which is almost completely restricted to a homogeneous environment – possibly enhanced by cylindric algebra considerations. Some of the constructs which follow simply do not exist in a homogeneous context, for example the direct power and the membership relation. At first glance, it seems simpler to study homogeneous as opposed to heterogeneous relations. But attempting domain constructions in the homogeneous setting immediately leads necessarily to non-finite models. Also deeper problems, such as the fact that ╥ A,B ; ╥ B,C = ╥ A,C does not necessarily hold, have only recently come to attention; this applies also to unsharpness. Laws of relation algebra The set of axioms for an abstract (possibly heterogeneous) relation algebra is nowadays generally agreed upon, and it is rather short. When we use the concept of a category, this does not mean that we are introducing a higher concept. Rather, it is used here as a mathematically acceptable way to prevent multiplying a 7 × 5-matrix with a 4 × 6-matrix.