# Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable sequent should be non-empty. In this paper we discuss ways of extending the Lambek calculus with the linear logic exponential modality while keeping Lambek's restriction. Interestingly enough, we show that for any system equipped with a reasonable exponential modality the following holds: if the system enjoys cut elimination and substitution to the full extent, then the system necessarily violates Lambek's restriction. Nevertheless, we show that two of the three conditions can be implemented. Namely, we design a system with Lambek's restriction and cut elimination and another system with Lambek's restriction and substitution. For both calculi we prove that they are undecidable, even if we take only one of the two divisions provided by the Lambek calculus. The system with cut elimination and substitution and without Lambek's restriction is folklore and known to be undecidable.

• 11 publications
• 9 publications
• 10 publications
research
03/03/2022

### A theory of cut-restriction: first steps

Cut-elimination is the bedrock of proof theory. It is the algorithm that...
research
05/30/2022

### Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

This paper introduces the exponential substitution calculus (ESC), a new...
research
12/30/2021

### A Deep Inference System for Differential Linear Logic

Differential linear logic (DiLL) provides a fine analysis of resource co...
research
07/31/2020

### The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

We give a proof-theoretic and algorithmic complexity analysis for system...
research
03/28/2023

### From Double Pushout Grammars to Hypergraph Lambek Grammars With and Without Exponential Modality

We study how to relate well-known hypergraph grammars based on the doubl...
research
03/27/2018

### A sequent calculus for a semi-associative law

We introduce a sequent calculus with a simple restriction of Lambek's pr...
research
08/15/2023

### Infinitary cut-elimination via finite approximations

We investigate non-wellfounded proof systems based on parsimonious logic...