{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300288},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:02:47Z","timestamp":1330293767000},"page":"233-246","source":"Crossref","is-referenced-by-count":20,"title":["The modal mu-calculus alternation hierarchy is strict"],"prefix":"10.1007","author":[{"given":"J. C.","family":"Bradfield","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"H. R. Andersen, Verification of Temporal Properties of Concurrent Systems, DAIMI PB \u2014 445, Computer Science Dept, Aarhus University (1993).","DOI":"10.7146\/dpb.v22i445.6762"},{"key":"15_CR2","first-page":"451","volume":"EIK 26","author":"A. Arnold","year":"1990","unstructured":"A. Arnold and D. Niwinski, Fixed point characterization of B\u00fcchi automata on infinite trees. J. Inf. Process. Cybern., EIK 26, 451\u2013459 (1990).","journal-title":"J. Inf. Process. Cybern."},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structures","author":"J. Barwise","year":"1975","unstructured":"J. Barwise, Admissible sets and structures, Springer-Verlag, Berlin\/New York (1975)."},{"key":"15_CR4","isbn-type":"print","volume-title":"Verifying Temporal Properties of Systems","author":"J. C. Bradfield","year":"1991","unstructured":"J. C. Bradfield, Verifying Temporal Properties of Systems. Birkh\u00e4user, Boston, Mass. 0-817-63625-0 (1991).","ISBN":"http:\/\/id.crossref.org\/isbn\/0817636250"},{"key":"15_CR5","first-page":"479","volume":"1046","author":"J. C. Bradfield","year":"1996","unstructured":"J. C. Bradfield, On the expressivity of the modal mu-calculus. Proc. STACS '96, LNCS 1046, 479\u2013490 (1996).","journal-title":"LNCS"},{"key":"15_CR6","unstructured":"J. C. Bradfield, The modal mu-calculus alternation hierarchy is strict. Online via the Web page http:\/\/www.dcs.ed.ac.uk\/home\/jcb\/ or by ftp at ftp:\/\/ftp.dcs.ed.ac.uk\/export\/jcb\/Research\/ althi.ps.gz."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. Extended version from FOCS '88. (1988).","DOI":"10.1109\/SFCS.1988.21949"},{"key":"15_CR8","unstructured":"E. A. Emerson and C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus. Proc. First IEEE Symp. on Logic in Computer Science 267\u2013278 (1986)."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(94)00227-P","volume":"54","author":"R. Kaivola","year":"1995","unstructured":"R. Kaivola, On modal mu-calculus and B\u00fcchi tree automata. Inf. Proc. Letters 54 17\u201322 (1995).","journal-title":"Inf. Proc. Letters"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen, Results on the propositional mu-calculus. Theoret. Comput. Sci. 27 333\u2013354 (1983).","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR11","unstructured":"G. Lenzi, A hierarchy theorem for the mu-calculus. To appear in Proc. ICALP '96."},{"key":"15_CR12","first-page":"338","volume":"818","author":"D. Long","year":"1994","unstructured":"D. Long, A. Browne, E. Clarke, S. Jha and W. Marrero, An improved algorithm for the evaluation of fixpoint expressions. Proc. CAV '94, LNCS 818 338\u2013350 (1994).","journal-title":"LNCS"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/2275338","volume":"58","author":"R. S. Lubarsky","year":"1993","unstructured":"R. S. Lubarsky, \u039c-definable sets of integers, J. Symbolic Logic 58 291\u2013313 (1993).","journal-title":"J. Symbolic Logic"},{"key":"15_CR14","volume-title":"Elementary induction on abstract structures","author":"Y. N. Moschovakis","year":"1974","unstructured":"Y. N. Moschovakis, Elementary induction on abstract structures, North-Holland, Amsterdam (1974)."},{"key":"15_CR15","first-page":"464","volume":"226","author":"D. Niwi\u0144ski","year":"1986","unstructured":"D. Niwi\u0144ski, On fixed point clones. Proc. 13th ICALP, LNCS 226 464\u2013473 (1986).","journal-title":"LNCS"},{"key":"15_CR16","first-page":"1","volume-title":"Mathematical Logic and Foundations of Set Theory","author":"M. O. Rabin","year":"1970","unstructured":"M. O. Rabin, Weakly definable relations and special automata, in Y. Bar-Hillel (ed.) Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam (1970), 1\u201323."},{"key":"15_CR17","first-page":"301","volume-title":"Generalized recursion theory","author":"W. Richter","year":"1974","unstructured":"W. Richter and P. Aczel, Inductive definitions and reflecting properties of admissible ordinals, in Fenstad and Hinman (ed.), Generalized recursion theory, North-Holland, Amsterdam 301\u2013381 (1974)."},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R. S. Streett","year":"1989","unstructured":"R. S. Streett and E. A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation 81 249\u2013264 (1989).","journal-title":"Information and Computation"},{"key":"15_CR19","first-page":"1","volume":"962","author":"C. Stirling","year":"1995","unstructured":"C. Stirling, Local model checking games. Proc. Concur '95, LNCS 962, 1\u201311 (1995).","journal-title":"LNCS"},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(86)90123-4","volume":"44","author":"M. Takashashi","year":"1986","unstructured":"M. Takashashi, The greatest fixed-points and rational omega-tree languages. Theor. Comput. Sci. 44 259\u2013274 (1986).","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:30Z","timestamp":1605647310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}