{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:10:03Z","timestamp":1737094203060,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_5","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"70-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Ambiguous Classes in the Games \u03bc-Calculus Hierarchy"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Arnold","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Santocanale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"4\u20135","key":"5_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1051\/ita:1999121","volume":"33","author":"A. Arnold","year":"1999","unstructured":"A. Arnold. The \u03bc-calculus alternation-depth hierarchy is strict on binary trees. Theor. Inform. Appl.,33(4\u20135):329\u2013339, 1999.","journal-title":"Theor. Inform. Appl."},{"key":"5_CR2","unstructured":"A. Arnold and D. Niwi\u0144ski. Fixed point characterization of weak monadic logic definable sets of trees. In Tree automata and languages (Le Touquet, 1990), volume 10 of Stud. Comput. Sci. Artificial Intelligence, pages 159\u2013188. North-Holland, Amsterdam, 1992."},{"key":"5_CR3","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"A. Arnold","year":"2001","unstructured":"A. Arnold and D. Niwi\u0144ski. Rudiments of \u03bc-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 2001."},{"key":"5_CR4","unstructured":"A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial information. To appear in Theoret. Comput. Sci., 2002."},{"issue":"1\u20133","key":"5_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A. Blass","year":"1992","unstructured":"A. Blass. A game semantics for linear logic. Ann. Pure Appl. Logic,56(1\u20133):183\u2013220, 1992.","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J. C. Bradfield","year":"1998","unstructured":"J. C. Bradfield. The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci., 195(2):133\u2013153, 1998.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G. D\u2019Agostino","year":"2000","unstructured":"G. D'Agostino and M. Hollenberg. Logical questions concerning the \u03bc-calculus: interpolation, Lyndon and \u0142o\u015b-Tarski. J. Symbolic Logic, 65(1):310\u2013332, 2000.","journal-title":"J. Symbolic Logic"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"M. Dziembowski, S. Jurdzi\u0144ski and I. Walukiewicz. How much memory is needed to win infinite games? In Twelth Annual IEEE Symposium on Logic in Computer Science, pages 99\u2013110. IEEE Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614939"},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E. A. Emerson","year":"2001","unstructured":"E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model checking for the \u03bc-calculus and its fragments. Theoret. Comput. Sci., 258(1\u20132):491\u2013522, 2001.","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"R. Freese, J. Je\u017eek, and J. B. Nation. Free lattices. American Mathematical Society, Providence, RI, 1995.","DOI":"10.1090\/surv\/042"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-94-017-0487-8_3","volume-title":"Logic and scientific methods (Florence, 1995)","author":"A. Joyal","year":"1997","unstructured":"A. Joyal. Free lattices, communication and money games. In Logic and scientific methods (Florence, 1995), pages 29\u201368. Kluwer Acad. Publ., Dordrecht, 1997."},{"key":"5_CR12","volume-title":"Graduate Texts in Mathematics","author":"A. S. Kechris","year":"1995","unstructured":"A. S. Kechris. Classical descriptive set theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995."},{"key":"5_CR13","series-title":"Lecture Notes in Comput. Sci","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-61440-0_119","volume-title":"Automata, languages and programming (Paderborn, 1996)","author":"G. Lenzi","year":"1996","unstructured":"G. Lenzi. A hierarchy theorem for the \u03bc-calculus. In Automata, languages and programming (Paderborn, 1996), volume 1099 of Lecture Notes in Comput. Sci., pages 87\u201397. Springer, Berlin, 1996."},{"key":"5_CR14","series-title":"Lect. Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume-title":"Computation theory (Zabor\u00f3w, 1984)","author":"A. W. Mostowski","year":"1985","unstructured":"A. W. Mostowski. Regular expressions for in.nite trees and a standard form of automata. In Computation theory (Zabor\u00f3w, 1984), volume 208 of Lect. Notes in Comput. Sci., pages 157\u2013168. Springer, Berlin, 1985."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"D. Niwinski. On fixed-point clones. In Automata, languages and programming, volume 226 of Lecture Notes in Comput. Sci., pages 464\u2013473, 1986.","DOI":"10.1007\/3-540-16761-7_96"},{"issue":"1\u20132","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00039-X","volume":"189","author":"D. Niwi\u0144ski","year":"1997","unstructured":"D. Niwi\u0144ski. Fixed point characterization of in.nite behavior of finite-state systems. Theoret. Comput. Sci., 189(1\u20132):1\u201369, 1997.","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR17","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BFb0028571","volume-title":"STACS 98 (Paris, 1998)","author":"D. Niwi\u0144ski","year":"1998","unstructured":"D. Niwi\u0144ski and I. Walukiewicz. Relating hierarchies of word and tree automata. In STACS 98 (Paris, 1998), volume 1373 of Lecture Notes in Comput. Sci., pages 320\u2013331. Springer, Berlin, 1998."},{"key":"5_CR18","unstructured":"L. Santocanale. The alternation hierarchy for the theory of \u03bc-lattices. Theory and Applications of Categories, 9:166\u2013197, January 2002."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"L. Santocanale. A calculus of circular proofs and its categorical semantics. In FOSSACS02, volume 2303 of Lecture Notes in Comput. Sci., pages 357\u2013371, 2002.","DOI":"10.1007\/3-540-45931-6_25"},{"issue":"2\u20133","key":"5_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0022-4049(01)00098-6","volume":"168","author":"L. Santocanale","year":"2002","unstructured":"L. Santocanale. Free \u03bc-lattices. J. Pure Appl. Algebra, 168(2\u20133):227\u2013264, 2002.","journal-title":"J. Pure Appl. Algebra"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1051\/ita:2002010","volume":"36","author":"L. Santocanale","year":"2002","unstructured":"L. Santocanale. Parity games and \u03bc-bicomplete categories. Theor. Inform. Appl., (36):195\u2013227, 2002.","journal-title":"Theor. Inform. Appl."},{"key":"5_CR22","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"G. Takeuti","year":"1975","unstructured":"G. Takeuti. Proof theory. North-Holland Publishing Co., Amsterdam, 1975. Studies in Logic and the Foundations of Mathematics, Vol. 81."},{"key":"5_CR23","first-page":"389","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1996","unstructured":"W. Thomas. Languages, automata, and logic. In Rozenberg G. and Salomaa A., editors, Handbook of Formal Language Theory, volume III, pages 389\u2013455. Springer-Verlag, New York, 1996."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:53:49Z","timestamp":1737093229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36576-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}