{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:20Z","timestamp":1725677600143},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294846"},{"type":"electronic","value":"9783642294853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29485-3_12","type":"book-chapter","created":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T13:03:23Z","timestamp":1335359003000},"page":"180-203","source":"Crossref","is-referenced-by-count":1,"title":["A Complete Logical System for the Equality of Recursive Terms for Sets"],"prefix":"10.1007","author":[{"given":"Lawrence S.","family":"Moss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Wennstrom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glen T.","family":"Whitney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"CSLI Lecture Notes Number","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes Number, vol.\u00a014. CSLI Publications, Stanford (1988)"},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1017\/S0960129506005706","volume":"16","author":"J. Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Iterative Algebras at Work. Math. Structures Comput. Sci.\u00a016(6), 1085\u20131131 (2006)","journal-title":"Math. Structures Comput. Sci."},{"key":"12_CR3","series-title":"CSLI Lecture Notes","volume-title":"Vicious Circles","author":"J. Barwise","year":"1996","unstructured":"Barwise, J., Moss, L.S.: Vicious Circles. CSLI Lecture Notes, vol.\u00a060. CSLI Publications, Stanford (1996)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-06841-4_61","volume-title":"Automata, Languages and Programming","author":"B. Courcelle","year":"1974","unstructured":"Courcelle, B., Kahn, G., Vuillemin, J.: Algorithmes d\u2019equivalence et de reduction a des expressions minimales dans une classe d\u2019equations recursives simples. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 200\u2013213. Springer, Heidelberg (1974)"},{"issue":"3","key":"12_CR5","first-page":"493","volume":"10","author":"M. Forti","year":"1983","unstructured":"Forti, M., Honsell, F.: Set Theory with Free Construction Principles. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4)\u00a010(3), 493\u2013522 (1983)","journal-title":"Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.2307\/2586843","volume":"63","author":"A.J.C. Hurkens","year":"1998","unstructured":"Hurkens, A.J.C., McArthur, M., Moschovakis, Y.N., Moss, L.S., Whitney, G.: The Logic of Recursive Equations. Journal of Symbolic Logic\u00a063(2), 451\u2013478 (1998)","journal-title":"Journal of Symbolic Logic"},{"issue":"1-2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(01)00242-0","volume":"294","author":"L.S. Moss","year":"2003","unstructured":"Moss, L.S.: Recursion and Corecursion Have the Same Equational Logic. Theoretical Computer Science\u00a0294(1-2), 233\u2013267 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","volume":"25","author":"E. Nelson","year":"1983","unstructured":"Nelson, E.: Iterative Algebras. Theoretical Computer Science\u00a025(1), 67\u201394 (1983)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic and Program Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29485-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:05:20Z","timestamp":1620126320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29485-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294846","9783642294853"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29485-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}