Skip to main content
SpringerLink
Log in

Temporal Languages for Epistemic Programs

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statements concerning the muddy children puzzle and sum and product. We also express a true statement that an agent’s beliefs about another agent’s knowledge flipped twice, and use a sound proof system to prove this statement. Adding a next-time operator to PAL, we provide formulas that express that belief revision does not take place in PAL. We also discuss relationships between announcements and the new knowledge agents thus acquire; such relationships are related to learning and to Fitch’s paradox. We also show how inverse programs and hybrid logic each can be used to help determine whether or not an arbitrary structure represents the play of a game. We then add a past-time operator to DEL, and discuss the importance of adding yet another component to the language in order to prove completeness.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., & de Lima, T. (2007). What can we achieve by arbitrary announcements? A dynamic take on Fitch’s knowability. Proceedings of Theoretical Aspects of Rationality and Knowledge.

  • Baltag A., Moss L. (2004). Logics for epistemic programs. Synthese 139, 165–224

    Article  Google Scholar 

  • Baltag, A., Moss, L., & Solecki, S. (2003). Logics for epistemic actions: Completeness, decidability, expressivity. ms. Indiana University.

  • van Benthem, J. (2007). What one may come to know. ms. Universiteit van Amsterdam.

  • Blackburn P., Seligman J. (1995). Hybrid logic. Journal of Logic, Language and Information 4, 251–272

    Article  Google Scholar 

  • Brogaard, B., & Salerno, J. (2002). Fitch’s paradox of knowability. Stanford Electronic Encyclopedia of Philosophy, http://plato.stanford.edu/entries/fitch-paradox/

  • van Ditmarsch, H. P., Ruan, J., & Verbrugge, L. C. (2007). Sum and product in dynamic epistemic logic. Journal of Logic and Computation, to appear.

  • Gerbrandy, D. (1998). Bisimulations on Planet Kripke. PhD Thesis, ILLC, Universiteit van Amsterdam.

  • Plaza, J. (1989). Logics of public communications. Proceedings of 4th International Symposium on Methodologies for Intelligent Systems.

  • Sack, J. (2007). Adding temporal logic to dynamic epistemic Logic. PhD Thesis, Indiana University.

  • Sack, J. (2007). Logic for update products and steps into the past. ms. California State University Long Beach.

  • Yap, A. (2005). Product update and looking backward. ms. Stanford University. Also atwww.illc.uva.nl/lgc/papers/bms-temporal.pdf

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, California State University Long Beach, Long Beach, CA, 90840, USA

    Joshua Sack

Authors
  1. Joshua Sack
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joshua Sack.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sack, J. Temporal Languages for Epistemic Programs. J of Log Lang and Inf 17, 183–216 (2008). https://doi.org/10.1007/s10849-007-9054-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-007-9054-1

Keywords

Search

Navigation