Temporal languages for epistemic programs (Q1006494): Difference between revisions

The paper is concerned with the extension of public announcement logic (PAL) and dynamic epistemic logic (DEL) by inverse programs and by a temporal operator `yesterday'. Extensions by the temporal `tomorrow' as well as by nominals and binder of hybrid logic are also discussed. The research program is related to a series of papers that started in 2007, with recent presentations by \textit{J. van Benthem} et al. [``Merging frameworks for interaction'', J. Philos. Log. 38, No. 5, 491--526 (2009; Zbl 1185.03019)] and by \textit{T. Hoshi} and \textit{A. Yap} [``Dynamic epistemic logic with branching temporal structures'', Synthese 169, No. 2, 259--281 (2009; Zbl 1184.03009)]. The main difference is that the present account does not integrate protocols, and therefore does not deal with the fact that announcements do not satisfy the principle \( \varphi \rightarrow \langle\varphi\rangle \top \). It is shown that the logic allows to adequately model several phenomena: variations of the muddy children puzzle, the sum and product puzzle, Fitch's paradox of knowability, and more generally reasoning about (the absence of) belief revision and about the playing of games in extensive form. For the language without common knowledge a complete axiomatisation of the temporal extension of PAL is given; for the case of common knowledge it is referred to the author's PhD thesis.