Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Sources of Unknowability and Self-refutation in Epistemic and Dynamic Epistemic Logic

Published 18 Sep 2026 in cs.LO | (2609.21317v1)

Abstract: In this paper, we define a formula φ\varphi to be unbelievable if □φ\Box\varphi is unsatisfiable, and unknowable if □φ∧φ\Box\varphi\land\varphi is unsatisfiable. We then analyze the sources of unknowability and unbelievability in different classes of frames K, KD, KD45, and S5. We first show that any unbelievable formula is a fixed point of the Moore function defined by f(φ)=φ∧¬□φ.f(\varphi)=\varphi\land\lnot\Box\varphi. Our main result shows that in S5, the static notions of unknowability and unbelievability in epistemic logic, and the dynamic notions of always informativeness and eventual self-refutation in dynamic epistemic logic are all equivalent to ``Moorean phenomena.'' We also generalize the result to the multi-agent case, showing that although all unknowable formulas still manifest Moorean phenomena, new mechanisms arise due to their interactive nature. Finally, we briefly analyze whether the Brandenburger-Keisler paradox in epistemic game theory can be considered Moorean.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.