Skip to main content

Dynamic Epistemic Logic Displayed

  • Conference paper

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

Abstract

We introduce a display calculus for the logic of Epistemic Actions and Knowledge (EAK) of Baltag-Moss-Solecki. This calculus is cut-free and complete w.r.t. the standard Hilbert-style presentation of EAK, of which it is a conservative extension, given that—as is common to display calculi—it is defined on an expanded language in which all logical operations have adjoints. The additional dynamic operators do not have an interpretation in the standard Kripke semantics of EAK, but do have a natural interpretation in the final coalgebra. This proof-theoretic motivation revives the interest in the global semantics for dynamic epistemic logics pursued among others by Baltag [4], Cîrstea and Sadrzadeh [8].

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. Aczel, P., Mendler, N.: A Final Coalgebra Theorem. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  2. Balbiani, P., van Ditmarsch, H.P., Herzig, A., de Lima, T.: Tableaux for public announcement logic. Journal of Logic and Computation 20(1), 55–76 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baltag, A., Moss, L., Solecki, S.: The Logic of Public Announcements, Common Knowledge, and Private Suspicions. CWI technical report SEN-R9922 (1999)

    Google Scholar 

  4. Baltag, A.: A Coalgebraic Semantics for Epistemic Programs. Electronic Notes in Theoretical Computer Science 82(1) (2003)

    Google Scholar 

  5. Baltag, A., Coecke, B., Sadrzadeh, M.: Epistemic actions as resources. Journal of Logic and Computation 17, 555–585 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Belnap, N.: Display logic. J. Philos. Logic 11, 375–417 (1982)

    MathSciNet  MATH  Google Scholar 

  7. Belnap, N.: Linear Logic Displayed. Notre Dame J. Formal Logic 31(1), 14–25 (1989)

    Article  MathSciNet  Google Scholar 

  8. Cîrstea, C., Sadrzadeh, M.: Coalgebraic Epistemic Update Without Change of Model. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 158–172. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Dyckhoff, R., Sadrzadeh, M., Truffaut, J.: Algebra, Proof Theory and Applications for an Intuitionistic Logic of Propositions, Actions and Adjoint Modal Operators. ACM Transactions on Computational Logic 666 (2013)

    Google Scholar 

  10. Fischer-Servi, G.: Axiomatizations for Some Intuitionistic Modal Logics. Rend. Sem. Mat Polit. di Torino 42, 179–194 (1984)

    MathSciNet  MATH  Google Scholar 

  11. Goré, R., Postniece, L., Tiu, A.: Cut-elimination and Proof Search for Bi-Intuitionistic Tense Logic. In: Proc. Advances in Modal Logic, pp. 156–177 (2010)

    Google Scholar 

  12. Goré, R.: Dual Intuitionistic Logic Revisited. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 252–267. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Kurz, A., Palmigiano, A.: Epistemic Updates on Algebras. Logical Methods in Computer Science ( forthcoming, 2013)

    Google Scholar 

  14. Kurz, A., Rosický, J.: Mathematical Structures in Computer Science, vol. 15, pp. 149–166. Cambridge University Press (2005)

    Google Scholar 

  15. Maffezzoli, P., Negri, S.: A Gentzen-style analysis of Public Announcement Logic. In: Arrazola, X., Ponte, M. (eds.) Proceedings of the International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pp. 293–313. University of the Basque Country Press (2010)

    Google Scholar 

  16. Maffezzoli, P., Negri, S.: A proof theoretical perspective on Public Announcement Logic. Logic and Philosophy of Science 9, 49–59 (2011)

    Google Scholar 

  17. Ma, M., Palmigiano, A., Sadrzadeh, M.: Algebraic Semantics and Model Completeness for Intuitionistic Public Announcement Logic. Annals of Pure and Applied Logic (to appear, 2013)

    Google Scholar 

  18. Rauszer, C.: A Formalization of The Propositional Calculus of H-B Logic. Studia Logica 33, 23–34 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  19. Restall, G.: An Introduction to Substructural Logics. Routledge, London (2000)

    Google Scholar 

  20. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (2000)

    Google Scholar 

  21. Wansing, H.: Displaying Modal Logic. Kluwer Academic Publisher, Dordrecht (1998)

    Book  MATH  Google Scholar 

  22. Wansing, H.: The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations. Studia Logica 64(1), 3–20 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, G., Kurz, A., Palmigiano, A. (2013). Dynamic Epistemic Logic Displayed. In: Grossi, D., Roy, O., Huang, H. (eds) Logic, Rationality, and Interaction. LORI 2013. Lecture Notes in Computer Science, vol 8196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40948-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40948-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40947-9

  • Online ISBN: 978-3-642-40948-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics