Uniform interpolation for propositional and modal team logics

DOI10.1093/LOGCOM/EXZ006MaRDI QIDQ5213395zbMATH OpenOpenAlexFDO

Authors Giovanna D'Agostino

Publication date 3 February 2020

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.05395

zbMATH Keywords

bisimulation quantifiersdependence logicsteam semanticsuniform interpolation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Quantifier elimination, model completeness, and related topics (03C10) Interpolation, preservation, definability (03C40)

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.

Recommendations

• Uniform interpolation and propositional quantifiers in modal logics
• -programs, uniform interpolation and bisimulation quantifiers for modal logics
• scientific article; zbMATH DE number 922620
• Uniform interpolation in coalgebraic modal logic
• Uniform interpolation for monotone modal logic

Cited in

(5)

• Propositional union closed team logics
• Axiomatizations of team logics
• Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points
• Axiomatizing modal inclusion logic and its variants
• State-based modal logics for free choice

This page was built for publication: Uniform interpolation for propositional and modal team logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213395)