Unforgettable Forgetful Determinacy
From MaRDI portal
Publication:4304495
DOI10.1093/logcom/4.3.273zbMath0860.03012OpenAlexW2089344401MaRDI QIDQ4304495
Publication date: 21 April 1997
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/4.3.273
decidabilityinfinite gameswinning strategymonadic second-order theoriesforgetful determinacy theoremgraph-gamesrestricted-memory strategies
Games involving graphs (91A43) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)
Related Items (6)
Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra ⋮ A GENERAL NOTION OF UNIFORM STRATEGIES ⋮ Gurevich-Harrington's games defined by finite automata ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ Infinite games played on finite graphs
This page was built for publication: Unforgettable Forgetful Determinacy
