DeepAI AI Chat
Log In Sign Up

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

by   Max Kanovich, et al.

We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill's calculi, and focus on their fragments including multiplicative (Lambek) connectives, additive conjunction and disjunction, brackets and bracket modalities, and the ! subexponential modality. For both systems, we resolve issues connected with the cut rule and provide necessary modifications, after which we prove admissibility of cut (cut elimination theorem). We also prove algorithmic undecidability for both calculi, and show that categorial grammars based on them can generate arbitrary recursively enumerable languages.


page 1

page 2

page 3

page 4


Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...

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 in...

Infinitary Action Logic with Exponentiation

We introduce infinitary action logic with exponentiation—that is, the mu...

Bouncing threads for infinitary and circular proofs

We generalize the validity criterion for the infinitary proof system of ...

Complexity of the Infinitary Lambek Calculus with Kleene Star

We consider the Lambek calculus, or non-commutative multiplicative intui...

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...

Language Models for Some Extensions of the Lambek Calculus

We investigate language interpretations of two extensions of the Lambek ...