{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:39:13Z","timestamp":1725842353720},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276823"},{"type":"electronic","value":"9783319276830"}],"license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-27683-0_19","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T21:16:29Z","timestamp":1449695789000},"page":"267-282","source":"Crossref","is-referenced-by-count":4,"title":["Measure Quantifier in Monadic Second Order Logic"],"prefix":"10.1007","author":[{"given":"Henryk","family":"Michalewski","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Mio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2108242.2108243","volume":"59","author":"C Baier","year":"2012","unstructured":"Baier, C., Gr\u00f6sser, M., Bertrand, N.: Probabilistic \n                    \n                      \n                    \n                    $$\\omega $$\n                  -automata. J. ACM 59(1), 1 (2012)","journal-title":"J. ACM"},{"key":"19_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/978-3-662-43951-7_5","volume-title":"Automata, Languages, and Programming","author":"M Bojanczyk","year":"2014","unstructured":"Bojanczyk, M., Gogacz, T., Michalewski, H., Skrzypczak, M.: On the decidability of MSO+U on infinite trees. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 50\u201361. Springer, Heidelberg (2014)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Forejt, V., Kret\u00ednsk\u00fd, J., Kucera, A.: The satisfiability problem for probabilistic CTL. In: Proceedings of LICS, pp. 391\u2013402 (2008)","DOI":"10.1109\/LICS.2008.21"},{"key":"19_CR5","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science, Proceedings, pp. 1\u201311. American Mathematical Society (1962)"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2629336","volume":"15","author":"A Carayol","year":"2014","unstructured":"Carayol, A., Haddad, A., Serre, O.: Randomization in automata on infinite trees. ACM Trans. Comput. Logic 15(3), 24 (2014)","journal-title":"ACM Trans. Comput. Logic"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H Gimbert","year":"2010","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-662-44522-8_26","volume-title":"Mathematical Foundations of Computer Science 2014","author":"T Gogacz","year":"2014","unstructured":"Gogacz, T., Michalewski, H., Mio, M., Skrzypczak, M.: Measure properties of game tree languages. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 303\u2013314. Springer, Heidelberg (2014)"},{"key":"19_CR9","volume-title":"Classical Descriptive Set Theory","author":"AS Kechris","year":"1994","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer Verlag, New York (1994)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Lando, T.A.: Completeness of S4 for the lebesgue measure algebra. J. Philos. Logic (2010)","DOI":"10.1007\/s10992-010-9161-3"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"McKinsey, J.C.C., Tarski, A.: The algebra of topology. Ann. Math. (1944)","DOI":"10.2307\/1969080"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-662-47666-6_29","volume-title":"Automata, Languages, and Programming","author":"H Michalewski","year":"2015","unstructured":"Michalewski, H., Mio, M.: Baire category quantifier in monadic second order logic. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 362\u2013374. Springer, Heidelberg (2015)"},{"key":"19_CR13","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1090\/S0002-9939-1958-0093479-4","volume":"9","author":"RM Robinson","year":"1958","unstructured":"Robinson, R.M.: Restricted set-theoretical definitions in arithmetic. Proc. Amer. Math. Soc. 9, 238\u2013242 (1958)","journal-title":"Proc. Amer. Math. Soc."},{"key":"19_CR15","unstructured":"Steinhorn, C.I.: Borel Structures and Measure and Category Logics. In: Model-theoretic logics. Perspectives in Mathematical Logic, vol. 8, Chap. XVI. Springer-Verlag, New York (1985). \n                    http:\/\/projecteuclid.org\/euclid.pl\/1235417282"},{"key":"19_CR16","unstructured":"Thomas, W.: On chain logic, path logic, and first-order logic over infinite trees. In: Proceedings of LICS, pp. 245\u2013256 (1987)"},{"key":"19_CR17","first-page":"389","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1996","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Berlin (1996)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27683-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:20:26Z","timestamp":1559337626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27683-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"ISBN":["9783319276823","9783319276830"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27683-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}