English
Related papers

Related papers: Semi-Substructural Logics \`a la Lambek

200 papers

We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential…

Category Theory · Mathematics 2024-02-14 Michael Shulman

Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational…

Logic in Computer Science · Computer Science 2018-01-22 Ranald Clouston

This article gives a solid theoretical grounding to the observation that cubical structures arise naturally when working with parametricity. We claim that cubical models are cofreely parametric. We use categories, lex categories or clans as…

Logic in Computer Science · Computer Science 2022-09-05 Hugo Moeneclaey

In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules we obtain linear nested sequent…

Logic in Computer Science · Computer Science 2017-11-17 Björn Lellmann , Elaine Pimentel

Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…

Category Theory · Mathematics 2007-05-23 W. P. Joyce

This paper is the first of a pair that aims to classify a large number of the type $II$ quantum subgroups of the categories $\mathcal{C}(\mathfrak{sl}_{r+1},k)$. In this work we classify the braided auto-equivalences of the categories of…

Quantum Algebra · Mathematics 2022-10-28 Cain Edie-Michell , with an appendix by Terry Gannon

We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known…

Category Theory · Mathematics 2020-01-29 John Bourke , Stephen Lack

We lift the SCL calculus for first-order logic without equality to the SCL(T) calculus for first-order logic without equality modulo a background theory. In a nutshell, the SCL(T) calculus describes a new way to guide hierarchic resolution…

Logic in Computer Science · Computer Science 2020-10-23 Martin Bromberger , Alberto Fiori , Christoph Weidenbach

We argue that locally Cartesian closed categories form a suitable doctrine for defining dependent type theories, including non-extensional ones. Using the theory of sketches, one may define syntactic categories for type theories in a style…

Logic in Computer Science · Computer Science 2021-03-11 Daniel Gratzer , Jonathan Sterling

Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…

Category Theory · Mathematics 2014-07-08 Jan Stovicek

We present a formalization in Lean 4, within the framework of the mathematical library Mathlib, of the unbiasing process for symmetric monoidal categories. This is realized by extending the data of a symmetric monoidal category to a…

Category Theory · Mathematics 2026-03-03 Robin Carlier

Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…

Logic in Computer Science · Computer Science 2026-05-20 Sophia Roshal , Frank Pfenning

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore

A semiorthogonal decomposition for the bounded derived category (the category of perfect complexes in a non smooth case) of coherent sheaves on a Brauer Severi scheme is given. It relies on bounded derived categories (categories of perfect…

Algebraic Geometry · Mathematics 2007-05-23 Marcello Bernardara

We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…

Logic in Computer Science · Computer Science 2017-05-15 Abhisekh Sankaran

This article consists of an interesting characterisation of a skew monoidale in the monoidal bicategory $Span$. After discussing the shift or decalage functor on simplicial sets we characterise these skew monoidales as categories $\mathbb…

Category Theory · Mathematics 2016-03-29 Jim Andrianopoulos

Using methods of stable homotopy theory, the category of symmetric quasi-coherent sheaves associated with non-commutative graded algebras with extra symmetries is introduced and studied in this paper. It is shown to be a closed symmetric…

Algebraic Geometry · Mathematics 2025-07-04 Grigory Garkusha

In two-parameter bifurcation diagrams of piecewise-linear continuous maps on $\mathbb{R}^N$, mode-locking regions typically have points of zero width known as shrinking points. Near any shrinking point, but outside the associated…

Dynamical Systems · Mathematics 2016-12-14 David J. W. Simpson

For each braided category $\mathcal{C}$ we show that, under mild hypotheses, there is an associated category of "half braided algebras" and their bimodules internal to $\mathcal{C}$ which is not only monoidal but even braided and balanced.…

Quantum Algebra · Mathematics 2026-03-06 Francesco Costantino , Matthieu Faitg

We extend the simply-typed guarded $\lambda$-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming…

Programming Languages · Computer Science 2018-02-28 Alejandro Aguirre , Gilles Barthe , Lars Birkedal , Aleš Bizjak , Marco Gaboardi , Deepak Garg