Article

What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability

Authors:

H. van Ditmarsch,

T. de LimaAuthors Info & Claims

TARK '07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge

Pages 42 - 51

https://doi.org/10.1145/1324249.1324259

Published: 25 June 2007 Publication History

Abstract

Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: □φ expresses that φ is true after an arbitrary announcement ψ. As this includes the trivial announcement ⊤, one might as well say that □φ expresses what remains true after any announcement: it therefore corresponds to truth persistence after (definable) relativisation. The dual operation ⋄φ expresses that there is an announcement after which φ. This gives a perspective on Fitch's knowability issues: for which formulas φ does it hold that φ → ⋄Kφ? We give various semantic results, and we show completeness for a Hilbert-style axiomatisation of this logic.

References

[1]

A. Baltag, L. S. Moss, and S. Solecki. The logic of public announcements, common knowledge, and private suspicions. In I. Gilboa, editor, Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 98), pages 43--56, 1998.

Digital Library

[2]

P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, Cambridge, 2001. Cambridge Tracts in Theoretical Computer Science 53.

Digital Library

[3]

B. Brogaard and J. Salerno. Fitch's paradox of knowability. In E. N. Zalta, editor, The Stanford Encyclopedia of Philosophy. 2004. http://plato.stanford.edu/archives/sum2004/entries/fitch-paradox/.

[4]

K. Fine. Propositional quantifiers in modal logic. Theoria, 36(3):336--346, 1970.

[5]

J. D. Gerbrandy. Bisimulations on Planet Kripke. PhD thesis, University of Amsterdam, 1999. ILLC Dissertation Series DS-1999-01.

[6]

J. D. Gerbrandy and W. Groeneveld. Reasoning about information change. Journal of Logic, Language, and Information, 6:147--169, 1997.

Digital Library

[7]

R. Goldblatt. Axiomatising the Logic of Computer Programming. Springer-Verlag, 1982.

Digital Library

[8]

J. Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, NY, 1962.

[9]

T. Hoshi. The logic of communication graphs for group communication and the dynamic epistemic logic with a future operator. Philosophy Department, Stanford University, 2006.

[10]

J.-J. Ch. Meyer and W. van der Hoek. Epistemic Logic for AI and Computer Science. Cambridge Tracts in Theoretical Computer Science 41. Cambridge University Press, Cambridge, 1995.

Digital Library

[11]

J. S. Miller and L. S. Moss. The undecidability of iterated modal relativization. Studia Logica, 79(3):373--407, 2005.

[12]

G. E. Moore. A reply to my critics. In P. A. Schilpp, editor, The Philosophy of G. E. Moore, pages 535--677. Northwestern University, Evanston IL, 1942. The Library of Living Philosophers (volume 4).

[13]

J. A. Plaza. Logics of public communications. In M. L. Emrich, M. S. Pfeifer, M. Hadzikadic, and Z. W. Ras, editors, Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems: Poster Session Program, pages 201--216. Oak Ridge National Laboratory, 1989. ORNL/DSRD-24.

[14]

J. F. A. K. van Benthem. One is a lonely number: on the logic of communication. Technical report, University of Amsterdam, 2002. ILLC Research Report PP-2002-27 (material presented at the Logic Colloquium 2002).

[15]

J. F. A. K. van Benthem. What one may come to know. Analysis, 64(2):95--105, 2004.

[16]

H. P. van Ditmarsch and B. P. Kooi. The secret of my success. Synthese, 151:201--232, 2006.

[17]

H. P. van Ditmarsch, W. van der Hoek, and B. P. Kooi. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2007.

Digital Library

Cited By

Wang SSun F(2024)Knowledge graph revision in the context of unknown knowledgePLOS ONE10.1371/journal.pone.030249019:7(e0302490)Online publication date: 5-Jul-2024
https://doi.org/10.1371/journal.pone.0302490
Fan J(2023)Unknown Truths and Unknowable TruthsLogic, Rationality, and Interaction10.1007/978-3-031-45558-2_7(86-93)Online publication date: 24-Oct-2023
https://doi.org/10.1007/978-3-031-45558-2_7
Xiong ZÅgotnes T(2020)Arbitrary Propositional Network Announcement LogicDynamic Logic. New Trends and Applications10.1007/978-3-030-65840-3_17(277-293)Online publication date: 22-Dec-2020
https://doi.org/10.1007/978-3-030-65840-3_17
Show More Cited By

