[FOM] Classical/Constructive Arithmetic

Bill Taylor W.Taylor at math.canterbury.ac.nz
Tue Mar 21 22:28:21 EST 2006

> Examples where the known proof is nonconstructive, and where one can give
> a constructive proof, but all known constructive proofs are grotesque

Examples abound in game theory.  e.g. That Hex has a first-player win.


More information about the FOM mailing list