{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:50Z","timestamp":1761610070548,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80009-4","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"154-181","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Scott Induction and Equational Proofs"],"prefix":"10.1016","volume":"1","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[]},{"given":"L.","family":"Bern\u00e1tsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB1","doi-asserted-by":"crossref","unstructured":"S.L. Bloom, and Z. \u00c9sik, Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9_6"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB2","doi-asserted-by":"crossref","unstructured":"S.L. Bloom, and Z. \u00c9sik, Some quasi-varieties of iteration theories. In: Mathematical Foundations of Programming Semantics '93, LNCS 802, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58027-1_19"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"S.L. Bloom, Z. \u00c9sik, Solving polynomial fixed point equations. In: Mathematical Foundations of Computer Science '94. LNCS 841, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58338-6_58"},{"year":"1971","series-title":"Regular Algebra and Finite Machines","author":"Conway","key":"10.1016\/S1571-0661(04)80009-4_NEWBIB4"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB5","unstructured":"S. Eilenberg, The category C. Unpublished handwritten manuscript."},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB6","article-title":"Monadic computation and iterative algebraic theories","volume":"volume 80","author":"Elgot","year":"1975"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB7","unstructured":"Z. \u00c9sik, Completeness of Park induction. To appear."},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB8","unstructured":"S. Igarashi, Admissibility of fixed-point induction in first order logic of typed theories. In: International Symposium on Theoretical Programming, Novosibirsk, 1972, LNCS 5, Springer-Verlag, 1972."},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB9","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","article-title":"A completeness theorem for Kleene algebras and the algebra of regular events","volume":"110","author":"Kozen","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","article-title":"Complete systems of B-rational identities","volume":"89","author":"Krob","year":"1991","journal-title":"Theoretical Computer Science"},{"year":"1979","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","key":"10.1016\/S1571-0661(04)80009-4_NEWBIB12"},{"year":"1992","series-title":"Predicate Transformer Semantics","author":"Manes","key":"10.1016\/S1571-0661(04)80009-4_NEWBIB13"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB14","article-title":"Fixpoint induction and proofs of program properties","volume":"5","author":"Park","year":"1970"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(86)90179-9","article-title":"Scott induction and closure under \u03c9-sups","volume":"45","author":"Pasztor","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB16","series-title":"Lecture notes. Department of Computer Science","article-title":"Domains","author":"Plotkin","year":"1983"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB17","unstructured":"G.D. Plotkin. Personal communication."},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB18","unstructured":"D. Scott and J.W. De Bakker, A theory of programs. Unpublished manuscript, IBM, Vienna, 1969."},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Glynn Winskel, The Formal Semantics of Programming Languages. The MIT Press Foundations of Computing Series, 1993.","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"10.1016\/S1571-0661(04)80009-4_NEWBIB20","doi-asserted-by":"crossref","unstructured":"J.B. Wright, J.W. Thatcher, J. Goguen and E.G. Wagner, Rational algebraic theories and fixed-point solutions. In: 17th IEEE Symp. Foundations of Computing, Houston, Texas, 1976.","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:56Z","timestamp":1761609836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":20,"alternative-id":["S1571066104800094"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80009-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scott Induction and Equational Proofs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80009-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}