Graphical Regular Logic
Abstract
Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category $\mathsf{FRg}(\mathrm{T})$ on a set $\mathrm{T}$. From this point of view, regular theories are certain monoidal 2functors from a suitable 2category of contextsthe 2category of relations in $\mathsf{FRg}(\mathrm{T})$to the 2category of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2functor as a regular calculus because it naturally gives rise to a graphical string diagram calculus in the spirit of Joyal and Street. Our key aim to prove that the category of regular categories is essentially reflective in that of regular calculi. Along the way, we demonstrate how to use this graphical calculus.
 Publication:

arXiv eprints
 Pub Date:
 December 2018
 arXiv:
 arXiv:1812.05765
 Bibcode:
 2018arXiv181205765F
 Keywords:

 Mathematics  Category Theory;
 Computer Science  Logic in Computer Science;
 Mathematics  Logic;
 18B10;
 03G30
 EPrint:
 47 pages