2018/12/14 by Brendan Fong, David I. Spivak, Fong, Brendan +1 · 1 citation
Computer Science · Mathematics · #03G30 #18B10 #Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1812.05765
openalex publication_date 2018/12/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 FRg(T) on a set T. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts---the 2-category of relations in FRg(T)---to the 2-category of posets. Such functors assign to each context the set of formulas in that context, ordered by entailment. We refer to such a 2-functor 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.