{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:14Z","timestamp":1755220934729,"version":"3.43.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":["Studia Logica"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1023\/a:1027358927272","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T17:46:39Z","timestamp":1068399999000},"page":"205-219","source":"Crossref","is-referenced-by-count":18,"title":["Game Logic is Strong Enough for Parity Games"],"prefix":"10.1007","volume":"75","author":[{"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5253758_CR1","unstructured":"Arnold, A. and D. Niwi\u0143ski, Rudiments of \u03bc-calculus, Studies in Logic 146. North Holland, 2001."},{"issue":"2","key":"5253758_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J. C. Bradfield","year":"1998","unstructured":"Bradfield, J. C., \u2018The modal mu-calculus alternation hierarchy is strict'. Theoretical Computer Science 195(2):133-153, 1998.","journal-title":"Theoretical Computer Science"},{"key":"5253758_CR3","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., and C. S. Jutla. \u2018Tree automata, mu-calculus and determinacy\u2019, in 32nd Annual Symposium on Foundations of Computer Science, 368-377. IEEE, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"5253758_CR4","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., C. S. Jutla, and A. P. Sistla, \u2018Model checking in fragments of mu-calculus\u2019, in International Conference on Computer Aided Verification, LNCS 697:385-396. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"5253758_CR5","doi-asserted-by":"crossref","unstructured":"Emerson, E. A., \u2018Model checking and the mu-calculus\u2019, in N. Immerman and P. Kolaitis, (eds.), Descriptive Complexity and Finite Models, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 31. American Mathematical Society, 1997.","DOI":"10.1090\/dimacs\/031\/06"},{"key":"5253758_CR6","doi-asserted-by":"crossref","unstructured":"Janin, D., and I. Walukiewicz, \u2018On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic\u2019, in U. Montanari and V. Sassone, (eds.), Proceedings of the 7th International Conference on Concurrency Theory, CONCUR'96, LNCS 1119:263-277. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_60"},{"key":"5253758_CR7","unstructured":"Lenzi G., \u2018A hierarchy theorem for the mu-calculus\u2019, in F. Meyer auf der Heide and B. Monien, (eds.), Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, ICALP '96, LNCS 1099:87-97. Springer-Verlag, 1996."},{"issue":"4\/5","key":"5253758_CR8","first-page":"427","volume":"33","author":"D. Niwi\u0143ski","year":"1999","unstructured":"Niwi\u0143ski D., and H. Seidl, \u2018On distributive fixed-point expressions'. RAIRO Informatique Theorique, 33(4\/5):427-446, 1999.","journal-title":"RAIRO Informatique Theorique"},{"key":"5253758_CR9","first-page":"111","volume":"24","author":"R. Parikh","year":"1985","unstructured":"Parikh, R., \u2018The logic of games and its applications'. Annals of discrete mathematics, 24:111-140, 1985.","journal-title":"Annals of discrete mathematics"},{"key":"5253758_CR10","unstructured":"Pauly, M., \u2018Game constructions that are safe for bisimulation\u2019, in J. Gerbrandy, M. Marx, M. de Rijke, and Y. Venema, (eds.), JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, CD-ROM http:\/\/turing.wins.uva.nl\/~j50\/cdrom\/. Amsterdam University Press, 1999."},{"key":"5253758_CR11","doi-asserted-by":"crossref","unstructured":"Pauly, M., \u2018From Programs to Games: Invariance and Safety for Bisimulation\u2019 in Proceedings of 14th Annual Conference of the European Association for Computer Science Logic CSL 2000, LNCS 1862:586-496. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44622-2_33"},{"key":"5253758_CR12","unstructured":"Pauly, M., Logic for Social Software. PhD thesis, University of Amsterdam, 2001."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027358927272.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027358927272\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027358927272.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:26:19Z","timestamp":1754630779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027358927272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5253758"],"URL":"https:\/\/doi.org\/10.1023\/a:1027358927272","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}