2 citations · 2 across the 5 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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…
cs.LO2020★ 2 cited
About the unification types of the modal logics determined by classes of deterministic frames
Philippe Balbiani, Çiğdem Gencer, Maryam Rostamigiv +1
The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a uni…