Uniform Interpolation for Propositional and Modal Team Logics

TL;DR

This paper proves that certain fragments of Full Modal Team Logic allow the elimination of existential bisimulation quantifiers, leading to the Uniform Interpolation Property, which enhances the understanding of dependence phenomena in modal logic.

Contribution

It demonstrates that most known fragments of Full Modal Team Logic admit uniform interpolation by eliminating existential bisimulation quantifiers.

Findings

Fragments enjoy the Uniform Interpolation Property

Existential bisimulation quantifiers can be eliminated

Enhances understanding of dependence in modal logic

Abstract

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.