Abstract
Artemov has recently proposed a modernization of the semantics and proof theory of epistemic logic. We take up his approach and extend his framework with public announcements and the corresponding belief change operation. We establish a soundness and completeness result and show that our model update operation satisfies the AGM postulate of minimal change. Further, we also show that the standard approach cannot be directly employed to capture knowledge change by truthful announcements.
This work was supported by the Swiss National Science Foundation grant 200021_165549.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
As usual, we write instead of \(\mathcal H\), when \(\mathcal H\) is clear from the context.
References
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50(2), 510–530 (1985)
Artemov, S.N.: The logic of justification. RSL 1(4), 477–513 (2008)
Artemov, S.N.: Knowing the model. ArXiv e-prints https://arxiv.org/abs/1610.04955 (2016)
Artemov, S.N.: New foundations of epistemic logic. Talk given at OST 2018, Bern (2018). http://ost18.inf.unibe.ch/
Artemov, S.N.: Rebuilding epistemic logic. Talk given at Trends in Logic XVIII, Milan (2018). https://www.unicatt.it/meetings/trends-home
Artemov, S.N.: Revising epistemic logic. Talk given at LFCS 2018, Deerfield Beach (2018). http://lfcs.ws.gc.cuny.edu/lfcs-2018/
Brünnler, K., Flumini, D., Studer, T.: A logic of blockchain updates. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 107–119. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-72056-2_7
Bucheli, S., Kuznets, R., Renne, B., Sack, J., Studer, T.: Justified belief change. In: Arrazola, X., Ponte, M. (eds.) LogKCA-2010, pp. 135–155. University of the Basque Country Press (2010)
Bucheli, S., Kuznets, R., Studer, T.: Realizing public announcements by justifications. J. Comput. Syst. Sci. 80(6), 1046–1066 (2014)
Gärdenfors, P.: Knowledge in Flux. The MIT Press, Cambridge (1988)
Gerbrandy, J., Groeneveld, W.: Reasoning about information change. J. Log. Lang. Inf. 6(2), 147–169 (1997)
Kuznets, R., Studer, T.: Update as evidence: belief expansion. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 266–279. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35722-0_19
Kuznets, R., Studer, T.: Logics of Proofs and Justifications. College Publications. (in preparation)
Plaza, J.: Logics of public communications. Synthese 158(2), 165–179 (2007). Reprinted from Emrich, M.L., et al. (eds.) Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems (ISMIS 1989), pp. 201–216. Oak Ridge National Laboratory, ORNL/DSRD-24 (1989)
Renne, B.: Public communication in justification logic. J. Log. Comput. 21(6), 1005–1034 (2011). Published online July 2010
Steiner, D.: Belief change functions for multi-agent systems. Ph.D. thesis, University of Bern (2009)
Steiner, D., Studer, T.: Total public announcements. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 498–511. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72734-7_35
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Dordrecht (2008). https://doi.org/10.1007/978-1-4020-5839-4
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer-Verlag GmbH Germany, part of Springer Nature
About this paper
Cite this paper
Savić, N., Studer, T. (2019). Public Announcements for Epistemic Models and Hypertheories. In: Khan, M., Manuel, A. (eds) Logic and Its Applications. ICLA 2019. Lecture Notes in Computer Science(), vol 11600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-58771-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-58771-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-58770-6
Online ISBN: 978-3-662-58771-3
eBook Packages: Computer ScienceComputer Science (R0)