The search session has expired. Please query the service again.
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.
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.
Download Results (CSV)