{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:31:50Z","timestamp":1648531910589},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1884,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1016\/j.entcs.2008.05.028","type":"journal-article","created":{"date-parts":[[2008,6,8]],"date-time":"2008-06-08T09:00:59Z","timestamp":1212915659000},"page":"243-262","source":"Crossref","is-referenced-by-count":1,"title":["Coequational Logic for Finitary Functors"],"prefix":"10.1016","volume":"203","author":[{"given":"Daniel","family":"Schwencke","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2008.05.028_bib001","series-title":"Computer Science Logic \u2013 Proceedings of the 19th International Workshop","first-page":"70","article-title":"A logic of coequations","volume":"3634","author":"Ad\u00e1mek","year":"2005"},{"key":"10.1016\/j.entcs.2008.05.028_bib002","doi-asserted-by":"crossref","DOI":"10.1051\/ita:2007028","article-title":"Recursive coalgebras of finitary functors","author":"Ad\u00e1mek","year":"2007","journal-title":"Theoretical Informatics and Applications"},{"key":"10.1016\/j.entcs.2008.05.028_bib003","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1016\/j.ic.2005.11.005","article-title":"Terminal coalgebras and free iterative theories","volume":"204","author":"Ad\u00e1mek","year":"2006","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2008.05.028_bib004","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0304-3975(03)00378-5","article-title":"On tree coalgebras and coalgebra presentations","volume":"311","author":"Ad\u00e1mek","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.05.028_bib005","series-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek","year":"1990"},{"key":"10.1016\/j.entcs.2008.05.028_bib006","unstructured":"Gumm, H.P., Elements of the general theory of coalgebras, LUATCS '99, Rand Afrikaans University, Johannesburg, South Africa (1999)"},{"key":"10.1016\/j.entcs.2008.05.028_bib007","first-page":"204","article-title":"Modal operators for coequations","volume":"44.1","author":"Hughes","year":"2001","journal-title":"Electronical Notes in Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.05.028_bib008","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0168-0072(98)00042-6","article-title":"Coalgebraic logic","volume":"96","author":"Moss","year":"1999","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.entcs.2008.05.028_bib009","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","article-title":"Coalgebraic modal logic: soundness, completeness and decidability","volume":"309","author":"Pattinson","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.05.028_bib010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.05.028_bib011","unstructured":"Schwencke, D., \u201cCoalgebraische Logik von markierten Transitionssystemen,\u201d Master's thesis, Technical University, Braunschweig (2007), unpublished"},{"key":"10.1016\/j.entcs.2008.05.028_bib012","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","article-title":"On the final sequence of a finitary set functor","volume":"338","author":"Worrell","year":"2005","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108003423?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108003423?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T00:28:55Z","timestamp":1545956935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066108003423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["S1571066108003423"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2008.05.028","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}