Logics with group announcements and distributed knowledge: completeness and expressive power
From MaRDI portal
Publication:2155204
DOI10.1007/S10849-022-09355-0OpenAlexW4220830393MaRDI QIDQ2155204FDOQ2155204
Authors: Thomas Ågotnes, Natasha Alechina, Rustam Galimullin
Publication date: 15 July 2022
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-022-09355-0
Recommendations
Cites Work
- Moorean phenomena in epistemic logic
- The secret of my success
- Logics of communication and change
- Alternating-time temporal logic
- A Modal Logic for Coalitional Power in Games
- Title not available (Why is that?)
- Handbook of modal logic
- Dynamic epistemic logic
- Quantifying Notes
- `Knowable' as `known after an announcement'
- Refinement modal logic
- Arbitrary action model logic and action model synthesis
- Group announcement logic
- Logics of public communications
- Arbitrary arrow update logic
- Distributed knowledge
- MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity
- Axiomatising the logic of computer programming
- Coalition logic with individual, distributed and common knowledge
- Relativized common knowledge for dynamic epistemic logic
- Coalition and relativised group announcement logic
- Group announcement logic with distributed knowledge
- Resolving distributed knowledge
- Positive announcements
- Verification and strategy synthesis for coalition announcement logic
- Model Checking for Coalition Announcement Logic
Cited In (11)
- Title not available (Why is that?)
- A Hybrid Public Announcement Logic with Distributed Knowledge
- To be announced
- The undecidability of quantified announcements
- Coalition and group announcement logic
- Coalition and relativised group announcement logic
- Resolving distributed knowledge
- A Tableau Method for Public Announcement Logics
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity
- Arbitrary public announcement logic with memory
- Public announcement logic with distributed knowledge
This page was built for publication: Logics with group announcements and distributed knowledge: completeness and expressive power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155204)