Uniform Interpolation for Propositional and Modal Team Logics

10/12/2018
by   Giovanna D'Agostino, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset