|
|||||||||||||||
Theoret. Informatics Appl. 37, 1-15 (2003)
DOI: 10.1051/ita:2003011
Fixpoints, games and the difference hierarchy
Julian C. BradfieldLFCS, School of Informatics, University of Edinburgh, Edinburgh, EH9 3JZ, UK; jcb@inf.ed.ac.uk.
Abstract
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.
Mathematics Subject Classification. 03E15, 68Q45.
Key words: Descriptive set theory -- fixpoint -- game quantifier -- induction.
The main part of this paper was first presented at CSL'99 in Madrid [3]; the final part is based on a talk given at FICS 2001 in Florence, published in RAIRO: Theoret. Informatics Appl., volume 36, No. 2 (2002).
© EDP Sciences 2003
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook