{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T22:48:17Z","timestamp":1792018097268,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212362","type":"print"},{"value":"9783540247494","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_2","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"4-18","source":"Crossref","is-referenced-by-count":18,"title":["Positional Determinacy of Infinite Games"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-39813-4_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2003","unstructured":"Berwanger, D., Gr\u00e4del, E., Kreutzer, S.: Once upon a time in the west, Determinacy, complexity and definability of path games. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 226\u2013240. Springer, Heidelberg (2003)"},{"key":"2_CR2","unstructured":"Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions (submitted for publication)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-45793-3_22","volume-title":"Computer Science Logic","author":"T. Cachat","year":"2002","unstructured":"Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a \u03c3\n                           3 winning cndition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 322\u2013336. Springer, Heidelberg (2002)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science (LICS 1997), pp. 99\u2013110 (1997)","DOI":"10.1109\/LICS.1997.614939"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"2_CR7","unstructured":"Gr\u00e4del, E., Walukiewicz, I.: Positional determinacy of games with infinitely many priorities (submitted for publication)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata and games. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 60\u201365 (1982)","DOI":"10.1145\/800070.802177"},{"key":"2_CR9","volume-title":"The Higher Infinite","author":"A. Kanamori","year":"1991","unstructured":"Kanamori, A.: The Higher Infinite. Springer, Heidelberg (1991)"},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A. Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0168-0072(94)90086-8","volume":"69","author":"N. Klarlund","year":"1994","unstructured":"Klarlund, N.: Progress measures, immediate determinacy, and a subset construction for tree automata. Annals of Pure and Applied Logic\u00a069, 243\u2013268 (1994)","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR12","unstructured":"Leone, S.: The Good, the Bad and the Ugly, with Clint Eastwood, Eli Wallach, Lee Van Cleef et al. (1966)"},{"key":"2_CR13","unstructured":"Leone, S.: Once Upon a Time in the West, with Charles Bronson, Claudia Cardinale, Henry Fonda et al. (1969)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.2307\/1971035","volume":"102","author":"D. Martin","year":"1975","unstructured":"Martin, D.: Borel determinacy. Annals of Mathematics\u00a0102, 336\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"2_CR15","series-title":"Mathematics from the Scottish Caf\u00e9","volume-title":"The Scottish Book","year":"1981","unstructured":"Mauldin, R. (ed.): The Scottish Book. Mathematics from the Scottish Caf\u00e9. Birkh\u00e4user, Basel (1981)"},{"key":"2_CR16","unstructured":"Mostowski, A.: Games with forbidden positions, Tech. Rep. Tech. Report 78, University of Gdansk (1991)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Pistore, M., Vardi, M.: The planning spectrum \u2014 one, two, three, infinity. In: Proc. 18th IEEE Symp. on Logic in Computer Science (2003)","DOI":"10.1109\/LICS.2003.1210063"},{"key":"2_CR18","volume-title":"Gulliver\u2019s Travels","author":"J. Swift","year":"1906","unstructured":"Swift, J.: Gulliver\u2019s Travels. George Routledge & Sons, London (1906) (first published in 1726)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"2_CR21","unstructured":"Zermelo, E.: \u00dcber eine Anwendung der Mengenlehre auf die Theorie des Schachpiels. In: Proc. 5th Internat. Congr. Mathematics, Cambridge, vol.\u00a02, pp. 501\u2013504 (1913)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science\u00a0200, 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:08:16Z","timestamp":1553058496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}