Finite model property of inquisitive modal logic via selection

Inquisitive logic is a generalization of classical logic that can express questions. The language of inquisitive logic is obtained by extending the language of classical propositional logic with a new connective, the inquisitive disjunction. Similarly, inquisitive modal logic, InqML, is a generalization of standard modal logic with ⊞ as the basic modal operator. In this talk, we will introduce the selection method for inquisitive modal logic. For a given satisfiable formula, we will show that the formula is also satisfiable in a finite tree-like model. From this we conclude that InqML has the finite model property, i.e., every satisfiable formula is satisfiable in a finite model.