No Finite Model Property for Logics of Quantified Announcements

Hans van Ditmarsch
Tim French
Rustam Galimullin

Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announcement that achieves some certain epistemic goal. Depending on the type of the quantification, we get different formalisms, the most known of which are arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). It has been an open question whether the logics have the finite model property, and in the paper we answer the question negatively. We also discuss how this result is connected to other open questions in the field.

In Joseph Halpern and Andrés Perea: Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2021), Beijing, China, June 25-27, 2021, Electronic Proceedings in Theoretical Computer Science 335, pp. 129–138.
Published: 22nd June 2021.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: