相关论文: Coherence of Proof-Net Categories

We prove that the arrow category of a monoidal model category, equipped with the pushout product monoidal structure and the projective model structure, is a monoidal model category. This answers a question posed by Mark Hovey, and has the…

Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…

Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…

This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…

It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally…

This paper studies questions of coherence and strictification related to self-similarity - the identity $S\cong S\otimes S$ in a (semi-)monoidal category. Based on Saavedra's theory of units, we first demonstrate that strict self-similarity…

A causal-net is a finite acyclic directed graph. In this paper, we introduce a category, denoted by $\mathbf{Cau}$ and called causal-net category, whose objects are causal-nets and morphisms between two causal-nets are the functors between…

We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…

Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…

In this paper, we introduce a cofibrant simplicial category that we call the free homotopy coherent adjunction and characterize its n-arrows using a graphical calculus that we develop here. The hom-spaces are appropriately fibrant, indeed…

In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…

String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…

We set up a fibred categorical theory of obstruction and classification of morphisms that specializes to the one of monoidal functors between categorical groups and also to the Schreier-Mac Lane theory of group extensions. Further…

We present a unified framework for Petri nets and various variants, such as pre-nets and Kock's whole-grain Petri nets. Our framework is based on a less well-studied notion that we call $\Sigma$-nets, which allow finer control over whether…

We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give…

We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms for short, which are certain bipartite graphs decorated with words in a given alphabet, generalizing linear logic…

Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…

Given a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ and a space $X$, we address the problem of explicitly describing the symmetric monoidal $(\infty,n)$-category freely obtained from $\mathcal{C}$ by adjoining $X$ new…

We present a Rocq library for monoidal categories, which includes a decision procedure for proving equality of morphisms as well as notations that make it possible to reason as if they were strict, inferring MacLane isomorphims…