{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:32Z","timestamp":1760203052902},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:00:00Z","timestamp":1669248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Group announcement logic (GAL) and coalition announcement logic (CAL) allow us to reason about whether it is possible for groups and coalitions of agents to achieve their desired epistemic goals through truthful public communication. The difference between groups and coalitions in such a context is that the latter make their announcements in the presence of possible adversarial counter-announcements. As epistemic goals may involve some agents remaining ignorant, counter-announcements may preclude coalitions from reaching their goals. We study the relative expressivity of GAL and CAL and provide some results involving their more well-known sibling APAL. We also discuss how the presence of memory alters the relationship between groups and coalition.<\/jats:p>","DOI":"10.1093\/logcom\/exac082","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T10:19:25Z","timestamp":1669285165000},"page":"1122-1151","source":"Crossref","is-referenced-by-count":0,"title":["The Expressivity of Quantified Group Announcements"],"prefix":"10.1093","volume":"33","author":[{"given":"Natasha","family":"Alechina","sequence":"first","affiliation":[{"name":"Department of Information and Computing Sciences , Utrecht University, Utrecht, 3584 CC, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Ditmarsch","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Open University, Heerlen, 6401 DL, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"French","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering , The University of Western Australia, Perth, 6009, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rustam","family":"Galimullin","sequence":"additional","affiliation":[{"name":"Department of Information Science and Media Studies , University of Bergen, Bergen, 5020, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"key":"2023090708034911700_ref1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10849-022-09355-0","article-title":"Logics with group announcements and distributed knowledge: Completeness and expressive power","volume":"31","author":"\u00c5gotnes","year":"2022","journal-title":"Journal of Logic, Language and Information"},{"key":"2023090708034911700_ref2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.jal.2008.12.002","article-title":"Group announcement logic","volume":"8","author":"\u00c5gotnes","year":"2010","journal-title":"Journal of Applied Logic"},{"key":"2023090708034911700_ref3","first-page":"673","article-title":"Coalitions and announcements","volume-title":"Proceedings of the 7th AAMAS","author":"\u00c5gotnes","year":"2008"},{"key":"2023090708034911700_ref4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s11225-016-9657-0","article-title":"The undecidability of quantified announcements","volume":"104","author":"\u00c5gotnes","year":"2016","journal-title":"Studia Logica"},{"key":"2023090708034911700_ref5","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","article-title":"Alternating-time temporal logic","volume":"49","author":"Alur","year":"2002","journal-title":"Journal of the ACM"},{"key":"2023090708034911700_ref6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1017\/S1755020308080210","article-title":"Knowable\u2019 as \u2018known after an announcement","volume":"1","author":"Balbiani","year":"2008","journal-title":"Review of Symbolic Logic"},{"key":"2023090708034911700_ref7","first-page":"58","article-title":"Before announcement","volume-title":"Proceedings of the 11th AiML","author":"Balbiani","year":"2016"},{"key":"2023090708034911700_ref8","first-page":"43","article-title":"The logic of public announcements, common knowledge, and private suspicions","volume-title":"Proceedings of the 7th TARK","author":"Baltag","year":"1998"},{"key":"2023090708034911700_ref9","first-page":"106","article-title":"APAL with memory is better","volume-title":"Proceedings of the 25th WoLLIC","author":"Baltag","year":"2018"},{"key":"2023090708034911700_ref10","article-title":"Arbitrary public announcement logic with memory","author":"Baltag","year":"2022","journal-title":"Journal of Philosophical Logic"},{"key":"2023090708034911700_ref11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9674.001.0001","volume-title":"Logic in Games","author":"van Benthem","year":"2014"},{"key":"2023090708034911700_ref12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10992-008-9099-x","article-title":"Merging frameworks for interaction","volume":"38","author":"van Benthem","year":"2009","journal-title":"Journal of Philosophical Logic"},{"key":"2023090708034911700_ref13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"Blackburn","year":"2001"},{"key":"2023090708034911700_ref14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ic.2014.07.013","article-title":"Refinement modal logic","volume":"239","author":"Bozzelli","year":"2014","journal-title":"Information and Computation"},{"key":"2023090708034911700_ref15","first-page":"89","article-title":"Quantifying notes","volume-title":"Proceedings of the 19th WoLLIC","author":"van Ditmarsch","year":"2012"},{"key":"2023090708034911700_ref16","article-title":"To be announced","author":"van Ditmarsch","year":"2022"},{"key":"2023090708034911700_ref17","first-page":"20:1","article-title":"Quantifying over boolean announcements","volume":"18","author":"van Ditmarsch","year":"2022","journal-title":"Logical Methods in Computer Science"},{"key":"2023090708034911700_ref18","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s11225-020-09922-1","article-title":"Positive announcements","volume":"109","author":"van Ditmarsch","year":"2021","journal-title":"Studia Logica"},{"key":"2023090708034911700_ref19","first-page":"120","article-title":"Expressivity of some versions of APAL","volume-title":"Proceedings of the 3rd DaL\u00ed","author":"van Ditmarsch","year":"2020"},{"key":"2023090708034911700_ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-5839-4","volume-title":"Dynamic Epistemic Logic","author":"van Ditmarsch","year":"2008"},{"key":"2023090708034911700_ref21","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1093\/jigpal\/jzr038","article-title":"Connecting dynamic epistemic and temporal epistemic logics","volume":"21","author":"van Ditmarsch","year":"2013","journal-title":"Logic Journal of the IGPL"},{"key":"2023090708034911700_ref22","first-page":"953","article-title":"Groups versus coalitions: on the relative expressivity of GAL and CAL","volume-title":"Proceedings of the 18th AAMAS","author":"French","year":"2019"},{"key":"2023090708034911700_ref23","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10849-020-09327-2","article-title":"Coalition and relativised group announcement logic","volume":"30","author":"Galimullin","year":"2021","journal-title":"Journal of Logic, Language and Information"},{"key":"2023090708034911700_ref24","first-page":"528","article-title":"Quantified announcements and common knowledge","volume-title":"Proceedings of the 20th AAMAS","author":"Galimullin","year":"2021"},{"key":"2023090708034911700_ref25","first-page":"207","article-title":"Coalition and group announcement logic","volume-title":"Proceedings of the 16th TARK","author":"Galimullin","year":"2017"},{"key":"2023090708034911700_ref26","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S1570-2464(07)80008-5","article-title":"Model theory of modal logic","volume-title":"Handbook of Modal Logic","author":"Goranko","year":"2007"},{"key":"2023090708034911700_ref27","volume-title":"Knowledge and Belief","author":"Hintikka","year":"1962"},{"key":"2023090708034911700_ref28","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/1082473.1082497","article-title":"A logic for strategic reasoning","volume-title":"Proceedings of the 4th AAMAS","author":"van der Hoek","year":"2005"},{"key":"2023090708034911700_ref29","doi-asserted-by":"crossref","DOI":"10.1093\/0195134613.001.0001","volume-title":"Agency and Deontic Logic","author":"Horty","year":"2001"},{"key":"2023090708034911700_ref30","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3166\/jancl.17.231-253","article-title":"Expressivity and completeness for public update logics via reduction axioms","volume":"17","author":"Kooi","year":"2007","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2023090708034911700_ref31","first-page":"261","article-title":"Dynamic epistemic logic","volume-title":"Handbook of Epistemic Logic","author":"Moss","year":"2015"},{"key":"2023090708034911700_ref32","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511844072","volume-title":"Epistemic Game Theory","author":"Perea","year":"2012"},{"key":"2023090708034911700_ref33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","article-title":"Logics of public communications","volume":"158","author":"Plaza","year":"2007","journal-title":"Synthese"},{"key":"2023090708034911700_ref34","volume-title":"Adding Temporal Logic to Dynamic Epistemic Logic","author":"Sack","year":"2007"},{"key":"2023090708034911700_ref35","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10849-007-9054-1","article-title":"Temporal languages for epistemic programs","volume":"17","author":"Sack","year":"2008","journal-title":"Journal of Logic, Language and Information"},{"key":"2023090708034911700_ref36","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1016\/j.apal.2010.04.011","article-title":"Logic for update products and steps into the past","volume":"161","author":"Sack","year":"2010","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/33\/6\/1122\/51402253\/exac082.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/33\/6\/1122\/51402253\/exac082.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T08:06:04Z","timestamp":1694073964000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/33\/6\/1122\/6833331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,24]]},"references-count":36,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,11,24]]},"published-print":{"date-parts":[[2023,8,24]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exac082","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,9]]},"published":{"date-parts":[[2022,11,24]]}}}