Complexity of winning strategies
From MaRDI portal
Publication:2554653
DOI10.1016/0012-365X(72)90086-6zbMath0243.90052OpenAlexW2039077796MaRDI QIDQ2554653
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(72)90086-6
Related Items (9)
Infinite games specified by 2-tape automata ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Open determinacy for class games ⋮ Computing maximal chains ⋮ On Martin’s pointed tree theorem ⋮ Feferman on Set Theory: Infinity up on Trial ⋮ CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ Meeting of the Association for Symbolic Logic Florence, Italy 1982
Cites Work
This page was built for publication: Complexity of winning strategies