Common knowledge in update logics
| Abstract | Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions regarding common knowledge express the essence of what communication achieves. We present some methods that yield so-called reduction axioms for common knowledge. We investigate the expressive power of public announcement logic with relativized common knowledge, and present reduction axioms that give a detailed account of the dynamics of common knowledge in some major communication types. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesCedric Paternotte (2011). Being Realistic About Common Knowledge: A Lewisian Approach. Synthese 183 (2):249-276.
Bryan Renne (2008). Public and Private Communication Are Different: Results on Relative Expressivity. Synthese 165 (2):225 - 245.
Frank Wolter (2000). First Order Common Knowledge Logics. Studia Logica 65 (2):249-271.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,673 of 549,117 )Recent downloads (6 months)1 ( #63,361 of 549,117 )How can I increase my downloads? |
My notes
Discussion
