{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:16:47Z","timestamp":1760203007923,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["313360 EPS"],"award-info":[{"award-number":["313360 EPS"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11225-020-09922-1","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T11:03:01Z","timestamp":1602068581000},"page":"639-681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Positive Announcements"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-8687","authenticated-orcid":false,"given":"Hans","family":"van Ditmarsch","sequence":"first","affiliation":[]},{"given":"Tim","family":"French","sequence":"additional","affiliation":[]},{"given":"James","family":"Hales","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"key":"9922_CR1","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., P.\u00a0Balbiani, H.\u00a0van Ditmarsch, and P.\u00a0Seban, Group announcement logic, Journal of Applied Logic 8:62\u201381, 2010.","journal-title":"Journal of Applied Logic"},{"issue":"4","key":"9922_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11225-016-9657-0","volume":"104","author":"T \u00c5gotnes","year":"2016","unstructured":"\u00c5gotnes, T., H.\u00a0van Ditmarsch, and T.\u00a0French, The undecidability of quantified announcements, Studia Logica 104(4):597\u2013640, 2016.","journal-title":"Studia Logica"},{"issue":"3","key":"9922_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., I.\u00a0N\u00e9meti, and J.\u00a0van Benthem, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic 27(3):217\u2013274, 1998.","journal-title":"Journal of Philosophical Logic"},{"issue":"1","key":"9922_CR4","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, Journal of Applied Non-Classical Logics 25(1):2\u201319, 2015.","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"3","key":"9922_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S1755020308080210","volume":"1","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., A.\u00a0Baltag, H.\u00a0van Ditmarsch, A.\u00a0Herzig, T.\u00a0Hoshi, and T.\u00a0D. Lima, \u2018Knowable\u2019 as \u2018known after an announcement\u2019, Review of Symbolic Logic 1(3):305\u2013334, 2008.","journal-title":"Review of Symbolic Logic"},{"issue":"1","key":"9922_CR6","first-page":"65","volume":"8","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P., and H.\u00a0van Ditmarsch, A simple proof of the completeness of APAL, Studies in Logic 8(1):65\u201378, 2015.","journal-title":"Studies in Logic"},{"key":"9922_CR7","doi-asserted-by":"crossref","unstructured":"Blackburn, P., M.\u00a0de Rijke, and Y.\u00a0Venema, Modal Logic, Cambridge University Press, Cambridge, 2001. Cambridge Tracts in Theoretical Computer Science 53.","DOI":"10.1017\/CBO9781107050884"},{"key":"9922_CR8","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., H.\u00a0van Ditmarsch, T.\u00a0French, J.\u00a0Hales, and S.\u00a0Pinchinat, Refinement modal logic, Information and Computation 239:303\u2013339, 2014.","journal-title":"Information and Computation"},{"key":"9922_CR9","doi-asserted-by":"crossref","unstructured":"Browne, M., E. Clarke, and O. Gr\u00fcmberg, Characterizing Kripke structures in temporal logic, in H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, (eds.), TAPSOFT \u201987, LNCS 249, Springer, 1987, pp. 256\u2013270.","DOI":"10.1007\/3-540-17660-8_60"},{"key":"9922_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A Chandra","year":"1981","unstructured":"Chandra, A., D.\u00a0Kozen, and L.\u00a0Stockmeyer, Alternation, Journal of the ACM 28:114\u201333, 1981.","journal-title":"Journal of the ACM"},{"key":"9922_CR11","unstructured":"Charrier, T., and F.\u00a0Schwarzentruber, Arbitrary public announcement logic with mental programs, in Proc. of AAMAS, ACM, 2015, pp. 1471\u20131479."},{"issue":"1","key":"9922_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D., The dining cryptographers problem: Unconditional sender and recipient untraceability, J. Cryptol. 1(1):65\u201375, 1988.","journal-title":"J. Cryptol."},{"key":"9922_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2013.05.010","volume":"495","author":"A Cord\u00f3n-Franco","year":"2013","unstructured":"Cord\u00f3n-Franco, A., H.\u00a0van Ditmarsch, D.\u00a0Fern\u00e1ndez-Duque, and F.\u00a0Soler-Toscano, A colouring protocol for the generalized russian cards problem, Theor. Comput. Sci. 495:81\u201395, 2013.","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9922_CR14","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G d\u2019Agostino","year":"2000","unstructured":"D\u2019Agostino, G., and M.\u00a0Hollenberg, Logical questions concerning the $$\\mu $$-calculus: Interpolation, Lyndon and Los-Tarski, Journal of Symbolic Logic 65(1):310\u2013332, 2000.","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"9922_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF00190803","volume":"9","author":"M Fischer","year":"1996","unstructured":"Fischer, M., and R.\u00a0Wright, Bounds on secret key exchange using a random deal of cards, Journal of Cryptology 9(2):71\u201399, 1996.","journal-title":"Journal of Cryptology"},{"key":"9922_CR16","unstructured":"French, T., Bisimulation quantified modal logics: Decidability, in G. Governatori, I. Hodkinson, and Y. Venema, (eds.), Proc. of 6th AiML, College Publications, 2006, pp. 147\u2013166."},{"key":"9922_CR17","unstructured":"French, T., R.\u00a0Galimullin, H.\u00a0van Ditmarsch, and N.\u00a0Alechina, Groups versus coalitions: On the relative expressivity of GAL and CAL, in Proc. of the 18th AAMAS, 2019, pp. 953\u2013961."},{"key":"9922_CR18","unstructured":"French, T., and H.\u00a0van Ditmarsch, Undecidability for arbitrary public announcement logic, in Advances in Modal Logic 7, College Publications, London, 2008, pp. 23\u201342."},{"key":"9922_CR19","unstructured":"Galimullin, R., Coalition announcements, Ph.D. thesis, University of Nottingham, UK, 2019."},{"key":"9922_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008222603071","volume":"6","author":"J Gerbrandy","year":"1997","unstructured":"Gerbrandy, J., and W.\u00a0Groeneveld, Reasoning about information change, Journal of Logic, Language, and Information 6:147\u2013169, 1997.","journal-title":"Journal of Logic, Language, and Information"},{"key":"9922_CR21","doi-asserted-by":"crossref","unstructured":"Hales, J., Arbitrary action model logic and action model synthesis, in Proc. of 28th LICS. IEEE, 2013, pp. 253\u2013262.","DOI":"10.1109\/LICS.2013.31"},{"key":"9922_CR22","unstructured":"Hales, J., T.\u00a0French, and R.\u00a0Davies, Refinement quantified logics of knowledge and belief for multiple agents, in Advances in Modal Logic 9, College Publications, 2012, pp. 317\u2013338."},{"issue":"3","key":"9922_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/146637.146638","volume":"39","author":"J Halpern","year":"1992","unstructured":"Halpern, J., and L.\u00a0Zuck, A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols, J. ACM 39(3):449\u2013478, 1992.","journal-title":"J. ACM"},{"issue":"1","key":"9922_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., and R.\u00a0Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32(1):137\u2013161, 1985.","journal-title":"J. ACM"},{"key":"9922_CR25","unstructured":"Plaza, J., Logics of public communications, in Proc. of the 4th ISMIS, Oak Ridge National Laboratory, 1989, pp. 201\u2013216."},{"issue":"1","key":"9922_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1111\/1467-8586.00140","volume":"54","author":"F Stulp","year":"2002","unstructured":"Stulp, F., and R.\u00a0Verbrugge, A knowledge-based algorithm for the internet transmission control protocol (TCP), Bulletin of Economic Research 54(1):69\u201394, 2002.","journal-title":"Bulletin of Economic Research"},{"key":"9922_CR27","unstructured":"Swan, M., Blockchain: Blueprint for a New Economy, O\u2019Reilly, Sebastopol, 2015."},{"key":"9922_CR28","unstructured":"van Benthem, J., Dynamic odds and ends. Technical report, University of Amsterdam, 1998. ILLC Research Report ML-1998-08."},{"key":"9922_CR29","doi-asserted-by":"crossref","unstructured":"van Benthem, J., One is a lonely number: on the logic of communication, in Logic colloquium 2002. Lecture Notes in Logic, Vol. 27. A.K. Peters, 2006, pp. 96\u2013129.","DOI":"10.1017\/9781316755723.006"},{"key":"9922_CR30","unstructured":"van\u00a0der Meyden, R., and K.\u00a0Su, Symbolic model checking the knowledge of the dining cryptographers, in Proc. of the 17th IEEE workshop on Computer Security Foundations, 2004, pp. 280\u2013291."},{"key":"9922_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"H van Ditmarsch","year":"2003","unstructured":"van Ditmarsch, H., The Russian cards problem, Studia Logica 75:31\u201362, 2003.","journal-title":"Studia Logica"},{"issue":"6","key":"9922_CR32","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1093\/logcom\/exs058","volume":"24","author":"H van Ditmarsch","year":"2014","unstructured":"van Ditmarsch, H., D.\u00a0Fern\u00e1ndez-Duque, and W.\u00a0van\u00a0der Hoek, On the definability of simulation and bisimulation in epistemic logic, J. Log. Comput. 24(6):1209\u20131227, 2014.","journal-title":"J. Log. Comput."},{"key":"9922_CR33","unstructured":"van Ditmarsch, H., and T.\u00a0French, Quantifying over boolean announcements. https:\/\/arxiv.org\/abs\/1712.05310, 2017."},{"key":"9922_CR34","unstructured":"van Ditmarsch, H., T.\u00a0French, and J.\u00a0Hales, Decidability of arbitrary positive announcement logic, Manuscript, 2018."},{"key":"9922_CR35","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., and B.\u00a0Kooi, The secret of my success, Synthese 151:201\u2013232, 2006.","journal-title":"Synthese"},{"key":"9922_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.07.018","volume":"693","author":"H van Ditmarsch","year":"2017","unstructured":"van Ditmarsch, H., W.\u00a0van\u00a0der Hoek, and L.\u00a0Kuijer, The undecidability of arbitrary arrow update logic, Theor. Comput. Sci. 693:1\u201312, 2017.","journal-title":"Theor. Comput. Sci."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-020-09922-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11225-020-09922-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-020-09922-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T23:22:07Z","timestamp":1633562527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11225-020-09922-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,7]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9922"],"URL":"https:\/\/doi.org\/10.1007\/s11225-020-09922-1","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2020,10,7]]},"assertion":[{"value":"5 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}