{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T04:33:02Z","timestamp":1663561982704},"reference-count":73,"publisher":"Cambridge University Press (CUP)","issue":"06","license":[{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2019,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Several fixed-point models share the equational properties of iteration theories, or iteration categories, which are cartesian categories equipped with a fixed point or dagger operation subject to certain axioms. After discussing some of the basic models, we provide equational bases for iteration categories and offer an analysis of the axioms. Although iteration categories have no finite base for their identities, there exist finitely based implicational theories that capture their equational theory. We exhibit several such systems. Then we enrich iteration categories with an additive structure and exhibit interesting cases where the interaction between the iteration category structure and the additive structure can be captured by a finite number of identities. This includes the iteration category of monotonic or continuous functions over complete lattices equipped with the least fixed-point operation and the binary supremum operation as addition, the categories of simulation, bisimulation, or language equivalence classes of processes, context-free languages, and others. Finally, we exhibit a finite equational system involving residuals, which is sound and complete for monotonic or continuous functions over complete lattices in the sense that it proves all of their identities involving the operations and constants of cartesian categories, the least fixed-point operation and binary supremum, but not involving residuals.<\/jats:p>","DOI":"10.1017\/s0960129518000361","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:18:03Z","timestamp":1558685883000},"page":"909-925","source":"Crossref","is-referenced-by-count":0,"title":["Equational properties of fixed-point operations in cartesian categories: An overview"],"prefix":"10.1017","volume":"29","author":[{"given":"Z","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"key":"S0960129518000361_ref58","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1037"},{"key":"S0960129518000361_ref57","first-page":"214","volume-title":"LICS 1991","author":"Kozen","year":"1991"},{"key":"S0960129518000361_ref56","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100074338"},{"key":"S0960129518000361_ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.019"},{"key":"S0960129518000361_ref54","first-page":"196","volume-title":"TLCA 1997","volume":"1210","author":"Hasegawa","year":"1997"},{"key":"S0960129518000361_ref53","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321997"},{"key":"S0960129518000361_ref52","volume-title":"Algebraic Theory of Automata","author":"Ginzburg","year":"1968"},{"key":"S0960129518000361_ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61611-2"},{"key":"S0960129518000361_ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.032"},{"key":"S0960129518000361_ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00158-8"},{"key":"S0960129518000361_ref48","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1142\/9789813148208_0002","author":"\u00c9sik","year":"2017","journal-title":"The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski"},{"key":"S0960129518000361_ref47","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.jlap.2013.01.001","volume":"8","author":"\u00c9sik","year":"2013","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"S0960129518000361_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-012-0179-y"},{"key":"S0960129518000361_ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.050"},{"key":"S0960129518000361_ref44","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S1571-0661(04)80009-4","volume":"1","author":"\u00c9sik","year":"1985","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"S0960129518000361_ref43","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129515000031"},{"key":"S0960129518000361_ref42","first-page":"174","volume-title":"WoLLIC 2015","author":"\u00c9sik","year":"2015"},{"key":"S0960129518000361_ref41","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/ext001"},{"key":"S0960129518000361_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.02.033"},{"key":"S0960129518000361_ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2013.09.011"},{"key":"S0960129518000361_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.020"},{"key":"S0960129518000361_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2009.10.001"},{"key":"S0960129518000361_ref36","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218196700000145","volume":"10","author":"\u00c9sik","year":"2000","journal-title":"International Journal of Algebra and Computation"},{"key":"S0960129518000361_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00315-1"},{"key":"S0960129518000361_ref34","first-page":"302","volume-title":"CSL 2000","volume":"1862","author":"\u00c9sik","year":"2000"},{"key":"S0960129518000361_ref33","first-page":"65","volume":"14","author":"\u00c9sik","year":"1999","journal-title":"Acta Cybernetica"},{"key":"S0960129518000361_ref32","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2746"},{"key":"S0960129518000361_ref31","first-page":"455","volume-title":"STACS 1998","volume":"1373","author":"\u00c9sik","year":"1998"},{"key":"S0960129518000361_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00240-X"},{"key":"S0960129518000361_ref29","first-page":"375","volume":"9","author":"\u00c9sik","year":"1990","journal-title":"Acta Cybernetica"},{"key":"S0960129518000361_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90020-7"},{"key":"S0960129518000361_ref27","first-page":"183","volume":"14","author":"\u00c9sik","year":"1980","journal-title":"Computational Linguistics and Computer Languages"},{"key":"S0960129518000361_ref26","first-page":"175","volume-title":"Logic Colloquium 1973","volume":"80","author":"Elgot","year":"1975"},{"key":"S0960129518000361_ref25","volume-title":"A Theory of Programs","author":"De Bakker","year":"1969"},{"key":"S0960129518000361_ref24","volume-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"S0960129518000361_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-8399-1"},{"key":"S0960129518000361_ref22","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"Cazanescu","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"S0960129518000361_ref21","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1995290605151"},{"key":"S0960129518000361_ref20","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1990240404191"},{"key":"S0960129518000361_ref19","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1001"},{"key":"S0960129518000361_ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008708924144"},{"key":"S0960129518000361_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.02.003"},{"key":"S0960129518000361_ref16","first-page":"145","volume":"8","author":"Bloom","year":"2003","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0960129518000361_ref15","first-page":"367","volume-title":"LATIN 2000","volume":"1776","author":"Bloom","year":"2000"},{"key":"S0960129518000361_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00248-4"},{"key":"S0960129518000361_ref13","first-page":"378","volume-title":"MFPS 1993","volume":"802","author":"Bloom","year":"1994"},{"key":"S0960129518000361_ref59","first-page":"60","volume-title":"ICALP 1990","volume":"443","author":"Krob","year":"1990"},{"key":"S0960129518000361_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9"},{"key":"S0960129518000361_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115352"},{"key":"S0960129518000361_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90012-1"},{"key":"S0960129518000361_ref73","first-page":"147","volume-title":"FOCS 1976","author":"Wright","year":"1976"},{"key":"S0960129518000361_ref72","first-page":"607","volume-title":"Algebraic Methods in Semantics","author":"Wagner","year":"1986"},{"key":"S0960129518000361_ref71","first-page":"30","volume-title":"LICS 2000","author":"Simpson","year":"2000"},{"key":"S0960129518000361_ref70","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00412-7"},{"key":"S0960129518000361_ref69","first-page":"97","volume-title":"Logics in AI 1990","volume":"478","author":"Pratt","year":"1990"},{"key":"S0960129518000361_ref68","volume-title":"Domains. The Pisa Notes","author":"Plotkin","year":"1983"},{"key":"S0960129518000361_ref67","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309"},{"key":"S0960129518000361_ref66","first-page":"464","volume-title":"ICALP\u201986","volume":"226","author":"Niwinski","year":"1986"},{"key":"S0960129518000361_ref65","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16066-3_16"},{"key":"S0960129518000361_ref64","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129518000361_ref63","doi-asserted-by":"publisher","DOI":"10.1007\/BF01752392"},{"key":"S0960129518000361_ref62","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.50.5.869"},{"key":"S0960129518000361_ref61","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0188316-1"},{"key":"S0960129518000361_ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90395-I"},{"key":"S0960129518000361_ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0209002"},{"key":"S0960129518000361_ref8","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1998321-300351"},{"key":"S0960129518000361_ref7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0048939","volume-title":"Programming Languages and Their Definition\u2013 Hans Beki\u0107 (1936\u20131982)","volume":"177","author":"Beki\u0107","year":"1969"},{"key":"S0960129518000361_ref6","first-page":"203","volume":"8","author":"Bartha","year":"1987","journal-title":"Acta Cybernetica"},{"key":"S0960129518000361_ref5","first-page":"168","volume":"22","author":"Barr","year":"2012","journal-title":"Theory and Applications of Categories"},{"key":"S0960129518000361_ref4","volume-title":"Rudiments of \u03bc-calculus","author":"Arnold","year":"2001"},{"key":"S0960129518000361_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90045-6"},{"key":"S0960129518000361_ref2","first-page":"67","volume":"10","author":"Arkhangelsky","year":"1967","journal-title":"Doklady Akademii Nauk USSR, Ser A"},{"key":"S0960129518000361_ref1","first-page":"239","volume-title":"AMAST 2002","volume":"2422","author":"Aceto","year":"2002"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129518000361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T15:33:54Z","timestamp":1663515234000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129518000361\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,24]]},"references-count":73,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S0960129518000361"],"URL":"https:\/\/doi.org\/10.1017\/s0960129518000361","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,24]]}}}