Abstract
The problem of restricted interpolation and definability in normal extensions of modal logic S4 is investigated. We specify necessary conditions for the restricted interpolation property IPR in the systems under consideration, and prove that there exist only finitely many logics possessing IPR or the projective Beth property PB2. These logics are all residually finite and recognizable over S4. As a consequence, the restricted interpolation problem and the projective Beth property are decidable over S4.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
