| Subexponentials in non-commutative linear logic M Kanovich, S Kuznetsov, V Nigam, A Scedrov Mathematical Structures in Computer Science 29 (8), 1217-1249, 2019 | 42 | 2019 |
| Undecidability of the Lambek calculus with a relevant modality M Kanovich, S Kuznetsov, A Scedrov Formal Grammar: 20th and 21st International Conferences, FG 2015, Barcelona …, 2016 | 27 | 2016 |
| A logical framework with commutative and non-commutative subexponentials M Kanovich, S Kuznetsov, V Nigam, A Scedrov Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as …, 2018 | 23 | 2018 |
| Lambek grammars with one division and one primitive type S Kuznetsov Logic Journal of the IGPL 20 (1), 207-221, 2012 | 16 | 2012 |
| Infinitary action logic with exponentiation SL Kuznetsov, SO Speranski Annals of Pure and Applied Logic 173 (2), 103057, 2022 | 15 | 2022 |
| Soft subexponentials and multiplexing M Kanovich, S Kuznetsov, V Nigam, A Scedrov Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris …, 2020 | 14 | 2020 |
| Undecidability of the Lambek calculus with subexponential and bracket modalities M Kanovich, S Kuznetsov, A Scedrov Fundamentals of Computation Theory: 21st International Symposium, FCT 2017 …, 2017 | 14 | 2017 |
| The Logic of Action Lattices is Undecidable. SL Kuznetsov LICS, 1-9, 2019 | 13 | 2019 |
| The complexity of multiplicative-additive Lambek calculus: 25 years later M Kanovich, S Kuznetsov, A Scedrov International Workshop on Logic, Language, Information, and Computation, 356-372, 2019 | 11 | 2019 |
| The Lambek calculus with iteration: two variants S Kuznetsov International Workshop on Logic, Language, Information, and Computation, 182-198, 2017 | 11 | 2017 |
| Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives S Kuznetsov International Conference on Formal Grammar, 242-249, 2012 | 10 | 2012 |
| Action logic is undecidable S Kuznetsov ACM Transactions on Computational Logic (TOCL) 22 (2), 1-26, 2021 | 9 | 2021 |
| ∗-continuity vs. induction: Divide and conquer S Kuznetsov Advances in Modal Logic, 493-510, 2018 | 9 | 2018 |
| A polynomial time algorithm for the Lambek calculus with brackets of bounded order M Kanovich, S Kuznetsov, G Morrill, A Scedrov arXiv preprint arXiv:1705.00694, 2017 | 9 | 2017 |
| Lambek grammars with the unit S Kuznetsov International Conference on Formal Grammar, 262-266, 2010 | 9 | 2010 |
| Non-associative, non-commutative multi-modal linear logic E Blaisdell, M Kanovich, SL Kuznetsov, E Pimentel, A Scedrov International Joint Conference on Automated Reasoning, 449-467, 2022 | 8 | 2022 |
| The multiplicative-additive Lambek calculus with subexponential and bracket modalities M Kanovich, S Kuznetsov, A Scedrov Journal of Logic, Language and Information 30 (1), 31-88, 2021 | 8 | 2021 |
| L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit M Kanovich, S Kuznetsov, A Scedrov Logic, Language, Information, and Computation: 26th International Workshop …, 2019 | 8 | 2019 |
| Complexity of commutative infinitary action logic S Kuznetsov International Workshop on Dynamic Logic, 155-169, 2020 | 7 | 2020 |
| Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities M Kanovich, S Kuznetsov, A Scedrov Journal of Logic and Computation 30 (1), 239-256, 2020 | 7 | 2020 |
Andre ScedrovProfessor of Mathematics, Professor of Computer and Information Science, University of PennsylvaniaVerified email at math.upenn.edu
