Definability in games

DOI10.1007/978-3-642-15205-4_2MaRDI QIDQ3586029zbMATH OpenOpenAlexFDO

Authors Erich Grädel

Publication date 3 September 2010

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15205-4_2

zbMATH Keywords

definabilitygraph gamessurvey paper

Mathematics Subject Classification ID

Logic in computer science (03B70) Descriptive complexity and finite models (68Q19) Games involving graphs (91A43)

Recommendations

• Infinite games played on finite graphs
• scientific article; zbMATH DE number 4114620
• Once upon a time in the West. Determinacy, definability, and complexity of path games
• The many logics of graph games
• Banach-Mazur games on graphs

Cited in

(8)

• Game-theoretic inductive definability
• Infinite games and uniformization
• scientific article; zbMATH DE number 4039871 (Why is no real title available?)
• Weaves
• Infinite Games
• The many logics of graph games
• Graph games and logic design
• Comparing inductive and circular definitions: Parameters, complexity and games

This page was built for publication: Definability in games

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