{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:12:50Z","timestamp":1739337170664,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"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-04027-6_11","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"117-131","source":"Crossref","is-referenced-by-count":1,"title":["Cardinality Quantifiers in MLO over Trees"],"prefix":"10.1007","author":[{"given":"Vince","family":"B\u00e1r\u00e1ny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Decidability and Generalized Quantifiers","author":"A. Baudisch","year":"1980","unstructured":"Baudisch, A., Seese, D., Tuschik, H.P., Weese, M.: Decidability and Generalized Quantifiers. Akademie-Verlag, Berlin (1980)"},{"unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)","key":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic Structures. In: Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000, pp. 51\u201362 (2000)","key":"11_CR3","DOI":"10.1109\/LICS.2000.855755"},{"issue":"2:4","key":"11_CR4","first-page":"1","volume":"3","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T., L\u00f6ding, C.: Transforming structures by set interpretations. Logical Methods in Computer Science\u00a03(2:4), 1\u201336 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"11_CR5","first-page":"479","volume-title":"Model-Theoretical Logics","author":"Y. Gurevich","year":"1985","unstructured":"Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretical Logics, pp. 479\u2013506. Springer, Heidelberg (1985)"},{"doi-asserted-by":"crossref","unstructured":"Hj\u00f6rth, G., Khoussainov, B., Montalb\u00e1n, A., Nies, A.: From automatic structures to Borel structures. In: 23rd Symp. on Logic in Computer Science, LICS (2008)","key":"11_CR6","DOI":"10.1109\/LICS.2008.28"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11690634_22","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Kuske","year":"2006","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of \u03c9-automatic structures. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 322\u2013336. Springer, Heidelberg (2006)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2178\/jsl\/1208358745","volume":"73","author":"D. Kuske","year":"2008","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of omega-automatic structures. Journal of Symbolic Logic\u00a073, 129\u2013150 (2008)","journal-title":"Journal of Symbolic Logic"},{"key":"11_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. Journal of Symbolic Logic\u00a061, 1206\u20131227 (1996)","journal-title":"Journal of Symbolic Logic"},{"issue":"5","key":"11_CR10","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. Information and Control\u00a09(5), 521\u2013530 (1966)","journal-title":"Information and Control"},{"key":"11_CR11","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Descriptive Set Theory","author":"Y.N. Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0100. North-Holland Publishing Company, Amsterdam (1980)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-54345-7_80","volume-title":"Mathematical Foundations of Computer Science 1991","author":"D. Niwi\u0144ski","year":"1991","unstructured":"Niwi\u0144ski, D.: On the cardinality of sets of infinite trees recognizable by finite automata. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 367\u2013376. Springer, Heidelberg (1991)"},{"issue":"303","key":"11_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(02)00452-8","volume":"1","author":"D. Niwi\u0144ski","year":"2003","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theoretical Computer Science\u00a01(303), 215\u2013231 (2003)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","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. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Annals of Mathematics\u00a0102, 379\u2013419 (1975)","journal-title":"Annals of Mathematics"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-63246-8_8","volume-title":"Structures in Logic and Computer Science","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 118\u2013143. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:11:45Z","timestamp":1739333505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}