A Hybrid Public Announcement Logic with Distributed Knowledge

Authors:
Jens Ulrik Hansen
Affiliations:
Programming, Logic and Intelligent Systems Research Group and Science Studies Research Group, Roskilde University, P.O. Box 260, DK-4000 Roskilde, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 5
Cited 0

An essay in combinatory dynamic logic

Information and Computation
Reasoning about knowledge

Reasoning about knowledge
Dynamic Epistemic Logic

Dynamic Epistemic Logic
Terminating Tableaux for Dynamic Epistemic Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
Modal fixed-point logic and changing models

Pillars of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has been changed such that nominals only partially denote states. The hybrid logic contains nominals, satisfaction operators, the downarrow binder as well as the global modality. Following this, an axiom system for the Hybrid Public Announcement Logic is presented and using reduction axioms general completeness (in the usual style of Hybrid Logic) is proved. The general completeness allows for an easy way of adding distributed knowledge. Furthermore, it turns out that distributed knowledge is definable using satisfaction operators and the downarrow binder.