{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:48Z","timestamp":1725490248453},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_56","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"645-656","source":"Crossref","is-referenced-by-count":1,"title":["On the Equational Definition of the Least Prefixed Point"],"prefix":"10.1007","author":[{"given":"Luigi","family":"Santocanale","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"issue":"1","key":"56_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)00045-X","volume":"151","author":"S. Ambler","year":"1995","unstructured":"S. Ambler, M. Kwiatkowska, and N. Measor. Duality and the completeness of the modal \u03bc-calculus. Theoret. Comput. Sci., 151(1):3\u201327, 1995.","journal-title":"Theoret. Comput. Sci."},{"issue":"4\u20135","key":"56_CR2","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":"56_CR3","first-page":"A1501","volume":"272","author":"M. Barr","year":"1971","unstructured":"M. Barr. Cat\u00e9gories exactes. C. R. Acad. Sci. Paris S\u00e9r. A-B, 272:A1501\u2013A1503, 1971.","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A-B"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"D. Beauquier and A. Rabinovich. Monadic logic of order over naturals has no finite base. To appear in Journal of Logic and Computation, 2001.","DOI":"10.1093\/logcom\/12.2.243"},{"issue":"2","key":"56_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"13","author":"S. L. Bloom","year":"1976","unstructured":"S. L. Bloom. Varieties of ordered algebras. J. Comput. System Sci., 13(2):200\u2013212, 1976.","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"56_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S. L. Bloom","year":"1992","unstructured":"S. L. Bloom and Z. \u00c9sik. Iteration algebras. Internat. J. Found. Comput. Sci., 3(3):245\u2013302, 1992.","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"56_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories","author":"S. L. Bloom","year":"1993","unstructured":"S. L. Bloom and Z. Esik. Iteration theories. Springer-Verlag, Berlin, 1993."},{"issue":"2","key":"56_CR8","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":"56_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"Z. \u00c9sik. Completeness of Park induction. Theoret. Comput. Sci., 177(1):217\u2013283, 1997.","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal algebra","author":"G. Gr\u00e4tzer","year":"1979","unstructured":"G. Gr\u00e4tzer. Universal algebra. Springer-Verlag, New York, second edition, 1979.","edition":"second edition"},{"issue":"1\u20132","key":"56_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0304-3975(97)00233-8","volume":"202","author":"C. Hartonas","year":"1998","unstructured":"C. Hartonas. Duality for modal \u03bc-logics. Theoret. Comput. Sci., 202(1\u20132):193\u2013222, 1998.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"56_CR12","doi-asserted-by":"publisher","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 \u03bc-calculus. Theoret. Comput. Sci., 27(3):333\u2013354, 1983.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"56_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D. Kozen","year":"1981","unstructured":"D. Kozen and R. Parikh. An elementary proof of the completeness of PDL. Theoret. Comput. Sci., 14(1):113\u2013118, 1981.","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR14","first-page":"87","volume":"1099","author":"G. Lenzi","year":"1996","unstructured":"G. Lenzi. A hierarchy theorem for the \u03bc-calculus. In Automata, languages and programming, volume 1099, pages 87\u201397, 1996.","journal-title":"Automata, languages and programming"},{"key":"56_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-16066-3_16","volume-title":"Computation theory (Zabor\u00f3w, 1984)","author":"D. Niwi\u0144ski","year":"1985","unstructured":"D. Niwi\u0144ski. Equational \u03bc-calculus. In Computation theory (Zabor\u00f3w, 1984), pages 169\u2013176. Springer, Berlin, 1985."},{"key":"56_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, languages and programming (Rennes, 1986)","author":"D. Niwi\u0144ski","year":"1986","unstructured":"D. Niwi\u0144ski. On fixed-point clones (extended abstract). In Automata, languages and programming (Rennes, 1986), pages 464\u2013473. Springer, Berlin, 1986."},{"key":"56_CR17","first-page":"59","volume-title":"Machine intelligence, 5","author":"D. Park","year":"1970","unstructured":"D. Park. Fixpoint induction and proofs of program properties. In Machine intelligence, 5, pages 59\u201378. American Elsevier, New York, 1970."},{"key":"56_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0018436","volume-title":"Logics in AI (Amsterdam, 1990)","author":"V. Pratt","year":"1991","unstructured":"V. Pratt. Action logic and pure induction. In Logics in AI (Amsterdam, 1990), pages 97\u2013120. Springer, Berlin, 1991."},{"issue":"3\u20134","key":"56_CR19","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/BF00370685","volume":"50","author":"V. Pratt","year":"1991","unstructured":"V. Pratt. Dynamic algebras: examples, constructions, applications. Studia Logica, 50(3\u20134):571\u2013605, 1991.","journal-title":"Studia Logica"},{"key":"56_CR20","doi-asserted-by":"crossref","unstructured":"L. Santocanale. The alternation hierarchy for the theory of \u03bc-lattices. Research Series RS-00-29, BRICS, Department of Computer Science, University of Aarhus, November 2000.","DOI":"10.7146\/brics.v7i29.20163"},{"key":"56_CR21","doi-asserted-by":"crossref","unstructured":"L. Santocanale. Free \u03bc-lattices. Research Series RS-00-28, BRICS, Department of Computer Science, University of Aarhus, November 2000.","DOI":"10.7146\/brics.v7i28.20161"},{"key":"56_CR22","series-title":"PhD thesis","volume-title":"Sur les \u03bc-treillis libres","author":"L. Santocanale","year":"2000","unstructured":"L. Santocanale. Sur les \u03bc-treillis libres. PhD thesis, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, July 2000."},{"key":"56_CR23","first-page":"31","volume-title":"Universal algebra and applications (Warsaw, 1978)","author":"K. Segerberg","year":"1982","unstructured":"K. Segerberg. A completeness theorem in the modal logic of programs. In Universal algebra and applications (Warsaw, 1978), pages 31\u201346. PWN, Warsaw, 1982."},{"issue":"1\u20132","key":"56_CR24","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"I. Walukiewicz. Completeness of Kozen\u2019s axiomatisation of the propositional \u03bc- calculus. Inform. and Comput., 157(1\u20132):142\u2013182, 2000.","journal-title":"Inform. and Comput."},{"key":"56_CR25","doi-asserted-by":"publisher","first-page":"104","DOI":"10.2307\/1968883","volume":"43","author":"P. M. Whitman","year":"1942","unstructured":"P. M. Whitman. Free lattices. II. Ann. of Math. (2), 43:104\u2013115, 1942.","journal-title":"Ann. of Math. (2)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:09:24Z","timestamp":1684004964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}