String Diagrams for Regular Logic (Extended Abstract)

09/15/2020
by   Brendan Fong, et al.
0

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 that 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. We shall show that every natural category has an associated regular calculus, and conversely from every regular calculus one can construct a regular category.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2018

Graphical Regular Logic

Regular logic can be regarded as the internal language of regular catego...
research
05/02/2022

Cornering Optics

We show that the category of optics in a monoidal category arises natura...
research
08/03/2020

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics

We characterize regular string transductions as programs in a linear λ-c...
research
04/25/2018

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams

Linear/non-linear (LNL) models, as described by Benton, soundly model a ...
research
05/01/2020

Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games

ω-regular energy games, which are weighted two-player turn-based games w...
research
12/09/2022

Extended Addressing Machines for PCF, with Explicit Substitutions

Addressing machines have been introduced as a formalism to construct mod...

Please sign up or login with your details

Forgot password? Click here to reset