Arbitrary public announcement logic with memory
From MaRDI portal
Publication:2686087
DOI10.1007/S10992-022-09664-6OpenAlexW4286001194MaRDI QIDQ2686087
Alexandru Baltag, Aybüke Özgün, Ana Lucia Vargas-Sandoval
Publication date: 24 February 2023
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-022-09664-6
modal logicdynamic epistemic logicsubset space semanticscoalition announcement logicgroup announcement logicarbitrary announcement modalityarbitrary public announcement logiccoalition announcement modalityrecursive axiomatization
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The undecidability of quantified announcements
- Refinement modal logic
- Group announcement logic
- The Russian cards problem
- Topo-logic as a dynamic-epistemic logic
- APAL with memory Is better
- Topological reasoning and the logic of knowledge
- Positive announcements
- Announcement as effort on topological spaces
- Epistemic planning for single- and multi-agent systems
- Quantifying Notes
- Subset Space Logic with Arbitrary Announcements
- Subset Space Public Announcement Logic
- Topological Subset Space Models for Public Announcements
- ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
- Dynamic Epistemic Temporal Logic
- A Modal Logic for Coalitional Power in Games
- Putting right the wording and the proof of the Truth Lemma forAPAL
- What one may come to know
- Knowledge Games and Coalitional Abilities
- Arbitrary Action Model Logic and Action Model Synthesis
- A dynamic logic for learning theory
This page was built for publication: Arbitrary public announcement logic with memory