AI Chat AI Image Generator AI Video Text to Speech

Uniform Interpolation for Propositional and Modal Team Logics

10/12/2018

∙

by Giovanna D'Agostino, et al.

∙

∙

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of the so called "existential bisimulation quantifiers", where the existence of a certain set is made modulo bisimulation. As a consequence, we prove that these fragments enjoy the Uniform Interpolation Property.

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...

0 Martin Lück, et al. ∙

research

∙ 10/07/2021

Uniform Guarded Fragments

In this paper we prove that the uniform one-dimensional guarded fragment...

0 Reijo Jaakkola, et al. ∙

research

∙ 03/08/2023

Definitions and (Uniform) Interpolants in First-Order Modal Logic

We first consider two decidable fragments of quantified modal logic 𝖲5: ...

0 Agi Kurucz, et al. ∙

research

∙ 05/19/2023

State-based Modal Logics for Free Choice

We study the mathematical properties of bilateral state-based modal logi...

0 Maria Aloni, et al. ∙

research

∙ 03/06/2019

On the Succinctness of Atoms of Dependency

Propositional team logic is the propositional analog to first-order team...

0 Martin Lück, et al. ∙

research

∙ 03/29/2018

Weakly Aggregative Modal Logic: Characterization and Interpolation

In this paper, we study the model theoretical aspects of Weakly Aggregat...

0 Jixin Liu, et al. ∙

research

∙ 12/17/2010

Interpolation in Equilibrium Logic and Answer Set Programming: the Propositional Case

Interpolation is an important property of classical and many non classic...

0 Dov Gabbay, et al. ∙