test FOO test
Computability in Europe 2006
Logical Approaches to Computational Barriers
This paper investigates the determinacy and the complete determinacy of
infinite games following reverse mathematics program whose purpose is to find
the set comprehension axioms which are necessary and sufficient for
these statements in the frame of second order arithmetic.
In some sense, this research clarifies how complex oracles we need to obtain the
which gives a winning strategy and which determines the
winning position for players.
It will be shown that, depending on the complexity of the rules of
games, the complexity of the oracles changes drastically
and that determinacy and complete determinacy statements are not always
websites: Arnold Beckmann