{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T07:11:26Z","timestamp":1792393886122,"version":"4.4.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T00:00:00Z","timestamp":1678233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Public 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<jats:italic>existence<\/jats:italic>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\u2019t 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.<\/jats:p>","DOI":"10.1007\/s10458-023-09601-0","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T20:34:51Z","timestamp":1679862891000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantifying over information change with common knowledge"],"prefix":"10.1007","volume":"37","author":[{"given":"Thomas","family":"\u00c5gotnes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rustam","family":"Galimullin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"2","key":"9601_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10849-022-09355-0","volume":"31","author":"T \u00c5gotnes","year":"2022","unstructured":"\u00c5gotnes, 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\u2013166.","journal-title":"Journal of Logic, Language and Information"},{"issue":"1","key":"9601_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jal.2008.12.002","volume":"8","author":"T \u00c5gotnes","year":"2010","unstructured":"\u00c5gotnes, T., Balbiani, P., van Ditmarsch, H., & Seban, P. (2010). Group announcement logic. Journal of Applied Logic, 8(1), 62\u201381.","journal-title":"Journal of Applied Logic"},{"key":"9601_CR3","unstructured":"\u00c5gotnes, T., & van Ditmarsch, H. (2008). Coalitions and announcements. In L. Padgham, D. C. Parkes, J. P. M\u00fcller, & S. Parsons (Eds.), Proceedings of the 7th AAMAS (pp. 673\u2013680). IFAAMAS."},{"issue":"4","key":"9601_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11225-016-9657-0","volume":"104","author":"T \u00c5gotnes","year":"2016","unstructured":"\u00c5gotnes, T., van Ditmarsch, H., & French, T. (2016). The undecidability of quantified announcements. Studia Logica, 104(4), 597\u2013640.","journal-title":"Studia Logica"},{"issue":"1\u20133","key":"9601_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.apal.2004.10.004","volume":"133","author":"L Alberucci","year":"2005","unstructured":"Alberucci, L., & J\u00e4ger, G. (2005). About cut elimination for logics of common knowledge. Annals of Pure and Applied Logic, 133(1\u20133), 73\u201399.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"4","key":"9601_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10849-021-09339-6","volume":"30","author":"N Alechina","year":"2021","unstructured":"Alechina, N., van Ditmarsch, H., Galimullin, R., & Wang, T. (2021). Verification and strategy synthesis for coalition announcement logic. Journal of Logic, Language and Information, 30(4), 671\u2013700.","journal-title":"Journal of Logic, Language and Information"},{"key":"9601_CR7","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T. A., & Kupferman, O. (2002). Alternating-time temporal logic. Journal of the ACM, 49, 672\u2013713.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9601_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/11663081.2015.1011489","volume":"25","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P. (2015). Putting right the wording and the proof of the truth lemma for APAL. Journal of Applied Non-Classical Logics, 25(1), 2\u201319.","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"3","key":"9601_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S1755020308080210","volume":"1","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., & de Lima, T. (2008). Knowable\u2019 as \u2018known after an announcement. Review of Symbolic Logic, 1(3), 305\u2013334.","journal-title":"Review of Symbolic Logic"},{"issue":"2","key":"9601_CR10","first-page":"65","volume":"8","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P., & van Ditmarsch, H. (2015). A simple proof of the completeness of APAL. Studies in Logic, 8(2), 65\u201378.","journal-title":"Studies in Logic"},{"key":"9601_CR11","unstructured":"Baltag, A., Moss, L. S. & Solecki, S. (1998). The logic of public announcements, common knowledge, and private suspicions. In I. Gilboa (Ed.), Proceedings of the 7th TARK (pp. 43\u201356), Morgan Kaufmann."},{"key":"9601_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ic.2014.07.013","volume":"239","author":"L Bozzelli","year":"2014","unstructured":"Bozzelli, L., van Ditmarsch, H., French, T., Hales, J., & Pinchinat, S. (2014). Refinement modal logic. Information and Computation, 239, 303\u2013339.","journal-title":"Information and Computation"},{"key":"9601_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995). Reasoning about knowledge. New York: The MIT Press."},{"key":"9601_CR14","unstructured":"French, T., Galimullin, R., van Ditmarsch, H., & Alechina, N. (2019). Groups versus coalitions: On the relative expressivity of GAL and CAL. In E. Elkind, M. Veloso, N. Agmon, & M. E. Taylor (Eds.), Proceedings of the 18th AAMAS (pp. 953\u2013961). IFAAMAS."},{"key":"9601_CR15","unstructured":"Galimullin, R. (2019). Coalition announcements. PhD thesis, University of Nottingham, UK."},{"issue":"3","key":"9601_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10849-020-09327-2","volume":"30","author":"R Galimullin","year":"2021","unstructured":"Galimullin, R. (2021). Coalition and relativised group announcement logic. Journal of Logic, Language and Information, 30(3), 451\u2013489.","journal-title":"Journal of Logic, Language and Information"},{"key":"9601_CR17","unstructured":"Galimullin, R., & \u00c5gotnes, T. (2021). Quantified announcements and common knowledge. In U. Endriss, A. Now\u00e9, F. Dignum, & A. Lomuscio (Eds.), Proceedings of the 20th AAMAS. IFAAMAS (pp. 528\u2013536)."},{"key":"9601_CR18","doi-asserted-by":"crossref","unstructured":"Galimullin, R., \u00c5gotnes, T., & Alechina, N. (2019). Group announcement logic with distributed knowledge. In P. Blackburn, E. Lorini, & M. Guo (Eds.), Proceedings of the 7th LORI. LNCS (Vol. 11813, pp. 98\u2013111). Springer.","DOI":"10.1007\/978-3-662-60292-8_8"},{"key":"9601_CR19","unstructured":"Goldblatt, R. (1982). Axiomatising the logic of computer programming. LNCS (Vol. 130). Springer."},{"key":"9601_CR20","doi-asserted-by":"crossref","unstructured":"Goranko, V., & Otto, M. (2007). Model theory of modal logic. In P. Blackburn, J. van Benthem, & F. Wolter (Eds.), Handbook of modal logic of studies in logic and practical reasoning (Vol. 3, pp. 249\u2013329). Elsevier.","DOI":"10.1016\/S1570-2464(07)80008-5"},{"key":"9601_CR21","doi-asserted-by":"crossref","unstructured":"Hales, J. (2013). Arbitrary action model logic and action model synthesis. In Proceedings of the 28th LICS (pp. 253\u2013262). IEEE Computer Society.","DOI":"10.1109\/LICS.2013.31"},{"key":"9601_CR22","unstructured":"Herzig, A., & Perrotin, E. (2020). On the axiomatisation of common knowledge. In N. Olivetti, R. Verbrugge, S. Negri, & G. Sandu (Eds.), Proceedings of the 13th AiML (pp. 309\u2013328). College Publications."},{"key":"9601_CR23","volume-title":"Knowledge and belief","author":"J Hintikka","year":"1962","unstructured":"Hintikka, J. (1962). Knowledge and belief. Ithaca: Cornell University Press."},{"key":"9601_CR24","unstructured":"Holliday, W. H. & Icard, T. F. III. (2010). Moorean phenomena in epistemic logic. In L. D. Beklemishev, V. Goranko, & V. B. Shehtman (Eds.), Proceedings of the 8th AiML (pp. 178\u2013199). College Publications."},{"key":"9601_CR25","doi-asserted-by":"crossref","unstructured":"Kuijer, L. B. (2017). Arbitrary arrow update logic with common knowledge is neither RE nor co-RE. In J. Lang (Ed.), Proceedings of the 16th TARK EPTCS (Vol. 251, pp. 373\u2013381).","DOI":"10.4204\/EPTCS.251.27"},{"key":"9601_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Q., & Liu, Y. (2018). Multi-agent epistemic planning with common knowledge. In J. Lang (Ed.), Proceedings of the 27th IJCAI (pp. 1912\u20131920).","DOI":"10.24963\/ijcai.2018\/264"},{"key":"9601_CR27","volume-title":"Osborne and Ariel Rubinstein. A course in game theory","author":"J Martin","year":"1994","unstructured":"Martin, J. (1994). Osborne and Ariel Rubinstein. A course in game theory. New York: MIT Press."},{"issue":"1","key":"9601_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M Pauly","year":"2002","unstructured":"Pauly, M. (2002). A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1), 149\u2013166.","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"9601_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M Pauly","year":"2003","unstructured":"Pauly, M., & Parikh, R. (2003). Game logic: An overview. Studia Logica, 75(2), 165\u2013182.","journal-title":"Studia Logica"},{"issue":"2","key":"9601_CR30","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","volume":"158","author":"J Plaza","year":"2007","unstructured":"Plaza, J. (2007). Logics of public communications. Synthese, 158(2), 165\u2013179.","journal-title":"Synthese"},{"issue":"11","key":"9601_CR31","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ic.2006.04.006","volume":"204","author":"J van Benthem","year":"2006","unstructured":"van Benthem, J., van Eijck, J., & Kooi, B. (2006). Logics of communication and change. Information and Computation, 204(11), 1620\u20131662.","journal-title":"Information and Computation"},{"key":"9601_CR32","unstructured":"van Ditmarsch, H. (2021). To be announced. CoRR."},{"issue":"6","key":"9601_CR33","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1093\/logcom\/exs058","volume":"24","author":"H van Ditmarsch","year":"2014","unstructured":"van Ditmarsch, H., Fern\u00e1ndez-Duque, D., & van der Hoek, W. (2014). On the definability of simulation and bisimulation in epistemic logic. Journal of Logic and Computation, 24(6), 1209\u20131227.","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"9601_CR34","first-page":"20:1","volume":"18","author":"H van Ditmarsch","year":"2022","unstructured":"van Ditmarsch, H., & French, T. (2022). Quantifying over Boolean announcements. Logical Methods in Computer Science, 18(1), 20:1-20:22.","journal-title":"Logical Methods in Computer Science"},{"key":"9601_CR35","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., French, T. & Galimullin, R. (2021). No finite model property for logics of quantified announcements. In J. Y. Halpern, & A. Perea (Eds.), Proceedings of the 18th TARK (Vol. 335, pp. 129\u2013138).","DOI":"10.4204\/EPTCS.335.12"},{"key":"9601_CR36","unstructured":"van Ditmarsch, H., French, T., & Galimullin, R. (2022). Satisfiability of quantified Boolean announcements. CoRR. arXiv:2206.00903"},{"issue":"3","key":"9601_CR37","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s11225-020-09922-1","volume":"109","author":"H van Ditmarsch","year":"2021","unstructured":"van Ditmarsch, H., French, T., & Hales, J. (2021). Positive announcements. Studia Logica, 109(3), 639\u2013681.","journal-title":"Studia Logica"},{"issue":"2","key":"9601_CR38","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11229-005-3384-9","volume":"151","author":"H van Ditmarsch","year":"2006","unstructured":"van Ditmarsch, H., & Kooi, B. (2006). The secret of my success. Synthese, 151(2), 201\u2013232.","journal-title":"Synthese"},{"key":"9601_CR39","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., & Kooi, B. (2008). Dynamic epistemic logic (Vol. 337). Springer: Synthese Library.","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"9601_CR40","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.artint.2016.10.003","volume":"242","author":"H van Ditmarsch","year":"2017","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B., & Kuijer, L. B. (2017). Arbitrary arrow update logic. Artificial Intelligence, 242, 80\u2013106.","journal-title":"Artificial Intelligence"},{"key":"9601_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2020.104544","volume":"275","author":"H van Ditmarsch","year":"2020","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B., & Kuijer, L. B. (2020). Arrow update synthesis. Information and Computation, 275, 1.","journal-title":"Information and Computation"},{"key":"9601_CR42","unstructured":"Witt, C. S., Foerster, J. N., Farquhar, G., Torr, P. H. S., Boehmer, W., & Whiteson, S. (2019). Multi-agent common knowledge reinforcement learning. In H. M. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. B. Fox, & R. Garnett (Eds.), Proceedings of the 32nd NeurIPS (pp. 9924\u20139935)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-023-09601-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09601-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T01:26:21Z","timestamp":1729128381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-023-09601-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,8]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9601"],"URL":"https:\/\/doi.org\/10.1007\/s10458-023-09601-0","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,8]]},"assertion":[{"value":"18 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"19"}}