{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:40:31Z","timestamp":1736559631023,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_27","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"411-425","source":"Crossref","is-referenced-by-count":2,"title":["Game Quantification on Automatic Structures and Hierarchical Model Checking Games"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Kaiser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11672142_23","volume-title":"STACS 2006","author":"V. Barany","year":"2006","unstructured":"Barany, V.: Invariants of Automatic Presentations and Semi-Synchronous transductions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 289\u2013300. Springer, Heidelberg (2006)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-45220-1_8","volume-title":"Computer Science Logic","author":"J.C. Bradfield","year":"2003","unstructured":"Bradfield, J.C.: Parity of Imperfection or Fixing Independence. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 72\u201385. Springer, Heidelberg (2003)"},{"key":"27_CR3","unstructured":"B\u00fcchi, J.R.: On Decision Method in Restricted Second Order Arithmetic. In: Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite Presentations of Infinite Structures: Automata and Interpretations. Theory of Computing Systems\u00a037, 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11590156_1","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"K. Chatterjee","year":"2005","unstructured":"Chatterjee, K., Henzinger, T.A.: Semiperfect-Information Games. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, A., Jutla, C.: Tree automata, mucalculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"27_CR7","series-title":"Annals of Mathematics Studies","first-page":"245","volume-title":"Contributions to the Theory of Games","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite Games with Perfect Information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol.\u00a0II, pp. 245\u2013266. Princeton University Press, Princeton (1953)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: Model Checking Games. In: Proceedings of WOLLIC 2002. Electronic Notes in Theoretical Computer Science, vol.\u00a067 (2002)","DOI":"10.1016\/S1571-0661(04)80538-3"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Kolaitis, P.G.: Game Quantification. In: Barwise, J., Feferman, S. (eds.) Model Theoretic Logics, pp. 365\u2013422 (1985)","DOI":"10.1017\/9781316717158.015"},{"key":"27_CR11","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":"27_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating Finite Automata on \u03c9-words. Theoretical Computer Science\u00a032, 321\u2013330 (1984)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:17:57Z","timestamp":1736558277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11874683_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}