2017/07/27 by Ivano Ciardelli, Martin Otto
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.251.11
published as EPTCS 251, 2017, pp. 151-166 · In Proceedings TARK 2017, arXiv:1707.08250
arxiv created 2017/07/27 · arxiv updated 2017/07/28
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic, and characterise inquisitive modal logic as the bisimulation invariant fragments of first-order logic over various classes of two-sorted relational structures. These results crucially require non-classical methods in studying bisimulations and first-order expressiveness over non-elementary classes.