Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.02890 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908996391141376 |
|---|---|
| author | Balbiani, Philippe van Ditmarsch, Hans Lerouvillois, Clara |
| author_facet | Balbiani, Philippe van Ditmarsch, Hans Lerouvillois, Clara |
| contents | We investigate a logic for asynchronous announcements wherein the sending of the messages by the environment is separated from their reception by the individual agents. Both come with different modalities. In the logical semantics, formulas are interpreted in a world of a Kripke model but given a history of prior announcements and receptions that already happened. An axiomatisation AA for such a logic has been given in prior work, for the formulas that are valid when interpreted in the Kripke model before any such announcements have taken place. This axiomatisation is a reduction system wherein one can show that every formula is equivalent to a purely epistemic formula without dynamic modalities for announcements and receptions. We propose a generalisation AA* of this axiomatisation, for the formulas that are valid when interpreted in the Kripke model given any history of prior announcements and receptions of announcements. It does not extend the axiomatisation AA, for example it is no longer valid that nobody has received any message. Unlike AA, this axiomatisation AA* is infinitary and it is not a reduction system. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_02890 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Axiomatisation for an asynchronous epistemic logic with sending and receiving messages Balbiani, Philippe van Ditmarsch, Hans Lerouvillois, Clara Logic in Computer Science Multiagent Systems We investigate a logic for asynchronous announcements wherein the sending of the messages by the environment is separated from their reception by the individual agents. Both come with different modalities. In the logical semantics, formulas are interpreted in a world of a Kripke model but given a history of prior announcements and receptions that already happened. An axiomatisation AA for such a logic has been given in prior work, for the formulas that are valid when interpreted in the Kripke model before any such announcements have taken place. This axiomatisation is a reduction system wherein one can show that every formula is equivalent to a purely epistemic formula without dynamic modalities for announcements and receptions. We propose a generalisation AA* of this axiomatisation, for the formulas that are valid when interpreted in the Kripke model given any history of prior announcements and receptions of announcements. It does not extend the axiomatisation AA, for example it is no longer valid that nobody has received any message. Unlike AA, this axiomatisation AA* is infinitary and it is not a reduction system. |
| title | Axiomatisation for an asynchronous epistemic logic with sending and receiving messages |
| topic | Logic in Computer Science Multiagent Systems |
| url | https://arxiv.org/abs/2510.02890 |