no code implementations • 1 May 2017 • Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov
Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the Lambek calculus with empty antecedents allowed.
no code implementations • 13 Aug 2016 • Max Kanovich, Stepan Kuznetsov, Andre Scedrov
Their extension is based on a non-standard contraction rule for the exponential that interacts with the bracket structure in an intricate way.
no code implementations • 7 Aug 2016 • Max Kanovich, Stepan Kuznetsov, Andre Scedrov
The system with cut elimination and substitution and without Lambek's restriction is folklore and known to be undecidable.
no code implementations • 23 Jan 2016 • 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.