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 , 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 , which packs exactly 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 and know-that operator in an
epistemic setting.

生成讲解博客的中文版本

生成AI智能校验的中文版本