Showing cs.LOShow all
2 papers · 1 filter
cs.LO2020
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
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…
cs.LO2017
A polynomial time algorithm for the Lambek calculus with brackets of bounded order
Max Kanovich, Stepan Kuznetsov, Glyn Morrill +1
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm fo…