BLC 2010

Infinite games in second order arithmetic and arithmetical transfinite recursion
Takako Nemoto
It is known that most important subsystems of second order arithmetic can be characterized by weak determinacy schemata. In this talk, we consider the relationship between determinacy schemata and ACA_0^+ , the system ACA_0 plus the assertion that for any X ⊆ N, the \omega-th Turing jump TJ(ω,X) exists.