Temporal languages for epistemic programs

DOI10.1007/S10849-007-9054-1MaRDI QIDQ1006494zbMATH OpenOpenAlexFDO

Authors Joshua Sack

Publication date 24 March 2009

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10849-007-9054-1

zbMATH Keywords

dynamic epistemic logicepistemic logicgamesmodal logicpublic announcement logictemporal logic

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Temporal logic (03B44) Games in extensive form (91A18)

Review text

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.

Recommendations

• On axiomatizations of public announcement logic
• Dynamic Epistemic Logic and Knowledge Puzzles
• `Knowable' as `known after an announcement'
• A soundness and completeness proof on dialogs and dynamic epistemic logic
• Schematic Validity in Dynamic Epistemic Logic: Decidability
• Algebraic semantics and model completeness for intuitionistic public announcement logic
• Public announcement logic with distributed knowledge
• A Tableau Method for Public Announcement Logics

Cites work

• Clues to the paradoxes of knowability: reply to Dummett and Tennant
• Hybrid languages
• Logics for epistemic programs
• Logics of public communications
• Sum and Product in Dynamic Epistemic Logic
• What one may come to know

Cited in

(14)

• Extending probabilistic dynamic epistemic logic
• Merging frameworks for interaction
• Reverse public announcement operators on expanded models
• On inverse operators in dynamic epistemic logic
• A history based logic for dynamic preference updates
• Logics of rational interaction
• Exploring the power of converse events
• Formal semantics of meta-level architectures: Temporal epistemic reflection
• A general framework for dynamic epistemic logic: towards canonical correspondences
• Logics of temporal-epistemic actions
• Temporal Aspects of the Dynamics of Knowledge
• Logic for update products and steps into the past
• A logical formalisation of false belief tasks
• Quantified temporal alethic boulesic doxastic logic

This page was built for publication: Temporal languages for epistemic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006494)