TY - GEN
T1 - Arbitrary announcements on topological subset spaces
AU - van Ditmarsch, Hans
AU - Knight, Sophia
AU - Özgün, Aybüke
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Subset space semantics for public announcement logic in the spirit of the effort modality have been proposed by Wang and Ågotnes [18] and by Bjorndahl [6]. They propose to model the public announcement modality by shrinking the epistemic range with respect to which a postcondition of the announcement is evaluated, instead of by restricting the model to the set of worlds satisfying the announcement. Thus we get an “elegant, model-internal mechanism for interpreting public announcements” [6, p. 12]. In this work, we extend Bjorndahl’s logic PALint of public announcement, which is modelled on topological spaces using subset space semantics and adding the interior operator, with an arbitrary announcement modality, and we provide topological subset space semantics for the corresponding arbitrary announcement logic APALint, and demonstrate completeness of the logic by proving that it is equal in expressivity to the logic without arbitrary announcements, employing techniques from [2,13].
AB - Subset space semantics for public announcement logic in the spirit of the effort modality have been proposed by Wang and Ågotnes [18] and by Bjorndahl [6]. They propose to model the public announcement modality by shrinking the epistemic range with respect to which a postcondition of the announcement is evaluated, instead of by restricting the model to the set of worlds satisfying the announcement. Thus we get an “elegant, model-internal mechanism for interpreting public announcements” [6, p. 12]. In this work, we extend Bjorndahl’s logic PALint of public announcement, which is modelled on topological spaces using subset space semantics and adding the interior operator, with an arbitrary announcement modality, and we provide topological subset space semantics for the corresponding arbitrary announcement logic APALint, and demonstrate completeness of the logic by proving that it is equal in expressivity to the logic without arbitrary announcements, employing techniques from [2,13].
UR - http://www.scopus.com/inward/record.url?scp=84942795018&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84942795018&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-17130-2_17
DO - 10.1007/978-3-319-17130-2_17
M3 - Conference contribution
AN - SCOPUS:84942795018
SN - 9783319171296
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 252
EP - 266
BT - Multi-Agent Systems - 12th European Conference, EUMAS 2014, Revised Selected Papers
A2 - Bulling, Nils
PB - Springer- Verlag
T2 - 12th European Conference on Multi-Agent Systems, EUMAS 2014
Y2 - 18 December 2014 through 19 December 2014
ER -