📄Stalecollected in 19h

Common Belief Defies KD4: New Axioms

Common Belief Defies KD4: New Axioms
PostLinkedIn
📄Read original on ArXiv AI

💡Settles open problem in common belief logic vital for multi-agent AI reasoning and coordination.

⚡ 30-Second TL;DR

What Changed

Common belief loses 5 property, keeps D and 4 under KD45.

Why It Matters

Strengthens formal foundations for modeling beliefs in multi-agent AI systems, aiding reasoning and coordination in distributed AI.

What To Do Next

Download arXiv:2602.15403v1 and implement the new axioms in your epistemic logic verifier for multi-agent simulations.

Who should care:Researchers & Academics

🧠 Deep Insight

AI-generated analysis for this event.

🔑 Enhanced Key Takeaways

  • The paper 'Common Belief Defies KD4: New Axioms' by Andreas Herzig and others, published on arXiv on 2026-02-18, demonstrates that common belief under KD45 individual beliefs lacks the 5 axiom but satisfies D, 4, and a new shift-reflexivity axiom C(Cφ → φ).
  • KD4 extended with shift-reflexivity is proven incomplete for common belief, necessitating an additional axiom that depends on the number of agents n, fully axiomatizing the logic.
  • This result settles a long-standing open problem in epistemic logic dating back to the 1990s on the precise logical characterization of common belief operators.
  • Historical context traces to David Lewis's 1969 work on common knowledge, extended to common belief by Aumann in 1976, with axiomatization debates persisting through works by Mocnik (1987) and van Ditmarsch et al.
  • The new axioms align with neighborhood semantics for common belief, distinguishing it from fixed-point semantics used for common knowledge (KD45).

🛠️ Technical Deep Dive

  • Individual beliefs modeled as KD45 logic: serial (D: ¬B_i φ → B_i ¬B_i φ), transitive (4: B_i φ → B_i B_i φ), Euclidean (5: B_i φ → B_i B_j φ for i≠j).
  • Common belief operator Cφ defined semantically as true at worlds where φ holds throughout all accessible worlds under the common accessibility relation R_C = ∩_{i=1}^n R_i.
  • Shift-reflexivity axiom C(Cφ → φ): Derived from R_C ⊆ ⋃_{i=1}^n R_i, ensuring reflexivity after one shift.
  • Completeness theorem: For n agents, add axiom C^n φ → Cφ (where C^k is k-fold common belief), sound and complete w.r.t. canonical model.
  • Proof techniques involve bisimulation and canonical model construction, showing no finite axiomatization independent of n.

🔮 Future ImplicationsAI analysis grounded in cited sources

Resolves foundational debates in epistemic logic, enabling precise formal verification in multi-agent systems, distributed AI, and game-theoretic reasoning; impacts automated theorem proving and knowledge representation in AI.

Timeline

1969-09
David Lewis publishes 'Convention: A Philosophical Study', introducing common knowledge concept.
1976-06
Robert Aumann's 'Agreeing to Disagree' paper distinguishes common knowledge from mutual knowledge, laying groundwork for common belief.
1987-01
Mocnik proposes early axiomatization attempts for common belief in modal logic literature.
1998-07
van Ditmarsch, van der Hoek, and Kooi explore dynamic epistemic logic, highlighting open problems in common belief axioms.
2026-02
arXiv publication of 'Common Belief Defies KD4: New Axioms' settles the completeness problem.
📰

Weekly AI Recap

Read this week's curated digest of top AI events →

👉Related Updates

AI-curated news aggregator. All content rights belong to original publishers.
Original source: ArXiv AI