Strong completeness theorems for weak logics of common belief

DOI10.1023/A:1023032105687zbMath1027.03013MaRDI QIDQ1810818

Philippe Mongin, Luc Lismont

Publication date: 9 June 2003

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

common knowledge; strong completeness; common belief; logical omniscience

Mathematics Subject Classification ID

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

Related Items

The premiss-based approach to judgment aggregation, The doctrinal paradox, the discursive dilemma, and logical aggregation theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantified modal logic: non-normal worlds and propositional attitudes
• Formulation of Bayesian analysis for games with incomplete information
• Some extensions of a claim of Aumann in an axiomatic model of knowledge
• Information, trade and common knowledge
• Approximating common knowledge with common beliefs
• A guide to completeness and complexity for modal logics of knowledge and belief
• Agreeing to disagree
• Common belief in monotonic epistemic logic
• Iterative and fixed point common belief
• On the logic of common belief and common knowledge
• A non-minimal but very weak axiomatization of common belief
• Belief closure: A semantics of common knowledge for modal propositional logic
• Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics
• Game logic and its applications. I
• Common knowledge logic and game logic
• Infinitary S5‐Epistemic Logic