Abstract
Gale-Stewart games illustrate the applications of \(\Pi_1^0\)-classes. In a Gale-Stewart game there are two players who alternately choose elements \(a_i \in \left\{0.1\right\}\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Gale-Stewart Games. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31932-7
Online ISBN: 978-3-642-31933-4
eBook Packages: Computer ScienceComputer Science (R0)