Abstract
In the previous chapters, we explored the connections between logic and games in a generic way, without relating to a specific representation of winning conditions in games. In this chapter, we investigate explicitly given winning conditions in terms of the complexity of strategies that are needed to win games with a fixed condition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kaiser, Ł. (2011). Memory Structures for Infinitary Games. In: Logic and Games on Automatic Structures. Lecture Notes in Computer Science(), vol 6810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22807-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22807-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22806-3
Online ISBN: 978-3-642-22807-0
eBook Packages: Computer ScienceComputer Science (R0)