Related papers: Semi-Substructural Logics with Additives
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…
Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing…
We now have a wide range of proof assistants available for compositional reasoning in monoidal or higher categories which are free on some generating signature. However, none of these allow us to represent categorical operations such as…
We study extensions and second cohomology of skew left braces via the natural semi-direct products associated with the skew left braces. Let $0 \to I \to E \to H \to 0$ be a skew brace extension and $\Lambda_H$ denote the natural…
In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…
Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…
Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi for induction contain a separate rule or axiom which reduces the valid proof…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
When can two sequential steps performed by a computing device be considered (causally) independent? This is a relevant question for concurrent and distributed systems, since independence means that they could be executed in any order, and…
Deep learning techniques are increasingly popular in the textual entailment task, overcoming the fragility of traditional discrete models with hard alignments and logics. In particular, the recently proposed attention models (Rockt\"aschel…
Linearly distributive categories (LDC), introduced by Cockett and Seely to model multiplicative linear logic, are categories equipped with two monoidal structures that interact via linear distributivities. A seminal result in monoidal…
Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…
In this survey paper we give account of several approaches to the strictification and non-strictification of monoidal categories, which are constructions that turn a monoidal category into a (non-)strict one monoidally equivalent to the…
This article shows that the units of a skew monoidal category are unique up to a unique isomorphism, and internalises this fact to skew monoidales. Some benefits of certain extra structure on the unit maps are also discussed before the…
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…
We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…
A general result relating skew monoidal structures and monads is proved. This is applied to quantum categories and bialgebroids. Ordinary categories are monads in the bicategory whose morphisms are spans between sets. Quantum categories…
Spurred by the new examples found by Kornel Szlach\'anyi of a form of lax monoidal category, the author felt the time ripe to publish a reworking of Eilenberg-Kelly's original paper on closed categories appropriate to the laxer context. The…