How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions
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...
Main Authors: | , |
---|---|
פורמט: | Article |
שפה: | English |
יצא לאור: |
Open Publishing Association
2019-07-01
|
סדרה: | Electronic Proceedings in Theoretical Computer Science |
גישה מקוונת: | http://arxiv.org/pdf/1907.09105v1 |