David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
We present a direct reduction of dynamic epistemic logic in the spirit of  to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in reduction axioms for the update actions. It follows that the logic of public announcement, the logic of group announcements, the logic of secret message passing, and so on, can all be viewed as subsystems of PDL. Moreover, the program transformation approach can be used to generate the appropriate reduction axioms for these logics. Our direct reduction of dynamic epistemic logic to PDL was inspired by the reduction of dynamic epistemic logic to automata PDL of . Our approach shows how the detour through automata can be avoided.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Giuseppe Giacomo (1996). Eliminating “Converse” From Converse PDL. Journal of Logic, Language and Information 5 (2):193-208.
Added to index2009-01-28
Total downloads31 ( #102,719 of 1,726,249 )
Recent downloads (6 months)9 ( #74,830 of 1,726,249 )
How can I increase my downloads?