{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:05:58Z","timestamp":1766084758817,"version":"3.48.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Log. Univers."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11787-025-00393-3","type":"journal-article","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T08:39:26Z","timestamp":1762245566000},"page":"451-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Arbitrary Announcements in Social Networks: A Finitary Proof System"],"prefix":"10.1007","volume":"19","author":[{"given":"Zhu","family":"Rui","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"issue":"1","key":"393_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/11663081.2015.1011489","volume":"25","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P.: Putting right the wording and the proof of the truth lemma for apal. J. Appl. Non-Classical Logics 25(1), 2\u201319 (2015)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"393_CR2","first-page":"65","volume":"8","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P., van Ditmarsch, H.: A simple proof of the completeness of apal. Studies in Logic 8, 65\u201378 (2015)","journal-title":"Studies in Logic"},{"key":"393_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11225-018-9804-x","volume":"107","author":"A Baltag","year":"2019","unstructured":"Baltag, A., Christoff, Z., Rendsvig, R.K., Smets, S.: Dynamic epistemic logics of diffusion and prediction in social networks. Stud. Logica. 107, 489\u2013531 (2019)","journal-title":"Stud. Logica."},{"key":"393_CR4","doi-asserted-by":"crossref","unstructured":"Baltag,A., \u00d6zg\u00fcn,A., Sandoval,A.\u00a0L.\u00a0V.: Arbitrary public announcement logic with memory. Journal of Philosophical Logic, pages 1\u201358, 2022","DOI":"10.1007\/s10992-022-09664-6"},{"issue":"1","key":"393_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jal.2014.11.011","volume":"13","author":"Z Christoff","year":"2015","unstructured":"Christoff, Z., Hansen, J.U.: A logic for diffusion in social networks. J. Appl. Log. 13(1), 48\u201377 (2015)","journal-title":"J. Appl. Log."},{"key":"393_CR6","first-page":"23","volume":"7","author":"T French","year":"2008","unstructured":"French, T., van Ditmarsch, H.: Undecidability for arbitrary public announcement logic. Advances in Modal Logic 7, 23\u201342 (2008)","journal-title":"Advances in Modal Logic"},{"key":"393_CR7","doi-asserted-by":"publisher","first-page":"260","DOI":"10.4204\/EPTCS.379.21","volume":"379","author":"R Galimullin","year":"2023","unstructured":"Galimullin, R., Kuijer, L.B.: Satisfiability of arbitrary public announcement logic with common knowledge is $$\\sigma ^{1}_{1}$$-hard. Electronic Proceedings in Theoretical Computer Science 379, 260\u2013271 (2023)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"393_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008222603071","volume":"6","author":"J Gerbrandy","year":"1997","unstructured":"Gerbrandy, J., Groeneveld, W.: Reasoning about information change. J. Logic Lang. Inform. 6, 147\u2013169 (1997)","journal-title":"J. Logic Lang. Inform."},{"key":"393_CR9","unstructured":"Goldblatt, R.: Axiomatising the Logic of Computer Programming. Springer-Verlag, Berlin, Heidelberg (1982)"},{"key":"393_CR10","unstructured":"Kuijer,B.: Unsoundness of r. Online, 2015. https:\/\/personal.us.es\/hvd\/APAL_counterexample.pdf"},{"issue":"2","key":"393_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","volume":"158","author":"J Plaza","year":"2007","unstructured":"Plaza, J.: Logics of public communications. Synthese 158(2), 165\u2013179 (2007)","journal-title":"Synthese"},{"key":"393_CR12","doi-asserted-by":"crossref","unstructured":"Seligman,J., Liu,F., Girard,P.: Logic in the community. In Logic and Its Applications, pages 178\u2013188. Springer, 2011","DOI":"10.1007\/978-3-642-18026-2_15"},{"key":"393_CR13","first-page":"229","volume":"2013","author":"J Seligman","year":"2013","unstructured":"Seligman, J., Liu, F., Girard, P.: Facebook and the epistemic logic of friendship. TARK 2013, 229\u2013238 (2013)","journal-title":"TARK"},{"key":"393_CR14","doi-asserted-by":"crossref","unstructured":"van Ditmarsch,H., French,T.: Quantifying over boolean announcements. Logical Methods in Computer Science, 18:20:1\u201320:22, 2022","DOI":"10.46298\/lmcs-18(1:20)2022"},{"key":"393_CR15","doi-asserted-by":"crossref","unstructured":"van Ditmarsch,H., van Der\u00a0Hoek,W., Kooi,B.: Dynamic epistemic logic, volume 337. Springer Science & Business Media, 2007","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"393_CR16","doi-asserted-by":"crossref","unstructured":"Xiong,Z., \u00c5gotnes,T.: Arbitrary propositional network announcement logic. In International Workshop on Dynamic Logic, pages 277\u2013293. Springer, 2020","DOI":"10.1007\/978-3-030-65840-3_17"},{"key":"393_CR17","doi-asserted-by":"crossref","unstructured":"Xiong,Z., \u00c5gotnes,T., Seligman,J., Zhu,R.: Towards a logic of tweeting. In International Workshop on Logic, Rationality and Interaction, pages 49\u201364. Springer, 2017","DOI":"10.1007\/978-3-662-55665-8_4"},{"key":"393_CR18","doi-asserted-by":"crossref","unstructured":"Zhu,R.: A finitary axiomatization of arbitrary social announcement logic. In V.\u00a0Goranko, C.\u00a0Shi, and W.\u00a0Wang, editors, Logic, Rationality, and Interaction, pages 195\u2013212. Springer Nature Singapore, 2026","DOI":"10.1007\/978-981-95-2481-5_14"}],"container-title":["Logica Universalis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-025-00393-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11787-025-00393-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-025-00393-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:56:53Z","timestamp":1766066213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11787-025-00393-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s11787-025-00393-3","relation":{},"ISSN":["1661-8297","1661-8300"],"issn-type":[{"type":"print","value":"1661-8297"},{"type":"electronic","value":"1661-8300"}],"subject":[],"published":{"date-parts":[[2025,11,4]]},"assertion":[{"value":"15 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}