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
research
05/25/2021

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

We study the algorithmic properties of first-order monomodal logics of f...
research
10/22/2018

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

We show that Branching-time temporal logics CTL and CTL*, as well as Alt...
research
07/26/2022

Canonicity in power and modal logics of finite achronal width

We develop a method for showing that various modal logics that are valid...
research
11/05/2021

Learning Formulas in Finite Variable Logics

We consider grammar-restricted exact learning of formulas and terms in f...
research
02/14/2019

Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership

We study two extensions of FO2[<], first-order logic interpreted in fini...
research
05/31/2002

Connectives in Quantum and other Cumulative Logics

Cumulative logics are studied in an abstract setting, i.e., without conn...
research
05/27/2009

Automating Quantified Multimodal Logics in Simple Type Theory -- A Case Study

In a case study we investigate whether off the shelf higher-order theore...

Please sign up or login with your details

Forgot password? Click here to reset