Philip Welch
(University of Bristol)
Generalised Transfinite Turing Machines and Strategies for Games

For levels of determinacy for two person perfect information games which are for open or Σ02 games in the arithmetic hierarchy, strategies can be found related to certain classes of monotone inductive definitions. We try to expand this to the next level using generalised notions both of transfinite Turing machine and inductive definition.