3 papers
math.LO2025
Superintuitionistic predicate logics of linear frames: undecidability with two individual variables
Mikhail Rybakov
The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic defined by…
math.LO2025
Recursive inseparability of classical theories of a binary predicate and non-classical logics of a unary predicate
Mikhail Rybakov
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of vari…
math.LO2023
Tiling problems and complexity of logics (extended version)
M. Rybakov, D. Serova
We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined…