The following pages link to Complexity of winning strategies (Q2554653):
Displaying 9 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Computing maximal chains (Q453200) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- Meeting of the Association for Symbolic Logic Florence, Italy 1982 (Q3686697) (← links)
- CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY (Q4977218) (← links)
- Feferman on Set Theory: Infinity up on Trial (Q5214797) (← links)
- Open determinacy for class games (Q5351852) (← links)
- On Martin’s pointed tree theorem (Q5740206) (← links)
- SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746) (← links)
