[FOM] Classical/Constructive Arithmetic

Bill Taylor W.Taylor at math.canterbury.ac.nz
Thu Mar 23 00:15:04 EST 2006

->> Examples abound in game theory.  e.g. That Hex has a first-player win.
->I'm afraid I have trouble with this.

So this is to say:       "For all sized boards, Hex has a 1st-player win"
has a nice constructive proof?

That is to say, seemingly, that the usual strategy-stealing argument
is a *constructive* proof?

Is that the opinion of the constructivists on this list?

-- wfct

More information about the FOM mailing list