{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:41Z","timestamp":1725566741373},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_27","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"384-396","source":"Crossref","is-referenced-by-count":3,"title":["Transfinite Extension of the Mu-Calculus"],"prefix":"10.1007","author":[{"given":"Julian","family":"Bradfield","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Duparc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Quickert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ita:2003011","volume":"37","author":"J. Bradfield","year":"2003","unstructured":"Bradfield, J.: Fixpoints, Games and the Difference Hierarchy. Theoretical Informatics and Applications\u00a037, 1\u201315 (2003)","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/B978-044482830-9\/50022-9","volume-title":"Handbook of Process Algebra","author":"J. Bradfield","year":"2001","unstructured":"Bradfield, J., Stirling, C.: Modal Logics and mu-calculi: An Introduction. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 293\u2013329. Elsevier Science B.V., Amsterdam (2001)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2694911","volume":"66","author":"J. Duparc","year":"2001","unstructured":"Duparc, J.: Wadge Hierarchy and Veblen Hierarchy, Part I: Borel sets of finite rank. Journal of Symbolic Logic\u00a066, 56\u201386 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"27_CR4","unstructured":"Gr\u00e4del, E., Walukiewicz, I.: Positional Determinacy of Games with Infinitely Many Priorities (manuscript)"},{"key":"27_CR5","doi-asserted-by":"crossref","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, Heidelberg (1995)"},{"key":"27_CR6","series-title":"Lecture notes in Mathematics","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0071692","volume-title":"Cabal Seminar 79-81","author":"A. Louveau","year":"1983","unstructured":"Louveau, A.: Some results in the Wadge hierarchy of Borel sets. In: Kechris, A., Martin, D., Moschovakis, Y. (eds.) Cabal Seminar 79-81. Lecture notes in Mathematics, pp. 28\u201355. Springer, Heidelberg (1983)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/2275338","volume":"58","author":"R.S. Lubarski","year":"1993","unstructured":"Lubarski, R.S.: \u03bc-definable sets of integers. Journal of Symbolic Logic\u00a058, 291\u2013313 (1993)","journal-title":"Journal of Symbolic Logic"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"336","DOI":"10.2307\/1971035","volume":"102","author":"D. Martin","year":"1975","unstructured":"Martin, D.: Borel determinacy. Annals of Mathematics\u00a0102, 336\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00039-X","volume":"189","author":"D. Niwi\u0144ski","year":"1997","unstructured":"Niwi\u0144ski, D.: Fixed point characterisation of infinite behavior of finite state systems. Theoretical Computer Science\u00a0189, 1\u201369 (1997)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:15Z","timestamp":1619506455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11538363_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}