English
Related papers

Related papers: Coherence by Normalization for Linear Multicategor…

200 papers

Various concerns suggest looking for internal co-categories in categories with strong logical structure. It turns out that in any coherent category, all co-categories are co-equivalence relations.

Category Theory · Mathematics 2014-11-21 Peter LeFanu Lumsdaine

We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…

Category Theory · Mathematics 2022-01-24 Antonin Delpeuch

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic in Computer Science · Computer Science 2019-02-12 Sergey Slavnov

It is shown that coherence conditions for monoidal categories concerning associativity are analogous to coherence conditions for symmetric or braided strictly monoidal categories, where associativity arrows are identities. Mac Lane's…

Category Theory · Mathematics 2007-05-23 K. Dosen , Z. Petric

We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…

Algebraic Topology · Mathematics 2014-11-26 Piotr Pstrągowski

Starting from the observation that distinct notions of copying have arisen in different categorical fields (logic and computation, contrasted with quantum mechanics) this paper addresses the question of when, or whether, they may coincide.…

Category Theory · Mathematics 2013-05-21 Peter Hines

It is proved that equalities between arrows assumed for cartesian categories are maximal in the sense that extending them with any new equality in the language of free cartesian categories collapses a cartesian category into a preorder. An…

Category Theory · Mathematics 2007-05-23 Kosta Dosen , Zoran Petric

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places, some formulations and proofs are here corrected, and…

Category Theory · Mathematics 2008-12-08 K. Dosen , Z. Petric

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

Category Theory · Mathematics 2008-02-26 Jonathan A. Cohen

We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories. In the case of bicategories and pseudofunctors, existing…

Category Theory · Mathematics 2016-12-21 Maxime Lucas

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…

Category Theory · Mathematics 2013-02-26 Christian Pech , Maja Pech

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

Logic in Computer Science · Computer Science 2017-06-05 Kei Matsumoto

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…

Logic in Computer Science · Computer Science 2021-01-27 Vladimir Zamdzhiev

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

Extensivity of a category may be described as a property of coproducts in the category, namely, that they are disjoint and universal. An alternative viewpoint is that it is a property of morphisms in a category. This paper explores this…

Category Theory · Mathematics 2025-02-19 Michael Hoefnagel , Emma Theart

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Category Theory · Mathematics 2014-10-16 Michal R. Przybylek

We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and…

Logic in Computer Science · Computer Science 2012-03-23 Silvia Ghilezan , Pierre Lescanne , Dragisa Zunic