Skip to main content

How Arbitrary Are Arbitrary Public Announcements?

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8607))

Abstract

Public announcements are used in dynamic epistemic logic to model certain kinds of information change. A formula \(\left<\psi\right>\varphi \) represents the statement that after ψ is publicly announced ϕ will be the case.

Sometimes we want to reason about whether it is possible for ϕ to become true after some announcement. In order to do this an arbitrary public announcement operator \(\lozenge\) can be added to an epistemic logic with public announcements. Ideally a formula \(\lozenge \varphi \) would hold if and only if there is a formula ψ such that \(\left<\psi\right>\varphi \). However, in order to avoid circularity the \(\lozenge\) operator can only quantify over those ψ that are \(\lozenge\)-free. So \(\lozenge \varphi \) holds if and only if there is a \(\lozenge\)-free ψ such that \(\left<\psi\right>\varphi \).

As a result it does not follow immediately from the definition that \(\left<\psi\right>\varphi \) implies \(\lozenge \varphi \) if ψ contains a \(\lozenge\). But the implication may still hold in some cases. In this paper I show that on finite models \(\left<\psi\right>\varphi \) implies \(\lozenge \varphi \) for every ψ, and that on finitely branching models \(\left<\psi\right>\varphi \) implies \(\lozenge \varphi \) for every ψ if ϕ is \(\lozenge\)-free. Finally I also show that there are ϕ and ψ such that \(\left<\psi\right>\varphi \) does not imply \(\lozenge \varphi \) even on a finitely branching model.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer (2007)

    Google Scholar 

  2. Plaza, J.: Logics of public communication. In: Emrich, M., Phifer, M., Hadzikadic, M., Ras, Z. (eds.) Proceedings of the Fourth International Symposium on Methodologies for Intelligent Systems, Poster Session Program, pp. 201–216. Oak Ridge National Laboratory, ORNL/DSRD-24 (1989); Reprinted as [7]

    Google Scholar 

  3. Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Gilboa, I. (ed.) Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 43–56. Morgan Kaufmann Publishers Inc. (1998)

    Google Scholar 

  4. Fitch, F.: A logical analysis of some value concepts. The Journal of Symbolic Logic 28, 135–142 (1963)

    Article  MathSciNet  Google Scholar 

  5. Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: What can we achieve by arbitrary announcements? A dynamic take on Fitch’s knowability. In: Samet, D. (ed.) Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 42–51 (2007)

    Google Scholar 

  6. Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: ‘Knowable’ as ‘Known after an Announcement’. The Review of Symbolic Logic 1, 305–334 (2008)

    Article  MATH  Google Scholar 

  7. Plaza, J.: Logics of public communication. Synthese 158, 165–179 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuijer, L.B. (2014). How Arbitrary Are Arbitrary Public Announcements?. In: Colinet, M., Katrenko, S., Rendsvig, R.K. (eds) Pristine Perspectives on Logic, Language, and Computation. ESSLLI ESSLLI 2013 2012. Lecture Notes in Computer Science, vol 8607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44116-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44116-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44115-2

  • Online ISBN: 978-3-662-44116-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics