{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:15:28Z","timestamp":1648793728716},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2011,8,22]],"date-time":"2011-08-22T00:00:00Z","timestamp":1313971200000},"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":[[2011,10]]},"abstract":"<jats:p>Partial iterative theories are algebraic theories such that for certain morphisms <jats:italic>f<\/jats:italic> the equation \u03be = <jats:italic>f<\/jats:italic> \u22c5 \u3008\u03be, <jats:bold>1<\/jats:bold><jats:sub><jats:italic>p<\/jats:italic><\/jats:sub>\u3009 has a unique solution. Iteration theories are algebraic theories satisfying a certain set of identities. We investigate some similarities between partial iterative theories and iteration theories.<\/jats:p><jats:p>In our main result, we give a sufficient condition ensuring that the partially defined dagger operation of a partial iterative theory can be extended to a totally defined operation so that the resulting theory becomes an iteration theory. We show that this general extension theorem can be instantiated to prove that every Elgot iterative theory with at least one constant morphism 1 \u2192 0 can be extended to an iteration theory. We also apply our main result to theories equipped with an additive structure.<\/jats:p>","DOI":"10.1017\/s0960129511000326","type":"journal-article","created":{"date-parts":[[2011,8,22]],"date-time":"2011-08-22T10:47:53Z","timestamp":1314010073000},"page":"1035-1066","source":"Crossref","is-referenced-by-count":1,"title":["Dagger extension theorem"],"prefix":"10.1017","volume":"21","author":[{"given":"Z.","family":"\u00c9SIK","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"HAJGAT\u00d3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,8,22]]},"reference":[{"key":"S0960129511000326_ref23","first-page":"30","volume-title":"15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA, 2000)","author":"Simpson","year":"2000"},{"key":"S0960129511000326_ref22","unstructured":"Plotkin G. (1983) Domains, University of Edinburgh."},{"key":"S0960129511000326_ref21","first-page":"59","volume-title":"Machine Intelligence 5","author":"Park","year":"1970"},{"key":"S0960129511000326_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16761-7_96"},{"key":"S0960129511000326_ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.50.5.869"},{"key":"S0960129511000326_ref16","volume-title":"Introduction to Process Algebra","author":"Fokkink","year":"2007"},{"key":"S0960129511000326_ref15","first-page":"219","article-title":"Formal tree series.","volume":"8","author":"\u00c9sik","year":"2003","journal-title":"J. Autom. Lang. Comb."},{"key":"S0960129511000326_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00240-X"},{"key":"S0960129511000326_ref24","first-page":"147","volume-title":"17th Annual Symposium on Foundations of Computer Science","author":"Wright","year":"1976"},{"key":"S0960129511000326_ref12","first-page":"95","article-title":"On generalized iterative algebraic theories.","volume":"XV","author":"\u00c9sik","year":"1982","journal-title":"Computational Linguistics and Computer Languages"},{"key":"S0960129511000326_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16066-3_16"},{"key":"S0960129511000326_ref1","unstructured":"de Bakker J. W. and Scott D. (1969) A theory of programs, IBM Seminar, Vienna."},{"key":"S0960129511000326_ref6","first-page":"145","article-title":"An extension theorem with an application to formal tree series.","volume":"8","author":"Bloom","year":"2003","journal-title":"J. of Automata, Languages and Combinatorics"},{"key":"S0960129511000326_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0048939"},{"key":"S0960129511000326_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9"},{"key":"S0960129511000326_ref10","first-page":"175","volume-title":"Logic Colloquium '73","author":"Elgot","year":"1973"},{"key":"S0960129511000326_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9333-5"},{"key":"S0960129511000326_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80015-9"},{"key":"S0960129511000326_ref11","first-page":"183","article-title":"Identities in iterative and rational algebraic theories.","volume":"XIV","author":"\u00c9sik","year":"1980","journal-title":"Computational Linguistics and Computer Languages"},{"key":"S0960129511000326_ref14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2746"},{"key":"S0960129511000326_ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0209002"},{"key":"S0960129511000326_ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0209039"},{"key":"S0960129511000326_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.02.003"},{"key":"S0960129511000326_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(76)90106-X"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129511000326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T00:12:52Z","timestamp":1556323972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129511000326\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,22]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["S0960129511000326"],"URL":"https:\/\/doi.org\/10.1017\/s0960129511000326","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,22]]}}}