[FOM] the axiom of determinancy

[addamo at wp.pl]

I have the following question:

Let us take the axiom of determinancy (AD). And let X be the set of
sequences of the values
of the one variable recursive functions. Let us play about this set. This
play is
deteremined as the AD says. Is it true that there is a winning strategy for
a player II?
Is it true that it doesn't exist a winning strategy for the player I? And
what is the connection between
AD and CT (Church's Thesis)?

Adam