{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:04:31Z","timestamp":1766084671645,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Various extensions of public announcement logic have been proposed with\nquantification over announcements. The best-known extension is called arbitrary\npublic announcement logic, APAL. It contains a primitive language construct Box\nphi intuitively expressing that \"after every public announcement of a formula,\nformula phi is true\". The logic APAL is undecidable and it has an infinitary\naxiomatization. Now consider restricting the APAL quantification to public\nannouncements of Boolean formulas only, such that Box phi intuitively expresses\nthat \"after every public announcement of a Boolean formula, formula phi is\ntrue\". This logic can therefore called Boolean arbitrary public announcement\nlogic, BAPAL. The logic BAPAL is the subject of this work. Unlike APAL it has a\nfinitary axiomatization. Also, BAPAL is not at least as expressive as APAL. A\nfurther claim that BAPAL is decidable is deferred to a companion paper.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:20)2022","type":"journal-article","created":{"date-parts":[[2022,1,23]],"date-time":"2022-01-23T22:46:46Z","timestamp":1642978006000},"source":"Crossref","is-referenced-by-count":4,"title":["Quantifying over Boolean announcements"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Hans","family":"van Ditmarsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0748-8040","authenticated-orcid":false,"given":"Tim","family":"French","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,1,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8991\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8991\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:16:59Z","timestamp":1687292219000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/4147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:20)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"1712.05310v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1712.05310v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1712.05310v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1712.05310v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1712.05310","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1712.05310","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"article-number":"4147"}}