The complexity of multiplicative-additive Lambek calculus: 25 years later
Max Kanovich, Stepan Kuznetsov, Andre Scedrov

Эта публикация цитируется в следующих статьяx:

1. Stepan L. Kuznetsov, Lecture Notes in Networks and Systems, 1631, Distributed Computing and Artificial Intelligence, Special Sessions I, 22nd International Conference, 2026, 85  
2. Tikhon Pshenitsyn, “Commutative Lambek grammars”, J. Logic Lang. Inf., 32 (2023), 887–936    
3. Stepan L. Kuznetsov, “Complexity of the Lambek calculus and its extensions”, Stud. Comput. Intell., 1081 (2023), 1–29      
4. Max. I. Kanovich, Stepan G. Kuznetsov, Stepan L. Kuznetsov, Andre Scedrov, “Decidable fragments of calculi used in CatLog”, Stud. Comput. Intell., 999 (2022), 1–24       [Max. I. Kanovich, Stepan G. Kuznetsov, Stepan L. Kuznetsov, Andre Scedrov, “Decidable fragments of calculi used in CatLog”, Stud. Comput. Intell., 999 (2022), 1–24  ]
5. Richard Moot, Symon Jory Stevens-Guille, “Logical Foundations for Hybrid Type-Logical Grammars”, J of Log Lang and Inf, 31:1 (2022), 35  
6. Wojciech Buszkowski, Studies in Computational Intelligence, 939, Natural Language Processing in Artificial Intelligence—NLPinAI 2020, 2021, 1  
7. Stepan Kuznetsov, “Complexity of the infinitary Lambek calculus with Kleene star”, Rev. Symb. Log., 14:4 (2021), 946–972        
8. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit”, Lecture Notes in Comput. Sci., 11541 (2019), 373–391