Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Logical Dynamics of Some Speech Acts That Affect Obligations and Preferences.Tomoyuki Yamada - 2008 - Synthese 165 (2):295 - 315.
Public Announcement Logic with Distributed Knowledge: Expressivity, Completeness and Complexity.Yì N. Wáng & Thomas Ågotnes - 2013 - Synthese (S1):1-28.
Similar books and articles
Expressivity and Completeness for Public Update Logics Via Reduction Axioms. Kooi, Barteld - 2007 - Journal of Applied Non-Classical Logics 17 (2):231-253.
Dynamic Logic for Belief Revision.Johan van Benthem - 2007 - Journal of Applied Non-Classical Logics 17 (2):129-155.
Added to index2011-01-21
Total downloads13 ( #353,548 of 2,169,997 )
Recent downloads (6 months)2 ( #186,188 of 2,169,997 )
How can I increase my downloads?