{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:43Z","timestamp":1725520663143},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_42","type":"book-chapter","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T22:03:10Z","timestamp":1226700190000},"page":"605-620","source":"Crossref","is-referenced-by-count":1,"title":["The Variable Hierarchy for the Lattice \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Walid","family":"Belkhir","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Santocanale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1993)"},{"key":"42_CR2","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of \u03bc-calculus. Studies in Logic and the Foundations of Mathematics, vol.\u00a0146. North-Holland, Amsterdam (2001)"},{"issue":"2","key":"42_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J.C. Bradfield","year":"1998","unstructured":"Bradfield, J.C.: The modal mu-calculus alternation hierarchy is strict. Theor. Comput. Sci.\u00a0195(2), 133\u2013153 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"4-5","key":"42_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1051\/ita:1999121","volume":"33","author":"A. Arnold","year":"1999","unstructured":"Arnold, A.: The \u03bc-calculus alternation-depth hierarchy is strict on binary trees. Theor. Inform. Appl.\u00a033(4-5), 329\u2013339 (1999)","journal-title":"Theor. Inform. Appl."},{"key":"42_CR5","first-page":"166","volume":"9","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: The alternation hierarchy for the theory of \u03bc-lattices. Theory Appl. Categ.\u00a09, 166\u2013197 (2002)","journal-title":"Theory Appl. Categ."},{"issue":"1-2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2004.10.024","volume":"333","author":"L. Santocanale","year":"2005","unstructured":"Santocanale, L., Arnold, A.: Ambiguous classes in \u03bc-calculi hierarchies. Theor. Comput. Sci.\u00a0333(1-2), 265\u2013296 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1307\/mmj\/1028998975","volume":"10","author":"L.C. Eggan","year":"1963","unstructured":"Eggan, L.C.: Transition graphs and the star-height of regular events. Mich. Math. J.\u00a010, 385\u2013397 (1963)","journal-title":"Mich. Math. J."},{"issue":"2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(84)90063-X","volume":"30","author":"J.P. Braquelaire","year":"1984","unstructured":"Braquelaire, J.P., Courcelle, B.: The solutions of two star-height problems for regular trees. Theor. Comput. Sci.\u00a030(2), 205\u2013239 (1984)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"42_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00224-006-1317-8","volume":"40","author":"D. Berwanger","year":"2007","unstructured":"Berwanger, D., Gr\u00e4del, E., Lenzi, G.: The variable hierarchy of the \u03bc-calculus is strict. Theory Comput. Syst.\u00a040(4), 437\u2013466 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"1-3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A. Blass","year":"1992","unstructured":"Blass, A.: A game semantics for linear logic. Ann. Pure Appl. Logic\u00a056(1-3), 183\u2013220 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-1-4612-2822-6_17","volume-title":"Logic from Computer Science","author":"A. Nerode","year":"1992","unstructured":"Nerode, A., Yakhnis, A., Yakhnis, V.: Concurrent programs as strategies in games. In: Moschovakis, Y.N. (ed.) Logic from Computer Science, pp. 405\u2013479. Springer, Heidelberg (1992)"},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. J. Symb. Logic\u00a059(2), 543\u2013574 (1994)","journal-title":"J. Symb. Logic"},{"key":"42_CR13","series-title":"Synthese Lib","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-94-017-0487-8_3","volume-title":"Logic and scientific methods","author":"A. Joyal","year":"1997","unstructured":"Joyal, A.: Free lattices, communication and money games. In: Logic and scientific methods. Synthese Lib, vol.\u00a0259, pp. 29\u201368. Kluwer Acad. Publ., Dordrecht (1997)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Freese, R.: Free lattices. Math. Surveys and Monographs. vol.\u00a042, AMS (1995)","DOI":"10.1090\/surv\/042"},{"issue":"5","key":"42_CR15","first-page":"219","volume":"17","author":"A. Joyal","year":"1995","unstructured":"Joyal, A.: Free bicomplete categories. C. R. Math. Canada\u00a017(5), 219\u2013224 (1995)","journal-title":"C. R. Math. Canada"},{"key":"42_CR16","first-page":"63","volume":"8","author":"J.R.B. Cockett","year":"2001","unstructured":"Cockett, J.R.B., et al.: Finite sum-product logic. Theory Appl. Categ.\u00a08, 63\u201399 (2001)","journal-title":"Theory Appl. Categ."},{"issue":"2-3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0022-4049(01)00098-6","volume":"168","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: Free \u03bc-lattices. Jour. of Pure and Applied Algebra\u00a0168(2-3), 227\u2013264 (2002)","journal-title":"Jour. of Pure and Applied Algebra"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45931-6_25","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: A calculus of circular proofs and its categorical semantics. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 357\u2013371. Springer, Heidelberg (2002)"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-36576-1_5","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Arnold","year":"2003","unstructured":"Arnold, A., Santocanale, L.: Ambiguous classes in the games mgr-calculus hierarchy. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 70\u201386. Springer, Heidelberg (2003)"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math.\u00a05, 285\u2013309 (1955)","journal-title":"Pacific J. Math."},{"key":"42_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-32275-7_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2005","unstructured":"Berwanger, D., Gr\u00e4del, E.: Entanglement \u2013 A measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.\u00a03452, pp. 209\u2013223. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:12:29Z","timestamp":1557911549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}