Reverse Public Announcement Operators on Expanded Models

被引:0
作者
Ryuichi Sebastian Haney
机构
[1] University of Virginia,
来源
Journal of Logic, Language and Information | 2018年 / 27卷
关键词
Modal logic; Epistemic logic; Public announcement logic; Dynamic epistemic logic;
D O I
暂无
中图分类号
学科分类号
摘要
Past public announcement operators have been defined in Hoshi and Yap (Synthese 169(2):259–281, 2009) and Yap (Dynamic logic montréal, 2007), to describe an agent’s knowledge before an announcement occurs. These operators rely on branching-time structures that do not mirror the traditional, relativization-based semantics of public announcement logic (PAL), and favor a historical reading of past announcements. In this paper, we introduce reverse public announcement operators that are interpreted on expanded models. Our model expansion adds accessibility links from an epistemic model M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {M}$$\end{document} to a filtrated submodel of the canonical model for Kg\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf K _g$$\end{document}. Here Kg\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf K _g$$\end{document} is the minimal normal modal logic together with S5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf S5 $$\end{document} axioms for the universal operator U. This yields a highly general pre-announcement version of M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {M}$$\end{document} that makes our operators potentially useful for studying non-standard interpretations of rescinded announcements in PAL. Indeed, we find that our reverse announcement operators cannot be represented by product update, and that they have an intimate connection with the knowledge forgetting of Zhang and Zhou (Artif Intell J 173(16–17):1525–1537, 2009). We show that the logic resulting from adding reverse announcements to PAL is sound and complete.
引用
收藏
页码:205 / 224
页数:19
相关论文
共 24 条
[1]  
Areces C(2017)The modal logic of copy and remove Information and Computation 255 243-261
[2]  
van Ditmarsch H(1996)Topological reasoning and the logic of knowledge Annals of Pure and Applied Logic 78 73-110
[3]  
Fervari R(2009)Dynamic epistemic logic with branching temporal structures Synthese 169 259-281
[4]  
Schwarzentruber F(2016)Logics of temporal-epistemic actions Synthese 193 813-849
[5]  
Dabrowski A(2008)Temporal languages for epistemic programs Journal of Logic, Language and Information 17 183-216
[6]  
Moss L(2001)Games in dynamic–epistemic logic Bulletin of Economic Research 53 219-248
[7]  
Parikh R(2009)Merging frameworks for interaction Journal of Philosophical Logic 38 491-526
[8]  
Hoshi T(2006)Logics of communication and change Information and Computation 204 1620-1662
[9]  
Yap A(2013)Dynamics of lying Synthese 191 1-33
[10]  
Renne B(2009)Knowledge forgetting: Properties and applications Artificial Intelligence Journal 173 15251537-undefined