{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:03:37Z","timestamp":1762297417765},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_1","type":"book-chapter","created":{"date-parts":[[2009,3,26]],"date-time":"2009-03-26T21:13:03Z","timestamp":1238101983000},"page":"1-14","source":"Crossref","is-referenced-by-count":19,"title":["Facets of Synthesis: Revisiting Church\u2019s Problem"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Thomas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arihmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"1_CR2","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E., et al. (eds.) Proc. 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press (1962)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc.\u00a0138, 367\u2013378 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR4","first-page":"3","volume-title":"Summaries of the Summer Institute of Symbolic Logic","author":"A. Church","year":"1957","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol.\u00a0I, pp. 3\u201350. Cornell Univ., Ithaca (1957)"},{"key":"1_CR5","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Proc. Int. Congr. Math. 1962, Inst. Mittag-Leffler, Djursholm, Sweden, pp. 23\u201335 (1963)"},{"key":"1_CR6","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"1_CR7","first-page":"368","volume-title":"Proc. 32nd FoCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus, and determinacy. In: Proc. 32nd FoCS 1991, pp. 368\u2013377. IEEE Comp. Soc. Press, Los Alamitos (1991)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for fragments of the \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"1_CR9","unstructured":"Fischer, D., Gr\u00e4del, E., Kaiser, L.: Model checking games for the quantitative \u03bc-Calculus. In: Albers, S., Weil, P. (eds.) Proc. STACS 2008, pp. 301\u2013312 (2008)"},{"key":"1_CR10","first-page":"60","volume-title":"Proc. 14th ACM Symp. on the Theory of Computing","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th ACM Symp. on the Theory of Computing, pp. 60\u201365. ACM Press, New York (1982)"},{"key":"1_CR11","unstructured":"Gr\u00e4del, E.: Banach-Mazur games on graphs. In: Proc. FSTTCS 2008 (2008), \n                    \n                      http:\/\/drops.dagstuhl.de\/portals\/FSTTCS08"},{"key":"1_CR12","first-page":"245","volume":"28","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite games with perfect information. Ann. Math. Studies\u00a028, 245\u2013266 (1953)","journal-title":"Ann. Math. Studies"},{"key":"1_CR13","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":"1_CR14","unstructured":"Hausdorff, F.: Grundz\u00fcge der Mengenlehre, Leipzig (1914)"},{"key":"1_CR15","first-page":"45","volume-title":"Proc. ICALP 1972","author":"F.A. Hosch","year":"1972","unstructured":"Hosch, F.A., Landweber, L.H.: Finite delay solutions for sequential conditions. In: Nivat, M. (ed.) Proc. ICALP 1972, pp. 45\u201360. North-Holland, Amsterdam (1972)"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995)"},{"key":"1_CR17","unstructured":"McNaughton, R.: Finite-state infinite games, Project MAC Rep., MIT, Cambridge, Mass (September 1965)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Contr.\u00a09, 521\u2013530 (1966)","journal-title":"Inf. Contr."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume-title":"Computation Theory","author":"A.W. Mostowski","year":"1984","unstructured":"Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 157\u2013168. Springer, Heidelberg (1984)"},{"key":"1_CR20","first-page":"39","volume":"22","author":"H. Putnam","year":"1957","unstructured":"Putnam, H.: Decidability and essential undecidability. JSL\u00a022, 39\u201354 (1957)","journal-title":"JSL"},{"key":"1_CR21","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/013","volume-title":"Automata on infinite objects and Church\u2019s Problem","author":"M.O. Rabin","year":"1972","unstructured":"Rabin, M.O.: Automata on infinite objects and Church\u2019s Problem. Amer. Math. Soc., Providence (1972)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-74915-8_9","volume-title":"Computer Science Logic","author":"A. Rabinovich","year":"2007","unstructured":"Rabinovich, A., Thomas, W.: Logical Refinements of Church\u2019s Problem. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 69\u201383. Springer, Heidelberg (2007)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/2275522","volume":"60","author":"V. Selivanov","year":"1995","unstructured":"Selivanov, V.: Fine hierarchies and Boolean terms. J. Smb. Logic\u00a060, 289\u2013317 (1995)","journal-title":"J. Smb. Logic"},{"key":"1_CR25","unstructured":"Thomas, W.: Solution of Church\u2019s Problem: A tutorial. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Texts on Logic and Games, vol.\u00a05, pp. 211\u2013236. Amsterdam Univ. Press"},{"key":"1_CR26","volume-title":"Finite Automata. Behavior and Synthesis","author":"B.A. Trakhtenbrot","year":"1973","unstructured":"Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata. Behavior and Synthesis. North-Holland, Amsterdam (1973)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T03:21:53Z","timestamp":1551928913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}