article Open access

De Re Updates

  • Electronic Proceedings in Theoretical Computer Science
  • Open Publishing Association
Research footprint

At a glance

Citations
3
References
53
Comments
0
Paper overview

Öz

In this paper, we propose a lightweight yet powerful dynamic epistemic logic that captures not only the distinction between de dicto and de re knowledge but also the distinction between de dicto and de re updates. The logic is based on the dynamified version of an epistemic language extended with the assignment operator borrowed from dynamic logic, following the work of Wang and Seligman (Proc. AiML 2018). We obtain complete axiomatizations for the counterparts of public announcement logic and event-model-based DEL based on new reduction axioms taking care of the interactions between dynamics and assignments.

Record transparency

Publication details

DOI
10.4204/eptcs.335.9
OpenAlex
W3174252230
Document type
article
Language
EN
Source
Electronic Proceedings in Theoretical Computer Science
Last metadata update
Community

Comments

Oturum Açın to join the discussion.

  1. No comments yet. Start the discussion.