A Van Benthem Theorem for Modal Team Semantics
From MaRDI portal
Publication:5351963
DOI10.4230/LIPICS.CSL.2015.277zbMATH Open1373.03024arXiv1410.6648OpenAlexW1765233549MaRDI QIDQ5351963FDOQ5351963
Authors: Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
Publication date: 31 August 2017
Abstract: The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic MDL and team semantics. We show that modal team logic MTL, extending MDL by classical negation, captures exactly the FO-definable bisimulation invariant properties of Kripke structures and teams. We also compare the expressive power of MTL to most of the variants and extensions of MDL recently studied in the area.
Full work available at URL: https://arxiv.org/abs/1410.6648
Recommendations
- Axiomatizations for propositional and modal team logic
- Characterizing frame definability in team semantics via the universal modality
- The power of the filtration technique for modal logics with team semantics
- Canonical models and the complexity of modal team logic
- scientific article; zbMATH DE number 7056226
- A van Benthem theorem for fuzzy modal logic
- Logics with multiteam semantics
- Axiomatizations of team logics
- Characterizing frame definability in team semantics via the universal modality
- Decidability of predicate logics with team semantics
independenceteam semanticsmodal logicdependence logicbisimulationexpressivityinclusiongeneralized dependence atom
Cited In (16)
- Expressivity and Complexity of Dependence Logic
- Title not available (Why is that?)
- INQUISITIVE BISIMULATION
- A quantified coalgebraic van Benthem theorem
- LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE
- Characterising modal definability of team-based logics via the universal modality
- Questions and dependency in intuitionistic logic
- Title not available (Why is that?)
- Intermediate logics in the setting of team semantics
- On the complexity of linear temporal logic with team semantics
- Axiomatizations of team logics
- Complexity of Propositional Independence and Inclusion Logic
- Approximation and dependence via multiteam semantics
- Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
- Complexity of validity for propositional dependence logics
- Canonical Models and the Complexity of Modal Team Logic
This page was built for publication: A Van Benthem Theorem for Modal Team Semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351963)