Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)

07/16/2020
by   Bartosz Bednarczyk, et al.
0

We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static ambient logic, whereas ML(*) contains the separating conjunction * from separation logic. Though both operators are second-order in nature, we show that ML(|) is as expressive as the graded modal logic GML (on finite trees) whereas ML(*) lies strictly between ML and GML. Moreover, we establish that the satisfiability problem for ML(*) is Tower-complete, whereas for ML(|) is (only) AExpPol-complete. As a by-product, we solve several open problems related to sister logics, such as static ambient logic, modal separation logic, and second-order modal logic on finite trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2022

Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability

We study the computational complexity of model checking and satisfiabili...
research
10/11/2019

Internal Calculi for Separation Logics

We present a general approach to axiomatise separation logics with heapl...
research
09/15/2017

On the Complexity of Modal Team Logic and Two-Variable Team Logic

We study modal team logic MTL and the dependence-free fragment FO^2[ ] o...
research
09/21/2022

Complexity through Translations for Modal Logic with Recursion

This paper studies the complexity of classical modal logics and of their...
research
06/29/2019

Recursive axiomatizations from separation properties

We define a fragment of monadic infinitary second-order logic correspond...
research
04/13/2018

On the Complexity of Team Logic and its Two-Variable Fragment

We study the logic FO( ), the extension of first-order logic with team s...
research
12/30/2021

Expressive power versus decidability

In this note we prove that there exists no fragment of first-order logic...

Please sign up or login with your details

Forgot password? Click here to reset