Yuri Gurevich, Andreas Blass, “Primal Logic of Information”, ACM Trans. Comput. Logic, 2025
A. L. Semenov, M. A. Babenko, A. Ya. Belov, N. K. Vereshchagin, M. E. Vishnikin, E. E. Zolin, V. N. Krupski, S. L. Kuznetsov, V. A. Lyubetskii, A. A. Onoprienko, M. R. Pentus, S. F. Soprunov, A. A. Sorokin, V. B. Shehtman, T. L. Yavorskaya, “Chair of Mathematical Logic and Theory of Algorithms”, Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 80:1 (2025), 23–33
R Ramanujam, Vaishnavi Sundararajan, S P Suresh, “The complexity of disjunction in intuitionistic logic”, Journal of Logic and Computation, 30:1 (2020), 421
Ori Lahav, Yoni Zohar, “Pure Sequent Calculi”, ACM Trans. Comput. Logic, 20:3 (2019), 1
Ori Lahav, Yoni Zohar, “From the subformula property to cut-admissibility in propositional sequent calculi”, Journal of Logic and Computation, 28:6 (2018), 1341
Ori Lahav, Yoni Zohar, Lecture Notes in Computer Science, 10501, Automated Reasoning with Analytic Tableaux and Related Methods, 2017, 65
G. Mints, SH. Steinert-Threlkeld, “ADC method of proof search for intuitionistic propositional natural deduction”, J Logic Computation, 26:1 (2016), 395
R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh, Lecture Notes in Computer Science, 9537, Logical Foundations of Computer Science, 2016, 349
Chen Bo, Sui Yuefei, Cao Cungen, 2015 11th International Conference on Semantics, Knowledge and Grids (SKG), 2015, 162
Marco Magirius, Martin Mundhenk, Raphaela Palenta, “The complexity of primal logic with disjunction”, Information Processing Letters, 115:5 (2015), 536