{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:53Z","timestamp":1760202653777},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_34","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"391-404","source":"Crossref","is-referenced-by-count":1,"title":["Composition with Algebra at the Background"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_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 arithmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"34_CR2","first-page":"1","volume-title":"Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr .)","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.), pp. 1\u201311. Stanford Univ. Press, Stanford (1962)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-22012-8_9","volume-title":"Automata, Languages and Programming","author":"O. Carton","year":"2011","unstructured":"Carton, O., Colcombet, T., Puppis, G.: Regular languages of words over countable linear orderings. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 125\u2013136. Springer, Heidelberg (2011)"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S. Feferman","year":"1959","unstructured":"Feferman, S., Vaught, R.L.: The first order properties of products of algebraic systems. Fund. Math.\u00a047, 57\u2013103 (1959)","journal-title":"Fund. Math."},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"946","DOI":"10.2307\/2586579","volume":"65","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y., Rabinovich, A.M.: Definability and undefinability with real order at the background. J. Symb. Log.\u00a065(2), 946\u2013958 (2000)","journal-title":"J. Symb. Log."},{"doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Shelah, S.: Monadic theory of order and topology in zfc. In: Ann. of Math. Logic, vol.\u00a023, pp. 179\u2013198. North-Holland Publishing Compagny (1982)","key":"34_CR7","DOI":"10.1016\/0003-4843(82)90004-3"},{"key":"34_CR8","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."},{"issue":"3","key":"34_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Ann. of Math. (2) 102(3), 379\u2013419 (1975)","journal-title":"Ann. of Math. (2)"},{"key":"34_CR10","first-page":"103","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and monadic second order logic (Russian). Siberian Math. J\u00a03, 103\u2013131 (1962)","journal-title":"Siberian Math. J"},{"key":"34_CR11","first-page":"569","volume":"70","author":"B.A. Trakthenbrot","year":"1950","unstructured":"Trakthenbrot, B.A.: The impossibility of an algorithm for the decision problem for finite domains (Russian). Doklady Academii Nauk SSSR\u00a070, 569\u2013572 (1950)","journal-title":"Doklady Academii Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:23:40Z","timestamp":1557750220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}