De Re Updates

@inproceedings{Cohen2021DeRU,
  title={De Re Updates},
  author={Michael Cohen and Weng Hong Tang and Yanjing Wang},
  booktitle={TARK},
  year={2021}
}
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 [35]. We obtain complete axiomatizations for the counterparts of public announcement logic and event-model… 

References

SHOWING 1-10 OF 44 REFERENCES
An Alternative Axiomatization of DEL and Its Applications
TLDR
This paper provides a new axiomatization of the event-model-based Dynamic Epistemic Logic, based on the completeness proof method proposed in [Wang and Cao, 2013], which naturally captures the essence of the update product.
When Names Are Not Commonly Known: Epistemic Logic with Assignments
TLDR
This work introduces a lightweight modal predicate logic where names can be non-rigid and the language can handle various de dicto and de re distinctions in a natural way.
Knowing Values and Public Inspection
TLDR
A sound and strongly complete axiomatization for the single and multi-agent case, making use of the well-known Armstrong axioms for dependencies in databases.
Logics of communication and change
Merging Frameworks for Interaction
TLDR
This paper systematically and rigorously relates the DEL framework with the ETL framework via a new representation theorem characterizing the largest class of ETL models corresponding to DEL protocols in terms of notions of Perfect Recall, No Miracles, and Bisimulation Invariance.
To Know is to Know the Value of a Variable
  • A. Baltag
  • Mathematics
    Advances in Modal Logic
  • 2016
TLDR
An epistemic logic that can express knowledge of a dependency between variables (or complex terms) is developed and it is proved completeness, decidability and finite model property.
Logics of public communications
TLDR
Extensions of the logic S5 which can deal with public communications are defined and some completeness, decidability and interpretability results are proved and a general method is formulated that solves certain kind of problems involving public communications.
Dynamic Term-Modal Logic for Epistemic Social Network Dynamics (Extended Version)
TLDR
This paper presents a framework based on *dynamic term-modal logic* (DTML), a quantified variant of dynamic epistemic logic (DEL), and shows that DTML semantics can represent a popular class of hybrid logic epistemic social network models.
Knowing That, Knowing What, and Public Communication: Public Announcement Logic with Kv Operators
TLDR
It is shown that in the setting of PAL, replacing the Kv operator with its generalized version does not increase the expressive power of the resulting logic, so it is suggested that the more flexible generalization can be used instead of the original PAL+Kv.
Dynamic epistemic logic
TLDR
A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.
...
...