‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’

DOI10.1017/S1755020308080210zbMath1208.03019MaRDI QIDQ3580674

Andreas Herzig, Tomohiro Hoshi, Tiago de Lima, Philippe Balbiani, Alexandru Baltag, Hans P. van Ditmarsch

Publication date: 13 August 2010

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

zbMATH Keywords

public announcement logic; knowability; Moore sentence; miltiagent epistemic logic; necessity form

Mathematics Subject Classification ID

03B42: Logics of knowledge and belief (including belief change)

Related Items

Putting right the wording and the proof of the Truth Lemma forAPAL, Propositional quantification in logics of contingency, Unnamed Item, CONTINGENCY AND KNOWING WHETHER, On Composing Finite Forests with Modal Logics, To be announced, 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, Positive announcements, Announcement as effort on topological spaces, Verification and strategy synthesis for coalition announcement logic, Weighted modal logic in epistemic and deontic contexts, Logics with group announcements and distributed knowledge: completeness and expressive power, Inquisitive logic as an epistemic logic of knowing how, Arrow update synthesis, Coalition and relativised group announcement logic, The undecidability of arbitrary arrow update logic, Simulative belief logic, Arbitrary public announcement logic with memory, The Complexity of One-Agent Refinement Modal Logic, An Alternative Logic for Knowability, Unnamed Item, Unnamed Item, Topological Subset Space Models for Public Announcements, Knowledge, Time, and Paradox: Introducing Sequential Epistemic Logic

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item