Skip to main content
Log in

Cite this article

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions


  1. Aucher, G., and F. Schwarzentruber, On the complexity of dynamic epistemic logic, in Proceedings of TARK ’13, ACM Digital Library, 2013.

  2. French, T., W. van der Hoek, P. Iliev, and B. P. Kooi, Succinctness of epistemic languages, in Proceedings of IJCAI ’11, 2011, pp. 881–886.

  3. Halpern J.Y, Vardi M.Y.: The complexity of reasoning about knowledge and time. i. lower bounds. Journal of Computer and System Sciences 38(1), 195–237 (1989)

    Article  Google Scholar 

  4. Holliday, W., T. Hoshi, and T. Icard, A uniform logic of information dynamics, in Proceedings of Advances in Modal Logic 2012, volume 9, College Publications, 2012, pp. 348–367.

  5. Lutz, C., Complexity and succinctness of public announcement logic, in Proceedings of AAMAS ’06, New York, NY, USA, 2006, pp. 137–143. ACM.

  6. van Benthem, J., J. Gerbrandy, T. Hoshi, and E. Pacuit, Merging frameworks for interaction, Journal of Philosophical Logic 38(5):491–526, October 2009.

  7. Wang, Y., and Q. Cao, On axiomatizations of public announcement logic, Synthese 190 (1 Supplement):103–134, 2013.

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Yanjing Wang.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y. Book Reviews. Stud Logica 102, 647–654 (2014).

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: