- Extensions of Solovay's system S without independent sets of axiomsAPAL, 175(Issue 1, Part A):103360, January 2024. [doi]

- Complexity function and complexity of validity of modal and superintuitionistic propositional logicslogcom, 33(7):1566-1595, October 2023. [doi]
- Complexity of the Universal Theory of Residuated Ordered Groupoidsjolli, 32(3):489-510, August 2023. [doi]

- On Independent Axiomatizability of Quasi-Normal Modal LogicssLogica, 110(5):1189-1217, 2022. [doi]
- Undecidability of the Logic of Partial Quasiary Predicatesigpl, 30(3):519-533, 2022. [doi]
- Complexity of finite-variable fragments of products with non-transitive modal logicslogcom, 32(5):853-870, 2022. [doi]

- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languageslogcom, 31(2):494-522, 2021. [doi]
- Complexity of finite-variable fragments of products with Klogcom, 31(2):426-443, 2021. [doi]
- Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languageslogcom, 31(5):1266-1288, 2021. [doi]
- Correction to: Complexity of the Universal Theory of Modal AlgebrassLogica, 109(5):1175, 2021. [doi]
- Computational complexity for bounded distributive lattices with negationAPAL, 172(7):102962, 2021. [doi]

- Recursive enumerability and elementary frame definability in predicate modal logiclogcom, 30(2):549-560, 2020. [doi]
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languageslogcom, 30(7):1305-1329, 2020. [doi]
- Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languagesaiml 2020: 523-539
- Complexity of the Universal Theory of Modal AlgebrassLogica, 108(2):221-237, 2020. [doi]

- A general method for proving decidability of intuitionistic modal logicsjapll, 4(3):219-230, 2006. [doi]