Fixpoints, games and the difference hierarchy

DOI10.1051/ita:2003011zbMath1043.03038OpenAlexW2148212355MaRDI QIDQ4462675

Julian Bradfield

Publication date: 18 May 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_1_1_0

zbMATH Keywords

parity gamesdescriptive set theorydifference hierarchymodal mu-calculusgame quantifierfixpoint hierarchyarithmetic fixpoint definable setsGale-Steward gamesmu-arithmetictransfinite fixpoint hierarchies

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15) Games involving topology, set theory, or logic (91A44) Logic in computer science (03B70)

Related Items (3)

On fixpoint arithmetic and infinite time Turing machines ⋮ Measure Properties of Game Tree Languages ⋮ Measure properties of regular sets of trees

Cites Work

• Fine hierarchy of regular \(\omega\)-languages
• Descriptive set theory
• The modal mu-calculus alternation hierarchy is strict
• Fixed point characterization of infinite behavior of finite-state systems
• Classical hierarchies from a modern standpoint. Part I. C-sets
• The finite levels of the hierarchy of effective R-sets
• μ-definable sets of integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixpoints, games and the difference hierarchy