Undecidability of the Lambek calculus with a relevant modality M Kanovich, S Kuznetsov, A Scedrov Formal grammar, 240-256, 2015 | 10 | 2015 |

Lambek grammars with one division and one primitive type S Kuznetsov Logic Journal of the IGPL 20 (1), 207-221, 2012 | 10 | 2012 |

Subexponentials in non-commutative linear logic M Kanovich, S Kuznetsov, V Nigam, A Scedrov Mathematical Structures in Computer Science 29 (8), 1217-1249, 2019 | 9 | 2019 |

Undecidability of the Lambek calculus with subexponential and bracket modalities M Kanovich, S Kuznetsov, A Scedrov International Symposium on Fundamentals of Computation Theory, 326-340, 2017 | 8 | 2017 |

Conjunctive grammars in greibach normal form and the lambek calculus with additive connectives S Kuznetsov Formal Grammar, 242-249, 2013 | 7 | 2013 |

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 | 6 | 2017 |

On Lambek’s restriction in the presence of exponential modalities M Kanovich, S Kuznetsov, A Scedrov International Symposium on Logical Foundations of Computer Science, 146-158, 2016 | 6 | 2016 |

A logical framework with commutative and non-commutative subexponentials M Kanovich, S Kuznetsov, V Nigam, A Scedrov International Joint Conference on Automated Reasoning, 228-245, 2018 | 5 | 2018 |

Count-invariance including exponentials S Kuznetsov, G Morrill, O Valentín Proceedings of the 15th Meeting on the Mathematics of Language, 128-139, 2017 | 5 | 2017 |

Conjunctive categorial grammars S Kuznetsov, A Okhotin Proceedings of the 15th Meeting on the Mathematics of Language, 140-151, 2017 | 4 | 2017 |

On translating Lambek grammars with one division into context-free grammars SL Kuznetsov Proceedings of the Steklov Institute of Mathematics 294 (1), 129-138, 2016 | 4 | 2016 |

Lambek grammars with the unit S Kuznetsov Formal Grammar, 262-266, 2010 | 4 | 2010 |

The Lambek calculus with iteration: two variants S Kuznetsov International Workshop on Logic, Language, Information, and Computation, 182-198, 2017 | 3 | 2017 |

L-completeness of the Lambek calculus with the reversal operation S Kuznetsov International Conference on Logical Aspects of Computational Linguistics …, 2012 | 3 | 2012 |

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 | 2 | 2019 |

Bracket induction for Lambek calculus with bracket modalities G Morrill, S Kuznetsov, M Kanovich, A Scedrov International Conference on Formal Grammar, 84-101, 2018 | 2 | 2018 |

Recursive Enumerability Doesn’t Always Give a Decidable Axiomatization S Kuznetsov, V Lugovaya, A Ryzhova ¼ pª| p© Ú N| ª| À# ªÀÆ ÆÊÆ ¼ 1| v 1pª Êp pª© ¹ÊÆpÆ ª Wª Ó ¼À ÆÚ© ÀÆ …, 2017 | 2 | 2017 |

Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities M Kanovich, S Kuznetsov, A Scedrov arXiv preprint arXiv:1608.02254, 2016 | 2 | 2016 |

On translating context-free grammars into Lambek grammars SL Kuznetsov Proceedings of the Steklov Institute of Mathematics 290 (1), 63-69, 2015 | 2 | 2015 |

Lambek calculus with one division and one primitive type permitting empty antecedents SL Kuznetsov Moscow University Mathematics Bulletin 64 (2), 76-79, 2009 | 2 | 2009 |