Preprint
Sep 2026
Non-elementary modal logics, assuming P $\neq$ NP
It is proved that if a finitely axiomatizable modal logic L is elementary, then the validity problem for L, which asks whether a given finite Kripke frame validates L, is in P, which allows us to transfer complexity results in graph theory to the study of elementarity of modal logics.
Tenyo Takahashi
· 0 citations