The Logic of Public Announcements, Common Knowledge and Private Suspicions

dc.contributor.authorBaltag, Alexandru; Moss, Lawrence; Solecki, Slawomir
dc.date.accessioned2025-11-11T23:31:09Z
dc.date.available2025-11-11T23:31:09Z
dc.date.issued1999-11
dc.description.abstractThis paper presents a logical system in which various group-level epistemic actions are incorporated into the object language. That is, we consider the standard modeling of knowledge among a set of agents by multi-modal Kripke structures. One might want to consider actions that take place, such as announcements to groups privately, announcements with suspicious outsiders, etc. In our system, such actions correspond to additional modalities in the object language. That is, we do not add machinery on top of models (as in, e.g., Fagin et al (1995), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza (1989), Gerbrandy (1999), and Gerbrandy and Groeneveld (1997). The latter group of papers introduce a language in which one can faithfully represent all of the reasoning in examples such as the Muddy Children scenario. In that paper we find operators for updating worlds via announcements to groups of agents who are isolated from all others. We advance this by considering many more actions, and by using a more general semantics. Our logic contains the infinitary operators used in the standard modeling of common knowledge. We present a sound and complete logical system for the logic, and we study its expressive power.
dc.identifier.urihttps://hdl.handle.net/2022/34376
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR534
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titleThe Logic of Public Announcements, Common Knowledge and Private Suspicions

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR534.pdf
Size:
530.94 KB
Format:
Adobe Portable Document Format
Can’t use the file because of accessibility barriers? Contact us