A Hybrid Public Announcement Logic with Distributed Knowledge
(2011) In Electronical Notes in Theoretical Computer Science 273. p.33-50- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4017427
- author
- Hansen, Jens Ulrik LU
- publishing date
- 2011
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- hybrid Logic public announcement logic distributed knowledge completeness reduction axioms epistemic logic
- in
- Electronical Notes in Theoretical Computer Science
- volume
- 273
- pages
- 33 - 50
- publisher
- Elsevier
- external identifiers
-
- scopus:79960136174
- ISSN
- 1571-0661
- DOI
- 10.1016/j.entcs.2011.06.011
- language
- English
- LU publication?
- no
- id
- acb7022c-c281-49bf-a390-786762ba7214 (old id 4017427)
- date added to LUP
- 2016-04-01 14:49:26
- date last changed
- 2022-03-29 23:03:42
@article{acb7022c-c281-49bf-a390-786762ba7214,
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.}},
author = {{Hansen, Jens Ulrik}},
issn = {{1571-0661}},
keywords = {{hybrid Logic public announcement logic distributed knowledge completeness reduction axioms epistemic logic}},
language = {{eng}},
pages = {{33--50}},
publisher = {{Elsevier}},
series = {{Electronical Notes in Theoretical Computer Science}},
title = {{A Hybrid Public Announcement Logic with Distributed Knowledge}},
url = {{http://dx.doi.org/10.1016/j.entcs.2011.06.011}},
doi = {{10.1016/j.entcs.2011.06.011}},
volume = {{273}},
year = {{2011}},
}