What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
1. Theory of computation
  1. Logic

Recommendations

Positive Announcements
Abstract
Arbitrary public announcement logic ( $APAL$ ) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public ... $^{}$ $^{}$ $^{}$ $^{}$
Arbitrary Announcements on Topological Subset Spaces
Multi-Agent Systems
Abstract
Subset space semantics for public announcement logic in the spirit of the effort modality have been proposed by Wang and Ågotnes [18] and by Bjorndahl [6]. They propose to model the public announcement modality by shrinking the epistemic range ...
Arbitrary announcements in propositional belief revision
DARe'15: Proceedings of the 2015 International Conference on Defeasible and Ampliative Reasoning - Volume 1423

Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given some fixed goal formula, it is natural to ask if ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

TARK '07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge

June 2007

296 pages

ISBN:9781450378413

DOI:10.1145/1324249

Program Chair:
Dov Samet

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

TARK '07 Paper Acceptance Rate 32 of 100 submissions, 32%;

Overall Acceptance Rate 61 of 177 submissions, 34%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
185
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang SSun F(2024)Knowledge graph revision in the context of unknown knowledgePLOS ONE10.1371/journal.pone.030249019:7(e0302490)Online publication date: 5-Jul-2024
https://doi.org/10.1371/journal.pone.0302490
Fan J(2023)Unknown Truths and Unknowable TruthsLogic, Rationality, and Interaction10.1007/978-3-031-45558-2_7(86-93)Online publication date: 24-Oct-2023
https://doi.org/10.1007/978-3-031-45558-2_7
Xiong ZÅgotnes T(2020)Arbitrary Propositional Network Announcement LogicDynamic Logic. New Trends and Applications10.1007/978-3-030-65840-3_17(277-293)Online publication date: 22-Dec-2020
https://doi.org/10.1007/978-3-030-65840-3_17
Charrier TPinchinat SSchwarzentruber F(2019)Symbolic model checking of public announcement protocolsJournal of Logic and Computation10.1093/logcom/exz023Online publication date: 10-Dec-2019
https://doi.org/10.1093/logcom/exz023
Charrier TPinchinat SSchwarzentruber F(2018)Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential FragmentDynamic Logic. New Trends and Applications10.1007/978-3-319-73579-5_9(133-152)Online publication date: 3-Jan-2018
https://doi.org/10.1007/978-3-319-73579-5_9
Hendricks VRendsvig R(2018)Hintikka’s Knowledge and Belief in FluxJaakko Hintikka on Knowledge and Game-Theoretical Semantics10.1007/978-3-319-62864-6_13(317-337)Online publication date: 2-Feb-2018
https://doi.org/10.1007/978-3-319-62864-6_13
Hunter ASchwarzentruber FTsang E(2017)Belief manipulation through propositional announcementsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171800(1109-1115)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171800
Galimullin RAlechina N(2017)Coalition and Group Announcement LogicElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.251.15251(207-220)Online publication date: 25-Jul-2017
https://doi.org/10.4204/EPTCS.251.15
Belardinelli Fvan Ditmarsch Hvan der Hoek WJonker CMarsella SThangarajah JTuyls K(2016)Second-order Propositional Announcement LogicProceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems10.5555/2936924.2937019(635-643)Online publication date: 9-May-2016
https://dl.acm.org/doi/10.5555/2936924.2937019
Charrier TSchwarzentruber FWeiss GYolum PBordini RElkind E(2015)Arbitrary Public Announcement Logic with Mental ProgramsProceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems10.5555/2772879.2773340(1471-1479)Online publication date: 4-May-2015
https://dl.acm.org/doi/10.5555/2772879.2773340
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten