A SOLUTION TO THE SURPRISE EXAM PARADOX IN CONSTRUCTIVE MATHEMATICS
Mohammad Ardeshir, Rasoul Ramezanian · The Review of Symbolic Logic · 2012
Abstract We represent the well-known surprise exam paradox in constructive and computable mathematics and offer solutions. One solution is based on Brouwer’s continuity principle in constructive mathematics, and the other involves type 2 Turing computability in classical mathematics. We also discuss the backward induction paradox for extensive form games in constructive logic.