Stepan L. Kuznetsov, “Complexity of the Lambek calculus and its extensions”, Stud. Comput. Intell., 1081 (2023), 1–29
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The multiplicative-additive Lambek calculus with subexponential and bracket modalities”, J. Logic Lang. Inf., 30 (2021), 31–88
Wojciech Buszkowski, Studies in Computational Intelligence, 939, Natural Language Processing in Artificial Intelligence—NLPinAI 2020, 2021, 1
Stepan Kuznetsov, “Complexity of the infinitary Lambek calculus with Kleene star”, Rev. Symb. Log., 14:4 (2021), 946–972
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities”, J. Logic Comput., 30:1 (2020), 239–256
S. L. Kuznetsov, “On translating context-free grammars into Lambek grammars”, Proc. Steklov Inst. Math., 290:1 (2015), 63–69
S. Kuznetsov, “$L$-completeness of the Lambek calculus with the reversal operation allowing empty antecedents”, Lecture Notes in Comput. Sci., 8222 (2014), 268–278
Wojciech Buszkowski, Lecture Notes in Computer Science, 8535, Logical Aspects of Computational Linguistics, 2014, 30
Alexey Sorokin, Lecture Notes in Computer Science, 8036, Formal Grammar, 2013, 250
S. Kuznetsov, “Lambek grammars with the unit”, Lecture Notes in Comput. Sci., 7395 (2012), 262–266