A Van Benthem Theorem for Modal Team Semantics

DOI10.4230/LIPIcs.CSL.2015.277zbMath1373.03024arXiv1410.6648OpenAlexW1765233549MaRDI QIDQ5351963

Heribert Vollmer, Henning Schnoor, Julian Müller, Juha Kontinen

Publication date: 31 August 2017

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

zbMATH Keywords

independencemodal logicbisimulationexpressivitydependence logicteam semanticsinclusiongeneralized dependence atom

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (14)

Axiomatizations of team logics ⋮ Unnamed Item ⋮ Questions and dependency in intuitionistic logic ⋮ Complexity of Propositional Independence and Inclusion Logic ⋮ On the complexity of linear temporal logic with team semantics ⋮ A quantified coalgebraic van Benthem theorem ⋮ Complexity of validity for propositional dependence logics ⋮ Characterising modal definability of team-based logics via the universal modality ⋮ Approximation and dependence via multiteam semantics ⋮ LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE ⋮ Expressivity and Complexity of Dependence Logic ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Characterizing Relative Frame Definability in Team Semantics via the Universal Modality ⋮ INQUISITIVE BISIMULATION

This page was built for publication: A Van Benthem Theorem for Modal Team Semantics