No Finite Model Property for Logics of Quantified Announcements

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.

[1]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

[2]  Rustam Galimullin,et al.  Coalition announcements , 2019 .

[3]  Tim French,et al.  Positive Announcements , 2018, Stud Logica.

[4]  Hans van Ditmarsch,et al.  Quantifying Notes Revisited , 2020, ArXiv.

[5]  D. Gabbay.  On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part I , 1971 .

[6]  Ágnes Kurucz,et al.  On axiomatising products of Kripke frames , 2000, Journal of Symbolic Logic.

[7]  Jan A. Plaza,et al.  Logics of public communications , 2007, Synthese.

[8]  Rustam Galimullin,et al.  Coalition and Relativised Group Announcement Logic , 2021, J. Log. Lang. Inf..

[9]  Andreas Herzig,et al.  ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ , 2008, The Review of Symbolic Logic.

[10]  Marcus Kracht,et al.  A solution to a problem of urquhart , 1991, J. Philos. Log..

[11]  Zoran Ognjanovic.  Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity , 2006, J. Log. Comput..

[12]  Valentin Goranko,et al.  Model theory of modal logic , 2007, Handbook of Modal Logic.

[13]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[14]  Thomas Bolander,et al.  Epistemic planning for single- and multi-agent systems , 2011, J. Appl. Non Class. Logics.

[15]  Alasdair Urquhart,et al.  Decidability and the finite model property , 1981, J. Philos. Log..

[16]  Philippe Balbiani,et al.  Group announcement logic , 2010, J. Appl. Log..

[17]  Dov M. Gabbay,et al.  Products of Modal Logics, Part 1 , 1998, Log. J. IGPL.

[18]  Tim French,et al.  Quantifying over boolean announcements , 2017, Log. Methods Comput. Sci..

[19]  Dov M. Gabbay.  On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part II , 1971 .

[20]  Hans van Ditmarsch,et al.  Coalitions and announcements , 2008, AAMAS.

[21]  Hans van Ditmarsch,et al.  The Undecidability of Quantified Announcements , 2016, Stud Logica.