DeepAI AI Chat
Log In Sign Up

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
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...
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...
11/05/2021

Learning Formulas in Finite Variable Logics

We consider grammar-restricted exact learning of formulas and terms in f...
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...
03/05/2018

Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction

The aim of this paper is to introduce a new framework for defining abduc...
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...
01/07/2022

TOWER-Complete Problems in Contraction-Free Substructural Logics

We investigate the computational complexity of a family of substructural...