Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power
Journal article, Peer reviewed
Published version
![Thumbnail](/bora-xmlui/bitstream/handle/11250/2998251/%c3%85gotnes2022_Article_LogicsWithGroupAnnouncementsAn.pdf.jpg?sequence=7&isAllowed=y)
Åpne
Permanent lenke
https://hdl.handle.net/11250/2998251Utgivelsesdato
2022Metadata
Vis full innførselSamlinger
Originalversjon
Journal of Logic, Language and Information. 2022, 31, 141-166. 10.1007/s10849-022-09355-0Sammendrag
Public announcement logic (PAL) is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic (GAL), allows quantification over (possibly joint) announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making such announcements. It seems intuitive that this notion of coalitional ability should be closely related to the notion of distributed knowledge, the implicit knowledge of a group. Thus, we study the extension of GAL with distributed knowledge, and in particular possible interaction properties between GAL operators and distributed knowledge. The perhaps surprising result is that, in fact, there are no interaction properties, contrary to intuition. We make this claim precise by providing a sound and complete axiomatisation of GAL with distributed knowledge. We also consider several natural variants of GAL with distributed knowledge, as well as some other related logic, and compare their expressive power.