A solution to the surprise exam paradox in constructive mathematics

Review of Symbolic Logic 5 (4):679-686 (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

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,856

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-10-31

Downloads
91 (#131,526)

6 months
1 (#386,040)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A Paradox Regained.D. Kaplan & R. Montague - 1960 - Notre Dame Journal of Formal Logic 1 (3):79-90.
Elements of Intuitionism.Nicolas D. Goodman - 1979 - Journal of Symbolic Logic 44 (2):276-277.
The Secret of My Success.Hans Van Ditmarsch & Barteld Kooi - 2006 - Synthese 151 (2):201-232.
On a so-Called Paradox.W. V. Quine - 1953 - Mind 62 (245):65-67.
The Backward Induction Paradox.Philip Pettit & Robert Sugden - 1989 - Journal of Philosophy 86 (4):169-182.

View all 15 references / Add more references

Citations of this work

No citations found.

Add more citations

Similar books and articles