A New Modal Framework for Epistemic Logic
share
Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃ x ϕ, e.g., knowing how to achieve ϕ roughly means that there exists a way such that you know that it is a way to ensure that ϕ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we propose a very general and powerful framework based on quantifier-free predicate language extended by a new modality ^x, which packs exactly ∃ x together. We show that the resulting language, though much more expressive, shares many good properties of the basic propositional modal logic over arbitrary models, such as finite-tree-model property and van Benthem-like characterization w.r.t.first-order modal logic. We axiomatize the logic over S5 frames with intuitive axioms to capture the interaction between ^x and know-that operator in an epistemic setting.
READ FULL TEXT
