Author:
Ågotnes Thomas,Galimullin Rustam
Abstract
AbstractPublic 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.
Publisher
Springer Science and Business Media LLC
Reference42 articles.
1. Ågotnes, T., Alechina, N., & Galimullin, R. (2022). Logics with group announcements and distributed knowledge: Completeness and expressivity. Journal of Logic, Language and Information, 31(2), 141–166.
2. Ågotnes, T., Balbiani, P., van Ditmarsch, H., & Seban, P. (2010). Group announcement logic. Journal of Applied Logic, 8(1), 62–81.
3. Ågotnes, T., & van Ditmarsch, H. (2008). Coalitions and announcements. In L. Padgham, D. C. Parkes, J. P. Müller, & S. Parsons (Eds.), Proceedings of the 7th AAMAS (pp. 673–680). IFAAMAS.
4. Ågotnes, T., van Ditmarsch, H., & French, T. (2016). The undecidability of quantified announcements. Studia Logica, 104(4), 597–640.
5. Alberucci, L., & Jäger, G. (2005). About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic, 133(1–3), 73–99.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献