{"id":"https://openalex.org/W2774118623","doi":"https://doi.org/10.46298/lmcs-18(1:20)2022","title":"Quantifying over Boolean announcements","display_name":"Quantifying over Boolean announcements","publication_year":2022,"publication_date":"2022-01-21","ids":{"openalex":"https://openalex.org/W2774118623","doi":"https://doi.org/10.46298/lmcs-18(1:20)2022","mag":"2774118623"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-18(1:20)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:20)2022","pdf_url":"https://lmcs.episciences.org/8991/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/8991/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046182700","display_name":"Hans van Ditmarsch","orcid":"https://orcid.org/0000-0003-4526-8687"},"institutions":[{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans van Ditmarsch","raw_affiliation_strings":["Open University, Heerlen, the Netherlands","Open University of The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Open University, Heerlen, the Netherlands","institution_ids":["https://openalex.org/I7876267"]},{"raw_affiliation_string":"Open University of The Netherlands","institution_ids":["https://openalex.org/I7876267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tim French","raw_affiliation_strings":["University of Western Australia, Perth, Australia","University of Western Australia"],"raw_orcid":"https://orcid.org/0000-0002-0748-8040","affiliations":[{"raw_affiliation_string":"University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]},{"raw_affiliation_string":"University of Western Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046182700"],"corresponding_institution_ids":["https://openalex.org/I7876267"],"apc_list":null,"apc_paid":null,"fwci":0.6936,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.73802241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"Volume 18, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7325120568275452},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6633846759796143},{"id":"https://openalex.org/keywords/finitary","display_name":"Finitary","score":0.6333456039428711},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5597046613693237},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.48219695687294006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46134263277053833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45678552985191345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4233381152153015},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3004528880119324}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7325120568275452},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6633846759796143},{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.6333456039428711},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5597046613693237},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.48219695687294006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46134263277053833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45678552985191345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4233381152153015},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3004528880119324}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.46298/lmcs-18(1:20)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:20)2022","pdf_url":"https://lmcs.episciences.org/8991/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/17a4501a-e5f3-4fe6-8ef0-c2da2caed482","is_oa":true,"landing_page_url":"https://admin.research-repository.uwa.edu.au/en/publications/17a4501a-e5f3-4fe6-8ef0-c2da2caed482","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Van Ditmarsch, H & French, T 2022, 'Quantifying over Boolean announcements', Logical Methods in Computer Science, vol. 18, no. 1. https://doi.org/10.46298/LMCS-18(1:20)2022","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1712.05310","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.05310","pdf_url":"https://arxiv.org/pdf/1712.05310","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2774118623","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1712.05310.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-04244758v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04244758","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://lmcs.episciences.org/8991","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:845674686fcc4432989ac920df848a74","is_oa":true,"landing_page_url":"https://doaj.org/article/845674686fcc4432989ac920df848a74","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/17a4501a-e5f3-4fe6-8ef0-c2da2caed482","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85123514837&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402492","display_name":"UWA Profiles and Research Repository (UWA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Van Ditmarsch , H & French , T 2022 , ' Quantifying over Boolean announcements ' , Logical Methods in Computer Science , vol. 18 , no. 1 . https://doi.org/10.46298/LMCS-18(1:20)2022","raw_type":"article"},{"id":"pmh:oai:research.ou.nl:publications/cc7e7245-7336-463c-8484-2b89348ddd63","is_oa":true,"landing_page_url":"https://research.ou.nl/en/publications/cc7e7245-7336-463c-8484-2b89348ddd63","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Van Ditmarsch, H & French, T 2022, 'QUANTIFYING OVER BOOLEAN ANNOUNCEMENTS', Logical Methods in Computer Science, vol. 18, no. 1, 20. https://doi.org/10.46298/LMCS-18(1:20)2022","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.1712.05310","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1712.05310","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.46298/lmcs-18(1:20)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:20)2022","pdf_url":"https://lmcs.episciences.org/8991/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2774118623.pdf","grobid_xml":"https://content.openalex.org/works/W2774118623.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W87282152","https://openalex.org/W102721760","https://openalex.org/W1533142698","https://openalex.org/W1587154603","https://openalex.org/W1979480136","https://openalex.org/W1990841069","https://openalex.org/W1998176101","https://openalex.org/W2041435496","https://openalex.org/W2054048243","https://openalex.org/W2073060670","https://openalex.org/W2096959337","https://openalex.org/W2112397136","https://openalex.org/W2126992147","https://openalex.org/W2128888217","https://openalex.org/W2278173579","https://openalex.org/W2521480233","https://openalex.org/W2572755814","https://openalex.org/W2736662121","https://openalex.org/W2737343996","https://openalex.org/W2796131438","https://openalex.org/W2809933061","https://openalex.org/W2962857339","https://openalex.org/W2963075967","https://openalex.org/W3142833148","https://openalex.org/W6668897744","https://openalex.org/W6753144026"],"related_works":["https://openalex.org/W2155318727","https://openalex.org/W2096959337","https://openalex.org/W3142833148","https://openalex.org/W2156325353","https://openalex.org/W2126992147","https://openalex.org/W1546767004","https://openalex.org/W1930344573","https://openalex.org/W2181947715","https://openalex.org/W1511401088","https://openalex.org/W2085184180","https://openalex.org/W93385149","https://openalex.org/W2168555998","https://openalex.org/W1486447085","https://openalex.org/W1966944960","https://openalex.org/W1560000883","https://openalex.org/W2058212458","https://openalex.org/W1505779129","https://openalex.org/W32330612","https://openalex.org/W112106578","https://openalex.org/W2105943700"],"abstract_inverted_index":{"Various":[0],"extensions":[1],"of":[2,38,65,80,105],"public":[3,19,36,63,78,95],"announcement":[4,20,37,79,96],"logic":[5,46,89,100],"have":[6],"been":[7],"proposed":[8],"with":[9],"quantification":[10,61],"over":[11],"announcements.":[12],"The":[13,45,99],"best-known":[14],"extension":[15],"is":[16,43,48,86,102,117,130,132],"called":[17,92],"arbitrary":[18,94],"logic,":[21,97],"APAL.":[22,124],"It":[23],"contains":[24],"a":[25,39,81,112,135],"primitive":[26],"language":[27],"construct":[28],"Box":[29,71],"phi":[30,42,72,85],"intuitively":[31,73],"expressing":[32],"that":[33,70,75,128],"\"after":[34,76],"every":[35,77],"formula,":[40,83],"formula":[41,84],"true\".":[44,87],"APAL":[47,60,109],"undecidable":[49],"and":[50],"it":[51,110],"has":[52,111],"an":[53],"infinitary":[54],"axiomatization.":[55,114],"Now":[56],"consider":[57],"restricting":[58],"the":[59,103],"to":[62,134],"announcements":[64],"Boolean":[66,82,93],"formulas":[67],"only,":[68],"such":[69],"expresses":[74],"This":[88],"can":[90],"therefore":[91],"BAPAL.":[98],"BAPAL":[101,116,129],"subject":[104],"this":[106],"work.":[107],"Unlike":[108],"finitary":[113],"Also,":[115],"not":[118],"at":[119],"least":[120],"as":[121,123],"expressive":[122],"A":[125],"further":[126],"claim":[127],"decidable":[131],"deferred":[133],"companion":[136],"paper.":[137]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}