Winning strategies for infinite games: from large cardinals to computer science extended abstract
From MaRDI portal
Publication:1885038
DOI10.1016/J.TCS.2004.03.029zbMath1098.91517OpenAlexW1997033389MaRDI QIDQ1885038
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.029
Noncooperative games (91A10) Game theory (91A99) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Large cardinals (03E55)
Cites Work
This page was built for publication: Winning strategies for infinite games: from large cardinals to computer science extended abstract
