Yury Savateev
Yury Savateev
Verified email at hse.ru
TitleCited byYear
Product-free Lambek calculus is NP-complete
Y Savateev
International Symposium on Logical Foundations of Computer Science, 380-394, 2009
272009
Unidirectional Lambek grammars in polynomial time
Y Savateev
Theory of Computing Systems 46 (4), 662-672, 2010
122010
Lambek grammars with one division are decidable in polynomial time
Y Savateev
International Computer Science Symposium in Russia, 273-282, 2008
122008
Product-free Lambek calculus is NP-complete
Y Savateev
Annals of pure and applied logic 163 (7), 775-788, 2012
112012
The derivability problem for Lambek calculus with one division
Y Savateev
Artificial Intelligence Preprint Series 56, 2006
52006
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
Y Savateev, D Shamkanov
International Workshop on Logic, Language, Information, and Computation, 321-335, 2017
32017
Non-Well-Founded Proofs for the Grzegorczyk Modal Logic
Y Savateev, D Shamkanov
arXiv preprint arXiv:1804.00955, 2018
12018
Proof internalization in generalized Frege systems for classical logic
Y Savateev
Annals of pure and applied logic 165 (1), 340-356, 2014
12014
Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs
Y Savateev, D Shamkanov
International Workshop on Logic, Language, Information, and Computation, 569-583, 2019
2019
The Symposium on Logical Foundations of Computer Science 2009
A Nerode, J Worthington, K Tadaki, Y Savateev, W Moczydłowski, ...
Elsevier, 2012
2012
TR-2008012: Product-Free Lambek Calculus is NP-Complete
Y Savateev
2008
Non-well-founded proofs for modal Grzegorczyk logic
Y Savateev, D Shamkanov
Sequent Calculus for Justifications
Y Savateev
TABLEAUX 2011 Workshops, Tutorials, and Short Papers, 74, 0
The system can't perform the operation now. Try again later.
Articles 1–13