{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:56Z","timestamp":1725490256141},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_15","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"161-176","source":"Crossref","is-referenced-by-count":11,"title":["MSO on the Infinite Binary Tree: Choice and Order"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Carayol","sequence":"first","affiliation":[]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","first-page":"51","volume-title":"Proc. of LICS\u00a02000","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proc. of LICS\u00a02000, pp. 51\u201362. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1994916","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"15_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press (1962)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"issue":"1\u20133","key":"15_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00618-7","volume":"297","author":"O. Carton","year":"2003","unstructured":"Carton, O., Michel, M.: Unambiguous b\u00fcchi automata. Theor. Comput. Sci.\u00a0297(1\u20133), 37\u201381 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal hierarchy of infinite graphs. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"15_CR7","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.2307\/2273673","volume":"48","author":"Y. Gurevich","year":"1983","unstructured":"Gurevich, Y., Shelah, S.: Rabin\u2019s uniformization problem. J. Symb. Log.\u00a048(4), 1105\u20131119 (1983)","journal-title":"J. Symb. Log."},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.2307\/2275812","volume":"61","author":"S. Lifsches","year":"1996","unstructured":"Lifsches, S., Shelah, S.: Uniformization, choice functions and well orders in the class of trees. J. Symb. Log.\u00a061(4), 1206\u20131227 (1996)","journal-title":"J. Symb. Log."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/2586591","volume":"63","author":"S. Lifsches","year":"1998","unstructured":"Lifsches, S., Shelah, S.: Uniformization and skolem functions in the class of trees. J. Symb. Log.\u00a063(1), 103\u2013127 (1998)","journal-title":"J. Symb. Log."},{"key":"15_CR11","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Ambiguity problem for automata on infinite trees (Unpublished note)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02280817","volume":"17","author":"D. Siefkes","year":"1975","unstructured":"Siefkes, D.: The recursive sets in certain monadic second order fragments of arithmetic. Arch. f\u00fcr mat. Logik und Grundlagenforschung\u00a017, 71\u201380 (1975)","journal-title":"Arch. f\u00fcr mat. Logik und Grundlagenforschung"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455 (1997)","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:45Z","timestamp":1619520345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}