2 papers
cs.LO2025
Intuitionistic modal logic LIK4 is decidable
Philippe Balbiani, Ãigdem Gencer, Tinko Tinchev
In this note, we prove that intuitionistic modal logic LIK4 is decidable.
cs.LO2025
Modal definability in Euclidean modal logics
Philippe Balbiani, Tinko Tinchev
This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such…