Stepan L. Kuznetsov, “Complexity of the Lambek calculus and its extensions”, Logic and Algorithms in Computational Linguistics 2021, LACompLing2021, Stud. Comput. Intell., 1081, Springer, Cham, 2023, 1–29
6.
Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Explorations in subexponential non-associative non-commutative linear logic”, Proceedings Modalities in substructural logics: Applications at the interfaces of logic, language and computation (AMSLO 2023), Ljubljana, Slovenia, August 7-8, 2023, Electron. Proc. Theor. Comput. Sci., 381, Open Publishing Association, 2023, 4–19 , arXiv: 2308.05537v1
7.
Stepan L. Kuznetsov, “On the complexity of reasoning in Kleene algebra with commutativity conditions”, Theoretical Aspects of Computing – ICTAC 2023, Lima, Peru, December 4–8, 2023, Lecture Notes in Comput. Sci., 14446, Springer, Cham, 2023, 83–99
Stepan L. Kuznetsov, “Relational models for the Lambek calculus with intersection and constants”, Log. Methods Comput. Sci., 19:4 (2023), 32 , 27 pp., arXiv: 2210.00654
9.
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Language models for some extensions of the Lambek calculus”, Inform. and Comput., 287 (2022), 104760 , 16 pp., arXiv: 2008.00070;
Stepan L. Kuznetsov, Stanislav O. Speranski, “Infinitary action logic with exponentiation”, Ann. Pure Appl. Logic, 173:2 (2022), 103057 , 33 pp., arXiv: 2001.06863
Max I. Kanovich, Stepan G. Kuznetsov, Stepan L. Kuznetsov, Andre Scedrov, “Decidable fragments of calculi used in CatLog”, Natural Language Processing in Artificial Intelligence — NLPinAI 2021, Stud. Comput. Intell., 999, Springer, Cham, 2022, 1–24
Stepan L. Kuznetsov, “Reasoning in commutative Kleene algebras from *-free hypotheses”, Logica Yearbook 2021, College Publications, London, 2022, 99–113
13.
Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Non-associative, non-commutative multi-modal linear logic”, Automated Reasoning, 11th International Conference, IJCAR 2022 (Haifa, Israel, August 8–10, 2022), Lecture Notes in Comput. Sci., 13385, Springer, Cham, 2022, 449–467
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The multiplicative-additive Lambek calculus with subexponential and bracket modalities”, J. Logic Lang. Inf., 30:1 (2021), 31–88
Stepan L. Kuznetsov, “Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs”, Automated Reasoning with Analytic Tableaux and Related Methods, 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021, Lecture Notes in Comput. Sci., 12842, Springer, Cham, 2021, 317–334
Stepan L. Kuznetsov, “Relational models for the Lambek calculus with intersection and unit”, Relational and Algebraic Methods in Computer Science. RAMiCS 2021, Marseille, November 2–5, 2021, Lecture Notes in Comput. Sci., 13027, Springer, Cham, 2021, 258–274
S. M. Dudakov, B. N. Karlov, S. L. Kuznetsov, E. M. Fofanova, “Complexity of Lambek calculi with modalities and of total derivability in grammars”, Algebra and Logic, 60:5 (2021), 308–326
20.
S. L. Kuznetsov, “Printsip dekompozitsii i algoritmicheskaya nerazreshimost dlya monoidov Klini s deleniyami”, Vserossiiskaya nauchnaya konferentsiya “Matematicheskie osnovy informatiki i informatsionno-kommunikatsionnykh sistem”. Sbornik trudov (Tver, 3–8 dekabrya 2021 g.), eds. S. M. Dudakov, B. N. Karlov, TvGU, Tver, 2021, 176–180
21.
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, N. S. Ryzhkova, “A restricted fragment of the Lambek calculus with iteration and intersection operations”, Algebra and Logic, 59:2 (2020), 129–146
24.
Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Soft subexponentials and multiplexing”, Automated Reasoning, 10th International Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Lecture Notes in Comput. Sci., 12166, Springer, 2020, 500–517
Stepan Kuznetsov, “The ‘long rule’ in the Lambek calculus with iteration: undecidability without meets and joins”, AiML 2020, Helsinki, Finland, August 24–28, 2020, Advances in Modal Logic, 13, College Publications, London, 2020, 425–440
26.
Stepan L. Kuznetsov, “A $\Pi^0_1$-bounded fragment of infinitary action logic with exponential”, Logic, Language, and Security: Scedrov Festschrift, Lecture Notes in Comput. Sci., 12300, Springer, Cham, 2020, 3–16
Stepan Kuznetsov, “Complexity of commutative infinitary action logic”, Dynamic Logic. New Trends and Applications, Third International Workshop, DaLi 2020, Prague, Czech Republic, October 9–10, 2020, Lecture Notes in Comput. Sci., 12569, Springer, Cham, 2020, 155–169
Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Subexponentials in non-commutative linear logic”, Math. Structures Comput. Sci., 29:8, A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday (2019), 1217–1249 , arXiv: 1709.03607
Stepan Kuznetsov, Valentina Lugovaya, Anastasiia Ryzhova, “Craig’s trick and a non-sequential system for the Lambek calculus and its fragments”, Log. J. IGPL, 27:3 (2019), 252–266
Stepan Kuznetsov, “The logic of action lattices is undecidable”, Proc. 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019 (Vancouver, B.C., June 24–27, 2019), IEEE, 2019, 1–9
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The complexity of multiplicative-additive Lambek calculus: 25 years later”, WoLLIC 2019: Logic, Language, Information, and Computation, International Workshop on Logic, Language, Information, and Computation (Utrecht, July 2–5, 2019), Lecture Notes in Comput. Sci., 11541, Springer, Berlin, Heidelberg, 2019, 356–372
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit”, WoLLIC 2019: Logic, Language, Information, and Computation, International Workshop on Logic, Language, Information, and Computation (Utrecht, July 2–5, 2019), Lecture Notes in Comput. Sci., 11541, Springer, Berlin, Heidelberg, 2019, 373–391
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of a Newly Proposed Calculus for CatLog3”, Formal Grammar, 24th International Conference, FG 2019, Riga, Latvia, August 11, 2019, Lecture Notes in Comput. Sci., 11668, Springer, Berlin, Heidelberg, 2019, 67–83
Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “A logical framework with commutative and non-commutative subexponentials”, Automated Reasoning, IJCAR 2018 (Oxford, UK, July 14-17, 2018), Lecture Notes in Comput. Sci., 10900, eds. D. Galmiche, S. Schulz, R. Sebastiani, Springer, Cham, 2018, 228–245
Stepan Kuznetsov, “$*$-continuity vs. induction: divide and conquer”, 12th Conference on ""Advances in Modal Logic"", AiML 2018, Advances in Modal Logic, 12, University of Bern, Bern, Switzerland, 2018, 493–510
37.
S. Kuznetsov, A. Okhotin, “Conjunctive categorial grammars”, Proceedings of the 15th Meeting on the Mathematics of Language (London, July 13–14, 2017), ACL Anthology, 2017, 140–151 (W17-3414)http://aclweb.org/anthology/W17-3414
S. Kuznetsov, G. Morrill, O. Valentín, “Count-invariance including exponentials”, Proceedings of the 15th Meeting on the Mathematics of Language (London, July 13–14, 2017), ACL Anthology, 2017, 128–139 (W17-3413)http://www.aclweb.org/anthology/W17-3413
Stepan Kuznetsov, “The Lambek calculus with iteration: two variants”, WoLLIC 2017 (London, July 18–21, 2017), Lecture Notes in Comput. Sci., 10388, 2017, 182–198
Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov, “A polynomial-time algorithm for the Lambek calculus with brackets of bounded order”, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) (Oxford, September 3–9, 2017), Leibniz Internat. Proc. in Inform., 84, eds. D. Miller, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2017, 22:1–22:17
41.
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with subexponential and bracket modalities”, Fundamentals of Computation Theory, FCT 2017 (Bordeaux, September 11–13, 2017), Lecture Notes in Comput. Sci., 10472, eds. R. Klasing, M. Zeitoun, Springer, 2017, 326–340
M. Kanovich, S. Kuznetsov, A. Scedrov, “On Lambek's restriction in the presence of exponential modalities”, Lecture Notes in Comput. Sci., 9537, 2016, 146–158
Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with a relevant modality”, Lecture Notes in Comput. Sci., 9804, eds. A. Foret, G. Morrill, R. Muskens, R. Osswald, S. Pogodalla, 2016, 240–256 , arXiv: 1601.06303
S. L. Kuznetsov, “On translating Lambek grammars with one division into context-free grammars”, Proc. Steklov Inst. Math., 294 (2016), 129–138
45.
S. L. Kuznetsov, “On Translating Context-Free Grammars into Lambek Grammars”, Proc. Steklov Inst. Math., 290 (2015), 63–69
46.
S. Kuznetsov, “$L$-completeness of the Lambek calculus with the reversal operation allowing empty antecedents”, Categories and types in logic, language, and physics. Essays dedicated to Jim Lambek on the occasion of his 90th birthday, Lecture Notes in Comput. Sci., 8222, eds. C. Casadio, B. Coecke, M. Moortgat, P. Scott, Springer, Berlin, Heidelberg, 2014, 268–278
S. Kuznetsov, “Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives”, Formal grammar. 17th and 18th international conferences, FG 2012, Opole, Poland, August 2012, revised selected papers, FG 2013, Düsseldorf, Germany, August 2013, Proceedings, Lecture Notes in Comput. Sci., 8036, Springer, Berlin, 2013, 242–249
S. Kuznetsov, “L-completeness of the Lambek calculus with the reversal operation”, Logical aspects of computational linguistics, Lecture Notes in Comput. Sci., 7351, Springer, Heidelberg, 2012, 151–160
S. Kuznetsov, “Lambek grammars with the unit”, Formal grammar. 15th and 16th international conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011. Revised selected papers, Lecture Notes in Comput. Sci., 7395, Springer, Berlin, 2012, 262–266
S. L. Kuznetsov, “On the Lambek calculus with a unit and one division”, Moscow University Math. Bull., 66:4 (2011), 173–175
53.
S. L. Kuznetsov, “On the Lambek calculus with one division and one primitive type that allows empty antecedents”, Moscow University Math. Bull., 64:2 (2009), 76–79
Thesis
54.
S. L. Kuznetsov, Algoritmicheskie voprosy dlya substrukturnykh logik s iteratsiei Klini, Diss. … dokt. fiz.-matem. nauk, Matematicheskii institut im. V. A. Steklova RAN, Moskva, 2024 , 266 pp. (.pdf)
Stepan L. Kuznetsov, “Proof disbalancing for proving complexity results: towards infinitary focusing”, The Proof Society Summer School and Workshop 2023. Booklet of Abstracts (Barcelona, July 10–14, 2023), University of Barcelona, 2023, 69–72(pdf)
57.
Stepan Kuznetsov, “Complexity of reasoning in residuated Kleene algebras”, 5th International Workshop on Structures and Deduction (Dortmund, June 29–30, 2019), 2019 (pdf)
58.
Stepan Kuznetsov, “Half a way towards circular proofs for Kleene lattices”, Circularity in Syntax and Semantics (Gothenburg, November 20–22, 2019), University of Gothenburg, Gothenburg, 2019, 42–45(pdf)
59.
S. L. Kuznetsov, “O polnote fragmenta ischisleniya Lambeka s operatsiyami iteratsii i peresecheniya otnositelno relyatsionnykh modelei”, Maltsevskie chteniya 2018 (Novosibirsk, 19–22 noyabrya 2018 g.), Institut matematiki im. S. L. Soboleva SO RAN; Novosibirskii gos. universitet, Novosibirsk, 2018, 224(pdf)
60.
M. Kanovich, S. Kuznetsov, V. Nigam, A. Scedrov, “On the proof theory of non-commutative subexponentials”, Dale Fest!, Seminar in honor of the 60th birthday of Dale Miller (Paris, December 15–16, 2017), Université Paris Diderot, 2016, 10 p.(pdf)
61.
S. L. Kuznetsov, N. S. Ryzhkova, “Fragment ischisleniya Lambeka s iteratsiei”, Maltsevskie chteniya 2015 (Novosibirsk, 3–7 maya 2015 g.), Institut matematiki im. S.L. Soboleva SO RAN; Novosibirskii gos. universitet, Novosibirsk, 2015, 213[tezisy .pdf]
62.
S. Kuznetsov, “On translating context-free grammars into Lambek categorial grammars”, Joint Proceedings of the Second Workshop on Natural Language and Computer Science (NLCS’14) & 1st International Workshop on Natural Language Services for Reasoners (NLSR 2014), Affliated to RTA-TLCA, VSL 2014 (Vienna, July 17–18, 2014), eds. V. de Paiva, W. Neuper, P. Quaresma, C. Retoré, L. S. Moss, J. Saludes, Center for Informatics and Systems of the University of Coimbra, Coimbra, Portugal, 2014, 137–142
63.
S. Kuznetsov, “On the Lambek calculus with one division and one primitive type”, Structures and Deduction 2009, ESSLLI '09 Workshop (Bordeaux, July 20–24, 2009), eds. Michel Parigot and Lutz Straßburger, 2009, 2–11[proceedings, .pdf]
ArXiv
64.
S. Kuznetsov, Eliminating the unit constant in the Lambek calculus with brackets, 2017 , 7 pp., arXiv: 1711.06361
Popular science or education materials
65.
S. Kuznetsov, Kvant, 2020, no. 10, 32–33
66.
S. L. Kuznetsov, Kvant, 2019, no. 3, 29–31
67.
S. Kuznetsov, Kvant, 2019, no. 12, 10–11
68.
S. L. Kuznetsov, Kvant, 2018, no. 11, 9
69.
S. L. Kuznetsov, Kvant, 2018, no. 3, 32–33
70.
S. Kuznetsov, “Ptichka vyletaet!”, Kvantik, 2017, no. 2, 10–11
Seminar 1. Algebraic and categorical logic S. L. Kuznetsov, V. B. Shehtman Seminar by S. L. Kuznetsov and V. B. Shehtman "Algebraic and categorical logic" February 9, 2022 18:00
Лекция 11. Модели лямбда-исчисления L. D. Beklemishev, S. L. Kuznetsov L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus February 10, 2020 16:30