{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:27Z","timestamp":1725548907445},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_8","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"97-109","source":"Crossref","is-referenced-by-count":4,"title":["The Variable Hierarchy of the \u03bc-Calculus Is Strict"],"prefix":"10.1007","author":[{"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacomo","family":"Lenzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1051\/ita:1999121","volume":"33","author":"A. Arnold","year":"1999","unstructured":"Arnold, A.: The mu-calculus alternation-depth is strict on binary trees. RAIRO Informatique Th\u00e9orique et Applications\u00a033, 329\u2013339 (1999)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"8_CR2","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of \u03bc-calculus. North Holland, Amsterdam (2001)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1027358927272","volume":"75","author":"D. Berwanger","year":"2003","unstructured":"Berwanger, D.: Game logic is strong enough for parity games. Studia Logica\u00a075, 205\u2013219 (2003); Special issue on Game Logic and Game Algebra edited by Pauly M., Parikh, R.","journal-title":"Studia Logica"},{"key":"8_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-45653-8_5","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2001","unstructured":"Berwanger, D., Gr\u00e4del, E.: Games and model checking for guarded logics. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 70\u201384. Springer, Heidelberg (2001)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45793-3_24","volume-title":"Computer Science Logic","author":"D. Berwanger","year":"2002","unstructured":"Berwanger, D., Gr\u00e4del, E., Lenzi, G.: On the variable hierarchy of the modal mgr-calculus. In: Bradfield, J. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 352\u2013366. Springer, Heidelberg (2002)"},{"key":"8_CR6","unstructured":"Berwanger, D., Lenzi, G.: Robbers, guardians, and a few diamonds. Hard patterns in the \u03bc-calculus variable hierarchy (submitted)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J. Bradfield","year":"1998","unstructured":"Bradfield, J.: The modal \u03bc-calculus alternation hierarchy is strict. Theoretical Computer Science\u00a0195, 133\u2013153 (1998)","journal-title":"Theoretical Computer Science"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G. d\u2019Agostino","year":"2000","unstructured":"d\u2019Agostino, G., Hollenberg, M.: Logical questions concerning the \u03bc-calculus: interpolation, Lyndon, and \u0141os-Tarski. Journal of Symbolic Logic\u00a065, 310\u2013332 (2000)","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"M.C.B. Hennessy","year":"1980","unstructured":"Hennessy, M.C.B., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085. Springer, Heidelberg (1980)"},{"key":"8_CR11","first-page":"185","volume":"21","author":"D. Janin","year":"2002","unstructured":"Janin, D., Lenzi, G.: On the logical definability of topologically closed recognizable languages of infinite trees. Computing and Informatics\u00a021, 185\u2013203 (2002)","journal-title":"Computing and Informatics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D. Kozen","year":"1988","unstructured":"Kozen, D.: A finite model theorem for the propositional \u03bc-calculus. Studia Logica\u00a047, 233\u2013241 (1988)","journal-title":"Studia Logica"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM\u00a047, 312\u2013360 (2000)","journal-title":"Journal of the ACM"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61440-0_119","volume-title":"Automata, Languages and Programming","author":"G. Lenzi","year":"1996","unstructured":"Lenzi, G.: A hierarchy theorem for the mu-calculus. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 87\u201397. Springer, Heidelberg (1996)"},{"key":"8_CR16","first-page":"111","volume":"24","author":"R. Parikh","year":"1985","unstructured":"Parikh, R.: The logic of games and its applications. Annals of Discrete Mathematics\u00a024, 111\u2013140 (1985)","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR17","unstructured":"Pauly, M.: Logic for Social Software, PhD thesis, University of Amsterdam (2001)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","volume":"7","author":"C. Stirling","year":"1999","unstructured":"Stirling, C.: Bisimulation, modal logic and model checking games. Logic Journal of the IGPL\u00a07, 103\u2013124 (1999)","journal-title":"Logic Journal of the IGPL"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:56Z","timestamp":1605742196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}