{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:35Z","timestamp":1746331415059,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_5","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"50-61","source":"Crossref","is-referenced-by-count":5,"title":["On the Decidability of MSO+U on Infinite Trees"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Gogacz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henryk","family":"Michalewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in \u03c9-regularity. In: LICS, pp. 285\u2013296 (2006)","DOI":"10.1109\/LICS.2006.17"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-30124-0_7","volume-title":"Computer Science Logic","author":"M. Boja\u0144czyk","year":"2004","unstructured":"Boja\u0144czyk, M.: A bounding quantifier. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 41\u201355. Springer, Heidelberg (2004)"},{"issue":"3","key":"5_CR3","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s00224-010-9279-2","volume":"48","author":"M. Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M.: Weak MSO with the unbounding quantifier. Theory Comput. Syst.\u00a048(3), 554\u2013576 (2011)","journal-title":"Theory Comput. Syst."},{"key":"5_CR4","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Weak MSO+U over infinite trees. In: STACS, pp. 648\u2013660 (2012)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 398\u2013409. Springer, Heidelberg (2008)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-02930-1_12","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2009","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 139\u2013150. Springer, Heidelberg (2009)"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.2307\/420965","volume":"6","author":"S. Feferman","year":"2000","unstructured":"Feferman, S., Friedman, H.M., Maddy, P., Steel, J.R.: Does mathematics need new axioms? The Bulletin of Symbolic Logic\u00a06(4), 401\u2013446 (2000)","journal-title":"The Bulletin of Symbolic Logic"},{"issue":"2-3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0003-4843(82)90004-3","volume":"23","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Shelah, S.: Monadic theory of order and topology in ZFC. Annals of Mathematical Logic\u00a023(2-3), 179\u2013198 (1982)","journal-title":"Annals of Mathematical Logic"},{"issue":"3-4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02297651","volume":"22","author":"Y. Gurevich","year":"1980","unstructured":"Gurevich, Y.: Existential interpretation II. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung\u00a022(3-4), 103\u2013120 (1980)","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"issue":"1","key":"5_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-2012-728","volume":"119","author":"S. Hummel","year":"2012","unstructured":"Hummel, S., Skrzypczak, M.: The topological complexity of mso+u and related automata models. Fundamenta Informaticae\u00a0119(1), 87\u2013111 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR11","unstructured":"Jech, T.: Set Theory. Springer (2002)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical descriptive set theory","author":"A. Kechris","year":"1995","unstructured":"Kechris, A.: Classical descriptive set theory. Springer, New York (1995)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kripke, S.A.: Semantical analysis of intuitionistic logic I. Studies in Logic and the Foundations of Mathematics (1965)","DOI":"10.1016\/S0049-237X(08)71685-9"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a0102(2), 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"5_CR15","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. of the American Math. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. of the American Math. Soc."},{"issue":"3","key":"5_CR16","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. The Annals of Mathematics\u00a0102(3), 379\u2013419 (1975)","journal-title":"The Annals of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:35Z","timestamp":1746264215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}