‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
From MaRDI portal
Publication:3580674
DOI10.1017/S1755020308080210zbMath1208.03019MaRDI QIDQ3580674
Alexandru Baltag, Philippe Balbiani, Andreas Herzig, Tomohiro Hoshi, Hans P. van Ditmarsch, Tiago de Lima
Publication date: 13 August 2010
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
03B42: Logics of knowledge and belief (including belief change)
Related Items
CONTINGENCY AND KNOWING WHETHER, The undecidability of quantified announcements, Arbitrary arrow update logic, Refinement modal logic, Information dynamics and uniform substitution, Exploring the tractability border in epistemic tasks, Logics of temporal-epistemic actions, Dynamics we can believe in: a view from the Amsterdam school on the centenary of Evert Willem Beth, What will they say? -- Public announcement games, Merging DEL and ETL, Logic for update products and steps into the past, The complexity of one-agent refinement modal logic, Group announcement logic, Keep `hoping' for rationality: a solution to the backward induction paradox, The many faces of closure and introspection. An ineractive perspective, Simulative belief logic, The Complexity of One-Agent Refinement Modal Logic, An Alternative Logic for Knowability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The secret of my success
- Dynamic epistemic logic
- Axiomatising the logic of computer programming
- Reasoning about information change
- Logics of public communications
- The undecidability of iterated modal relativization
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions
- Propositional quantifiers in modal logic1
- Victor's error
- A logical analysis of some value concepts
- What one may come to know
- Clues to the paradoxes of knowability: reply to Dummett and Tennant
- A Tableau Method for Public Announcement Logics
