No finite model property for logics of quantified announcements

Hans van Ditmarsch, Tim French, Rustam Galimullin

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)129-138
Number of pages10
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume335
DOIs
Publication statusPublished - 22 Jun 2021
Event18th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2021 - Beijing, China
Duration: 25 Jun 202127 Jun 2021

Fingerprint

Dive into the research topics of 'No finite model property for logics of quantified announcements'. Together they form a unique fingerprint.

Cite this