A Van Benthem Theorem for Modal Team Semantics
From MaRDI portal
Publication:5351963
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.
Recommendations
- Axiomatizations for propositional and modal team logic
- 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
- Decidability of predicate logics with team semantics
Cited in
(17)- A quantified coalgebraic van Benthem theorem
- Intermediate logics in the setting of team semantics
- A model-theoretic approach to descriptive general frames: the van Benthem characterization theorem
- On the complexity of linear temporal logic with team semantics
- Expressivity and Complexity of Dependence Logic
- On the succinctness of atoms of dependency
- Questions and dependency in intuitionistic logic
- Logics for propositional determinacy and independence
- Axiomatizations of team logics
- Complexity of Propositional Independence and Inclusion Logic
- Complexity of validity for propositional dependence logics
- Characterizing relative frame definability in team semantics via the universal modality
- A van Benthem theorem for fuzzy modal logic
- INQUISITIVE BISIMULATION
- scientific article; zbMATH DE number 7056226 (Why is no real title available?)
- Approximation and dependence via multiteam semantics
- 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)