SearcharxivSearch

arXiv subjects

Tslil Clingman

Publications and source records attributed to Tslil Clingman.

2 recordsLinked to original sources

Bi-initial objects and bi-representations are not so different

We introduce a functor $\mathcal V\colon \mathrm{DblCat}_{h,nps}\to \mathrm{2Cat}_{h,nps}$ extracting from a double category a $2$-category whose objects and morphisms are the vertical morphisms and squares. We give a characterisation of bi-representations of a normal pseudo-functor $F\colon \mathbf C^{\operatorname{op}}\to \mathrm{Cat}$ in terms of double bi-initial objects in the double category $\mathbb{E}l(F)$ of elements of $F$, or equivalently as bi-initial objects of a special form in the $2$-category $\mathcal V\mathbb{E}l(F)$ of morphisms of $F$. Although not true in general, in the special case where the $2$-category $\mathbf C$ has tensors by the category $\mathbf{2}=\{0\to 1\}$ and $F$ preserves those tensors, we show that a bi-representation of $F$ is then precisely a bi-initial object in the $2$-category $\mathbf{E}l(F)$ of elements of $F$. We give applications of this theory to bi-adjunctions and weighted bi-limits.

math.CT

Regular Calculi I: Graphical Regular Logic

What is ergonomic syntax for relations? In this first paper in a series of two, to answer the question we define regular calculi: a suitably structured functor from a category representing the syntax of regular logic to the category of posets, that takes each object to the poset of relations on that type. We introduce two major classes of examples, regular calculi corresponding to regular theories, and regular calculi corresponding to regular categories. For working in regular calculi, we present a graphical framework which takes as primitive the various moves of regular logic. Our main theorem for regular calculi is a syntax-semantics $2$-dimensional adjunction to regular categories.

math.CT