|Abstract||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)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Kooi, Barteld (2007). Expressivity and Completeness for Public Update Logics Via Reduction Axioms. Journal of Applied Non-Classical Logics 17 (2):231-253.
Johan van Benthem (2007). Dynamic Logic for Belief Revision. Journal of Applied Non-Classical Logics 17 (2):129-155.
Joshua Sack (2009). Extending Probabilistic Dynamic Epistemic Logic. Synthese 169 (2):241 - 257.
Added to index2011-01-21
Total downloads6 ( #154,629 of 722,749 )
Recent downloads (6 months)1 ( #60,247 of 722,749 )
How can I increase my downloads?