26 research outputs found
Knowing Values and Public Inspection
We present a basic dynamic epistemic logic of "knowing the value". Analogous
to public announcement in standard DEL, we study "public inspection", a new
dynamic operator which updates the agents' knowledge about the values of
constants. We provide a sound and strongly complete axiomatization for the
single and multi-agent case, making use of the well-known Armstrong axioms for
dependencies in databases
Epistemic Logic with Partial Dependency Operator
In this paper, we introduce dependency modality
into epistemic logic so as to reason about
dependency relationship in Kripke models. The resulted dependence epistemic
logic possesses decent expressivity and beautiful properties. Several
interesting examples are provided, which highlight this logic's practical
usage. The logic's bisimulation is then discussed, and we give a sound and
strongly complete axiomatization for a sub-language of the logic
Weakly Aggregative Modal Logic: Characterization and Interpolation
Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic
logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation