2 papers
cs.LO2025
Modelling of logical systems by means of their fragments
Mikhail Rybakov
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually poly…
math.LO2025
Logics with the axiom of convergence: complexity with a small number of variables in the language (extended version)
M. Rybakov, M. Shcherbakov
It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragmen…