How to Agree without Understanding Each Other: Public Announcement Logic with Boolean DefinitionsGattinger, M. & Wang, Y., 22-Jul-2019, In : Electronic Proceedings in Theoretical Computer Science. 297, p. 206-220 15 p., 14.
Research output: Contribution to journal › Article › Academic › peer-review
In standard epistemic logic, knowing that p is the same as knowing that p is true, but it does not say anything about understanding p or knowing its meaning. In this paper, we present a conservative extension of Public Announcement Logic (PAL) in which agents have knowledge or belief about both the truth values and the meanings of propositions. We give a complete axiomatization of PAL with Boolean Definitions and discuss various examples. An agent may understand a proposition without knowing its truth value or the other way round. Moreover, multiple agents can agree on something without agreeing on its meaning and vice versa.
|Number of pages||15|
|Journal||Electronic Proceedings in Theoretical Computer Science|
|Publication status||Published - 22-Jul-2019|
No data available