相关论文: Coherence and Confluence

A concise guide to very basic bicategory theory, from the definition of a bicategory to the coherence theorem.

We prove that in a regular category all reflexive and transitive relations are symmetric if and only if every internal category is an internal groupoid. In particular, these conditions hold when the category is n-permutable for some n.

Modules for sesquiads and congruence schemes are introduced. It is shown that the corresponding categories are belian and that base change functors establish an ascent datum which allows for a cohomology theory to be established.

Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…

Although quantum coherence is a basic trait of quantum mechanics, the presence of coherences in the quantum description of a certain phenomenon does not rule out the possibility to give an alternative description of the same phenomenon in…

The classical Eckmann-Hilton argument shows that two monoid structures on a set, such that one is a homomorphism for the other, coincide and, moreover, the resulting monoid is commutative. This argument immediately gives a proof of the…

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Although contemporary model theory has been called "algebraic geometry minus fields", the formal methods of the two fields are radically different. This dissertation aims to shrink that gap by presenting a theory of logical schemes,…

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…

Trace theory is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by individual program threads. Its simplicity, elegance, and…

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…

We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

We develop foundations for oriented category theory, an extension of $(\infty,\infty)$-category theory obtained by systematic usage of the Gray tensor product, in order to study lax phenomena in higher category theory. As categorical…

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…

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…

In topological data science, categories with a flow have become ubiquitous, including as special cases examples like persistence modules and sheaves. With the flow comes an interleaving distance, which has proven useful for applications. We…

Quantum theory is formulated as the uniquely consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if the amplitude of a quantum process can be computed in two different ways, the two…

For $n\in \mathbb{N}$, a group is called $n$-coherent if every subgroup of type $\mathsf{F}_n$ is of type $\mathsf{F}_{n+1}$. For $n\ge 1$, we observe that graphs of groups with $n$-coherent vertex groups and virtually poly-cyclic edge…