Advanced

A Hybrid Public Announcement Logic with Distributed Knowledge

Hansen, Jens Ulrik LU (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:
author
publishing date
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
2013-09-05 13:31:35
date last changed
2017-05-14 04:03:10
@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},
  keyword      = {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},
  volume       = {273},
  year         = {2011},
}