Diagrammatic Algebras of Relations

The calculus of relations was introduced by De Morgan and Peirce during the second half of the 19th century. Later developments on quantification theory by Frege and Peirce himself, paved the way to what is known today as first-order logic, causing the calculus of relations to be long forgotten. This was until 1941, when Tarski raised the question on the existence of a complete axiomatisation for it. Such question found only negative answers: there is no finite axiomatisation for the calculus of relations and many of its fragments, as shown later by several no-go theorems. In this thesis we show that -- by moving from traditional syntax (cartesian) to a diagrammatic one (monoidal) -- it is possible to have complete axiomatisations for the full calculus and some of its fragments. The no-go theorems are circumvented by the fact that our calculi are more expressive than the calculus of relations and, actually, as expressive as (the coherent fragment and full) first-order logic. Our axiomatisations emerge through the interplay of cartesian bicategories with other algebraic structures, giving rise to finite biproduct cartesian bicategories and first-order bicategories.