Fixpoint alternation and the game quantifier

DOI10.1007/3-540-48168-0_25MaRDI QIDQ4945237zbMATH OpenFDO

Authors Julian Bradfield

Publication date 23 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_25

zbMATH Keywords

arithmetic fixpoint definable setsdescriptive set theorydifference hierarchyfixpoint hierarchygame quantifiermodal mu-calculusparity gametemporal fixpoint logictemporal logicwinning positions

Mathematics Subject Classification ID

Temporal logic (03B44) Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Descriptive set theory (03E15) 2-person games (91A05)

Recommendations

• Games for topological fixpoint logic
• Non-regular fixed-point logics and games
• scientific article; zbMATH DE number 515730
• Fixpoints, games and the difference hierarchy
• Strong functors and interleaving fixpoints in game semantics
• Tarski's fixpoint lemma and combinatorial games
• Generalized quantifiers and pebble games on finite structures
• Fixed-point logics and solitaire games
• Least and Greatest Fixpoints in Game Semantics
• Positional games and QBF: the corrective encoding

Cited in

(5)

• Generalized quantifiers and pebble games on finite structures
• Fixpoints, games and the difference hierarchy
• Fold/unfold transformations for fixpoint logic
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Temporal verification of programs via first-order fixpoint logic

This page was built for publication: Fixpoint alternation and the game quantifier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945237)