Coalition and relativised group announcement logic
From MaRDI portal
Publication:2236503
Recommendations
Cites work
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 824735 (Why is no real title available?)
- A Modal Logic for Coalitional Power in Games
- APAL with memory Ii better
- Alternating-time temporal dynamic epistemic logic
- Arbitrary action model logic and action model synthesis
- Arbitrary arrow update logic
- Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
- Axiomatising the logic of computer programming
- Clues to the paradoxes of knowability: reply to Dummett and Tennant
- Coalition and group announcement logic
- Dynamic epistemic logic
- Fully arbitrary public announcements
- Games in dynamic-epistemic logic
- Group announcement logic
- Group announcement logic with distributed knowledge
- Handbook of modal logic
- Logic in games
- Logics of communication and change
- Logics of public communications
- Modal logic
- Model Checking for Coalition Announcement Logic
- On axiomatizations of public announcement logic
- On the definability of simulation and bisimulation in epistemic logic
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity
- Putting right the wording and the proof of the truth lemma for \textit{APAL}
- Quantifying Notes
- Refinement modal logic
- Resolving distributed knowledge
- The undecidability of quantified announcements
- What will they say? -- Public announcement games
- `Knowable' as `known after an announcement'
Cited in
(13)- From coalition logic to STIT
- On the Dynamics of Institutional Agreements
- To be announced
- Model checking for coalition announcement logic
- Dynamic coalition logic: granting and revoking dictatorial powers
- Logics with group announcements and distributed knowledge: completeness and expressive power
- Group announcement logic
- The undecidability of quantified announcements
- Verification and strategy synthesis for coalition announcement logic
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
- No finite model property for logics of quantified announcements
- Coalition and group announcement logic
- Model Checking for Coalition Announcement Logic
This page was built for publication: Coalition and relativised group announcement logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236503)
