Complexity of winning strategies for Δ⁰₂ games
Rana Barua · Proceedings of the American Mathematical Society · 1993
For a Δ 2 0 \Delta _2^0 game played on ω \omega , we show that the winning player has a winning strategy that is recursive in E 1 {\mathbb {E}_1} , where E 1 {\mathbb {E}_1} is the total type- 2 2 object that embodies operation A \mathcal {A} .