27 citations · 60 across the 11 of their papers we have counts for
3 papers · 2 filters
Undecidability of the Lambek calculus with subexponential and bracket modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenom…
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
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…
Undecidability of the Lambek calculus with a relevant modality
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This…