Quantifying over information change with common knowledge

Abstract

Public announcement logic (PAL) extends multi-agent epistemic logic with dynamic operators modelling the effects of public communication. Allowing quantification over public announcements lets us reason about the existence of an announcement that reaches a certain epistemic goal. Two notable examples of logics of quantified announcements are arbitrary public announcement logic (APAL) and group announcement logic (GAL). While the notion of common knowledge plays an important role in PAL, and in particular in characterisations of epistemic states that an agent or a group of agents might make come about by performing public announcements, extensions of APAL and GAL with common knowledge still haven’t been studied in detail. That is what we do in this paper. In particular, we consider both conservative extensions, where the semantics of the quantifiers is not changed, as well as extensions where the scope of quantification also includes common knowledge formulas. We compare the expressivity of these extensions relative to each other and other connected logics, and provide sound and complete axiomatisations. Finally, we show how the completeness results can be used for other logics with quantification over information change.

Dynamic Epistemic Logic for Budget-Constrained Agents

“…Apart from that, we also plan to extend our framework and allow quantification over queries in the spirit of logics of quantified announcements, e.g. APAL [15], GAL [3], CAL [5,37], and their versions with group knowledge [2,4]. Another important direction for future work is to consider more complicated communicative actions (e.g.…”