{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:42Z","timestamp":1760202702210,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_29","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"362-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Baire Category Quantifier in Monadic Second Order Logic"],"prefix":"10.1007","author":[{"given":"Henryk","family":"Michalewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Mio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77050-3_15","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"C Baier","year":"2007","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Probabilistic and topological semantics for timed automata. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 179\u2013191. Springer, Heidelberg (2007)"},{"key":"29_CR2","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-04027-6_11","volume-title":"Computer Science Logic","author":"V B\u00e1r\u00e1ny","year":"2009","unstructured":"B\u00e1r\u00e1ny, V., Kaiser, \u0141., Rabinovich, A.: Cardinality quantifiers in MLO over trees. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 117\u2013131. Springer, Heidelberg (2009)"},{"issue":"1","key":"29_CR4","first-page":"125","volume":"286","author":"R Barua","year":"1984","unstructured":"Barua, R.: $$R$$-sets and category. Trans. Amer. Math. Soc. 286(1), 125\u2013158 (1984)","journal-title":"Trans. Amer. Math. Soc."},{"key":"29_CR5","unstructured":"Bertrand, N., Fearnley, J., Schewe, S.: Bounded satisfiability for PCTL. In: Proc. of CSL (2012)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Forejt, V., Kret\u00ednsk\u00fd, J., Kucera, A.: The satisfiability problem for probabilistic CTL. In: Proc. of LICS, pp. 391\u2013402 (2008)","DOI":"10.1109\/LICS.2008.21"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Carayol, A., Haddad, A., Serre, O.: Randomization in automata on infinite trees. ACM Transactions on Computational Logic 15(3) (2014)","DOI":"10.1145\/2629336"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Carayol, A., Serre, O.: How good is a strategy in a game with nature? In: To appear in Proc. LICS (2015)","DOI":"10.1109\/LICS.2015.62"},{"key":"29_CR9","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)"},{"issue":"5","key":"29_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6(5), 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Hjorth, G., Khoussainov, B., Montalban, A., Nies, A.: From automatic structures to Borel structures. In: Proc. of LICS, pp. 431\u2013441 (2008)","DOI":"10.1109\/LICS.2008.28"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer (1994)","DOI":"10.1007\/978-1-4612-4190-4"},{"issue":"1&2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"DE Muller","year":"1995","unstructured":"Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin. McNaughton and Safra. Theor. Comput. Sci. 141(1&2), 69\u2013107 (1995)","journal-title":"McNaughton and Safra. Theor. Comput. Sci."},{"key":"29_CR14","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of American Mathematical Society 141, 1\u201335 (1969)","journal-title":"Transactions of American Mathematical Society"},{"key":"29_CR15","unstructured":"Serre, O.: Playing with Trees and Logic. Habilitation Thesis, Universit\u00e9 Paris Diderot (Paris 7) (2015)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Staiger, L.: Rich omega-words and monadic second-order arithmetic. In: Proc. of CSL, pp. 478\u2013490 (1997)","DOI":"10.1007\/BFb0028032"},{"key":"29_CR17","unstructured":"Steinhorn, C.I.: Chapter XVI: Borel Structures and Measure and Category Logics. Perspectives in Mathematical Logic, vol. 8. Springer (1985)"},{"key":"29_CR18","unstructured":"Thomas, W.: On chain logic, path logic, and first-order logic over infinite trees. In: Proc. of LICS, pp. 245\u2013256 (1987)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, pp. 389\u2013455. Springer (1996)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Vaught, R.: Invariant sets in topology and logic. Fund. Math., 82, 269\u2013294 (1974\/1975), Collection of articles dedicated to Andrzej Mostowski on his sixtieth birthday, VII","DOI":"10.4064\/fm-82-3-269-294"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"V\u00f6lzer, H., Varacca, D.: Defining fairness in reactive and concurrent systems. Journal of the ACM 59(3) (2012)","DOI":"10.1145\/2220357.2220360"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:26:25Z","timestamp":1675272385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}