David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
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)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Frank Wolter (2000). First Order Common Knowledge Logics. Studia Logica 65 (2):249-271.
Bryan Renne (2008). Public and Private Communication Are Different: Results on Relative Expressivity. Synthese 165 (2):225 - 245.
Cedric Paternotte (2011). Being Realistic About Common Knowledge: A Lewisian Approach. Synthese 183 (2):249-276.
Kooi, Barteld (2007). Expressivity and Completeness for Public Update Logics Via Reduction Axioms. Journal of Applied Non-Classical Logics 17 (2):231-253.
Luc Lismont & Philippe Mongin (2003). Strong Completeness Theorems for Weak Logics of Common Belief. Journal of Philosophical Logic 32 (2):115-137.
Zachary Ernst (2011). What Is Common Knowledge? Episteme 8 (3):209-226.
Mamoru Kaneko, Takashi Nagashima, Nobu-Yuki Suzuki & Yoshihito Tanaka (2002). A Map of Common Knowledge Logics. Studia Logica 71 (1):57-86.
Added to index2010-11-21
Total downloads9 ( #126,509 of 1,004,658 )
Recent downloads (6 months)1 ( #64,617 of 1,004,658 )
How can I increase my downloads?