{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:09:39Z","timestamp":1742976579812,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_26","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"303-314","source":"Crossref","is-referenced-by-count":5,"title":["Measure Properties of Game Tree Languages"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Gogacz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henryk","family":"Michalewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Mio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4\/5","key":"26_CR1","first-page":"329","volume":"33","author":"A. Arnold","year":"1999","unstructured":"Arnold, A.: The \u03bc-calculus alternation-depth hierarchy is strict on binary trees. ITA\u00a033(4\/5), 329\u2013340 (1999)","journal-title":"ITA"},{"issue":"1-3","key":"26_CR2","first-page":"19","volume":"81","author":"A. Arnold","year":"2007","unstructured":"Arnold, A., Niwi\u0144ski, D.: Continuous separation of game languages. Fundamenta Informaticae\u00a081(1-3), 19\u201328 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR3","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press (2008)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1214\/aop\/1176995576","volume":"6","author":"D. Blackwell","year":"1978","unstructured":"Blackwell, D.: Borel\u2013programmable functions. Ann. of Probability\u00a06, 321\u2013324 (1978)","journal-title":"Ann. of Probability"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J. Bradfield","year":"1996","unstructured":"Bradfield, J.: The modal mu-calculus alternation hierarchy is strict. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 233\u2013246. Springer, Heidelberg (1996)"},{"issue":"1","key":"26_CR6","first-page":"1","volume":"37","author":"J.C. Bradfield","year":"2003","unstructured":"Bradfield, J.C.: Fixpoints, games and the difference hierarchy. ITA\u00a037(1), 1\u201315 (2003)","journal-title":"ITA"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/11538363_27","volume-title":"Computer Science Logic","author":"J.C. Bradfield","year":"2005","unstructured":"Bradfield, J.C., Duparc, J., Quickert, S.: Transfinite extension of the mu-calculus. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 384\u2013396. Springer, Heidelberg (2005)"},{"issue":"2","key":"26_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4064\/fm-115-2-97-105","volume":"115","author":"J.P. Burgess","year":"1983","unstructured":"Burgess, J.P.: Classical hierarchies from a modern standpoint. II. R-sets. Fund. Math.\u00a0115(2), 97\u2013105 (1983)","journal-title":"Fund. Math."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-28644-8_31","volume-title":"CONCUR 2004 - Concurrency Theory","author":"D. Varacca","year":"2004","unstructured":"Varacca, D., V\u00f6lzer, H., Winskel, G.: Probabilistic event structures and domains. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 481\u2013496. Springer, Heidelberg (2004)"},{"key":"26_CR10","unstructured":"Jech, T.: Set Theory. Springer Monographs in Mathematics. Springer (2002)"},{"key":"26_CR11","unstructured":"Kanove\u01d0, V.G.: A. N. Kolmogorov\u2019s ideas in the theory of operations on sets. Uspekhi Mat. Nauk. 43(6(264)), 93\u2013128 (1988)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Kechris, A.: Classical descriptive set theory. Springer, New York (1995)","DOI":"10.1007\/978-1-4612-4190-4"},{"key":"26_CR13","unstructured":"Kolmogorov, A.: Operations sur des ensembles. Mat. Sb.\u00a035, 415\u2013422 (1928); (in Russian, summary in French)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Results on the propositional mu-calculus. In: Theoretical Computer Science, pp. 333\u2013354 (1983)","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"26_CR15","unstructured":"Kudlek, M.: Probability in Petri Nets. Fundamenta Informaticae, 67(1) (2005)"},{"key":"26_CR16","first-page":"3","volume":"40","author":"A.A. Lyapunov","year":"1953","unstructured":"Lyapunov, A.A.: $\\mathcal R$-sets. Trudy Mat. Inst. Steklov.\u00a040, 3\u201367 (1953)","journal-title":"Trudy Mat. Inst. Steklov."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Michalewski, H., Niwi\u0144ski, D.: On topological completeness of regular tree languages. In: Constable, R.L., Silva, A. (eds.) Kozen Festschrift. LNCS, vol.\u00a07230, pp. 165\u2013179. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29485-3_11"},{"key":"26_CR18","unstructured":"Mio, M.: Game Semantics for Probabilistic \u03bc-Calculi. PhD thesis, School of Informatics, University of Edinburgh (2012)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Mio, M.: Probabilistic Modal \u03bc-Calculus with Independent product. Logical Methods in Computer Science 8(4) (2012)","DOI":"10.2168\/LMCS-8(4:18)2012"},{"key":"26_CR20","unstructured":"Selivanowski, E.: Sur une classe d\u2019ensembles effectifs (ensembles C). Mat. Sb.\u00a035, 379\u2013413 (1928) (in Russian, summary in French)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Winskel, G.: Distributed probabilistic strategies. In: Proceedings of MFPS (2013)","DOI":"10.1016\/j.entcs.2013.09.024"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T21:22:19Z","timestamp":1674163339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}