Complete Determinacy and Subsystems of Second Order Arithmetic
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 that 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 algorithms which give a winning strategies and which determine the winning positions for the 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 equivalent.
Keywordsinfinite game determinacy complete determinacy Wadge class reverse mathematics second order arithmetic
Unable to display preview. Download preview PDF.
- 1.Louveau, A.: Some results in the Wadge hierarchy of Borel sets, Cabal Seminar 79-81. Lecture Note in Mathematics, vol. 1019, pp. 28–55. Springer, Heidelberg (1983)Google Scholar
- 3.Medsalem, M.O., Tanaka, K.: Weak determinacy and iterations of inductive definitions. In: Proc. Computable Prospects of Infinity. World Scientific, Singapore (to appear)Google Scholar
- 6.Nemoto, T.: Determinacy of Wadge classes and subsystems of second order arithmetic (submitted), http://www.math.tohoku.ac.jp/~sa4m20/wadge.pdf
- 7.Nießner, F.: Nondeterministic tree automata. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite games, pp. 152–155. Springer, Heidelberg (2002)Google Scholar
- 11.Welch, P.: Weak systems of determinacy and arithmetical quasi-inductive definitions, http://www.maths.bris.ac.uk/~mapdw/det7.pdf