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
International audienceWe introduce a modal separation logic MSL whose models are memory states from ...
We study the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boo...
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics...
The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-...
Modal Team Logic (MTL) extends Väänänen's Modal Dependence Logic (MDL) by Boolean negation. Its sati...
We study modal team logic MTL, the team-semantical extension of classical modal logic closed under B...
The computational properties of modal and propositional dependence logics have been extensively stud...
We study modal team logic MTL, the team-semantical extension of classical modal logic closed under B...
The modal characterization theorem by J. van Benthem characterizes classical modal logic as the bisi...
Publication in the series REPORTS IN INFORMATION SCIENCES, no 6, of SCHOOL OF INFORMATION SCIENCES, ...
We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes proposi...
Modal dependence logic (MDL) was introduced recently by Väänänen. It enhances the basic modal lan...
We introduce a modal separation logic MSL whose models are memory states from separation logic and t...
We survey different notions of bisimulation equivalence that provide flexible and powerful concepts ...
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epi...
International audienceWe introduce a modal separation logic MSL whose models are memory states from ...
We study the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boo...
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics...
The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-...
Modal Team Logic (MTL) extends Väänänen's Modal Dependence Logic (MDL) by Boolean negation. Its sati...
We study modal team logic MTL, the team-semantical extension of classical modal logic closed under B...
The computational properties of modal and propositional dependence logics have been extensively stud...
We study modal team logic MTL, the team-semantical extension of classical modal logic closed under B...
The modal characterization theorem by J. van Benthem characterizes classical modal logic as the bisi...
Publication in the series REPORTS IN INFORMATION SCIENCES, no 6, of SCHOOL OF INFORMATION SCIENCES, ...
We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes proposi...
Modal dependence logic (MDL) was introduced recently by Väänänen. It enhances the basic modal lan...
We introduce a modal separation logic MSL whose models are memory states from separation logic and t...
We survey different notions of bisimulation equivalence that provide flexible and powerful concepts ...
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epi...
International audienceWe introduce a modal separation logic MSL whose models are memory states from ...
We study the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boo...
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics...