Complexity of winning strategies

DOI10.1016/0012-365X(72)90086-6zbMath0243.90052OpenAlexW2039077796MaRDI QIDQ2554653

Andreas Blass

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

Mathematics Subject Classification ID

2-person games (91A05)

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 ATR₀ IN THE WEIHRAUCH LATTICE ⋮ Meeting of the Association for Symbolic Logic Florence, Italy 1982

Cites Work

• Measurable cardinals and analytic games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of winning strategies