Public Announcement Logic with Distributed Knowledge

Abstract While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( \({\cal PAL}\) ) with distributed knowledge, in particular their expressivity and axiomatisations. \(\cal PAL\) extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on \(\cal PACD\), the result of adding both common and distributed knowledge to \(\cal PAL\), which is more expressive than each of its component logics. Our main result is a completeness result for \(\cal PACD\). The axiomatisation is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with S 5 knowledge, distributed knowledge, common knowledge and public announcements at the same time.

Authors

• Yì N. Wáng
• Thomas Ågotnes

Keywords

No keywords are indexed for this paper.