LFCS, School of Informatics, University of Edinburgh, Edinburgh, EH9 3JZ, UK; firstname.lastname@example.org.
Drawing on an analogy with temporal fixpoint logic, we relate the arithmetic fixpoint definable sets to the winning positions of certain games, namely games whose winning conditions lie in the difference hierarchy over . This both provides a simple characterization of the fixpoint hierarchy, and refines existing results on the power of the game quantifier in descriptive set theory. We raise the problem of transfinite fixpoint hierarchies.
(Online publication November 15 2003)
Mathematics Subject Classification: