Reduction axioms for epistemic actions

&

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.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Reduction axioms for epistemic actions. Kooi, Barteld & van Benthem, Johan - unknown
Common Knowledge in Update Logics.Johan van Benthem - unknown
Common knowledge in update logics.Jan van Eijck - unknown
Reducing dynamic epistemic logic to pdl by program transformation.Jan van Eijck - unknown
Logics of Communication and Change. van Benthem, Johan, van Eijck, Jan & Kooi, Barteld - unknown
Expressivity and completeness for public update logics via reduction axioms.Barteld Kooi - 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.
Comments on 'modal fixed point logic and changing models'.Jan van Eijck - unknown
Games in Dynamic-Epistemic Logic.Johan van Benthem - unknown
Dynamic epistemic modelling.Jan van Eijck - unknown
Modelling Epistemic Updates with Functional Programming.Jan van Eijck - unknown
Inference, Promotion, and the Dynamics of Awareness.Johan van Benthem - unknown
Extending probabilistic dynamic epistemic logic.Joshua Sack - 2009 - Synthese 169 (2):241 - 257.
Modelling the epistemics of communication with functional programming.Jan van Eijck - unknown

Analytics

Added to PP
2011-01-21

Downloads
45 (#352,535)

6 months
5 (#632,816)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Johan Van Benthem
University of Amsterdam
Barteld Kooi
University of Groningen

Citations of this work

Expressivity and completeness for public update logics via reduction axioms.Barteld Kooi - 2007 - Journal of Applied Non-Classical Logics 17 (2):231-253.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references