Elementary Multimodal Logics

09/10/2018
by   Jakub Michaliszyn, et al.
0

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even if one or two of the binary relations are transitive.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset