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

Journal of Logic and Computation. 2020. Vol. 30. No. 1. P. 239–256.

Kanovich M., Kuznetsov S., Scedrov A.

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’, i.e. 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.

Keywords: linear logic, линейная логика, теория доказательств, proof theory, Lambek calculus, исчисление Ламбека

Publication based on the results of: Intelligent Data Analysis in Interactive Systems for Transdisciplinary Applications (2020)