In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has been changed such that nominals only partially denote states. The hybrid logic contains nominals, satisfaction operators, the downarrow binder as well as the global modality. Following this, an axiom system for the Hybrid Public Announcement Logic is presented and using reduction axioms general completeness (in the usual style of Hybrid Logic) is proved. The general completeness allows for an easy way of adding distributed knowledge. Furthermore, it turns out that distributed knowledge is definable using satisfaction operators and the downarrow binder. © 2011 Elsevier B.V.
Wáng, Y. N., & Ågotnes, T. (2011). Public announcement logic with distributed knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6953 LNAI, pp. 328–341). https://doi.org/10.1007/978-3-642-24130-7_24