Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.19418

Dismantling the Surprise Test "Paradox"

Martin Dietzfelbinger
View original source ↗Read source document ↗Export metadata ↓

Abstract

Consider the following story: A teacher announces to her students a test for the following week, such that the test will be ``surprising''. The students use this as the basis for a ``logical derivation'' and reach a contradiction, which they (falsely) interpret as saying that there cannot be a test. The teacher gives a test e.g. on Wednesday, ``surprising'' the students. Its curious turns give the story the flavor of a paradox. Alternative names are the {\it unexpected hanging paradox\/} and the {\it prediction paradox}. Discussions and analyses of the story in the philosophical and mathematical literature are abundant, spanning 80 years until today. Apparently, none of the known explanations has been generally accepted as conclusive. We offer a fresh view, in propositional logic. ``Surprise'' is captured as unprovability of a certain formula from some axiom system. ``Knowledge'' corresponds to axiom systems and can be gained by mathematical proofs. The notorious property of self-reference in the announcement is cleanly accommodated. All errors made by the students are identified. A general analysis shows that the students cannot learn anything from the announcement. This is the first mathematically precise analysis of the story that shows that self-reference, full power of mathematical proofs, and truthfulness of the teacher can consistently coexist. The ``paradox'' vanishes. In order to facilitate comparisons with treatments using modal logic a version based on system S5 is also given. A formula $\sigma$ is identified that formalizes ``there will be a surprising test'', and it is shown that the students take the announcement to mean $\square\sigma$ while in fact the information conveyed by it is not stronger than $\diamond\sigma$. This dissolves all contradictions or ``paradoxical'' issues.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Martin Dietzfelbinger. 2026-01-27. Dismantling the Surprise Test "Paradox". https://arxiv.org/abs/2601.19418

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