Elementary Multimodal Logics
classification
💻 cs.LO
keywords
logicsevenframesmultimodalbimodalbinaryclassesdefinable
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.