{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:53:17Z","timestamp":1672260797229},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3681,"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":[[2003,7]]},"DOI":"10.1016\/s1571-0661(04)80635-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"110-127","source":"Crossref","is-referenced-by-count":2,"title":["On Expressivity and Compositionality in Logics for Coalgebras"],"prefix":"10.1016","volume":"82","author":[{"given":"Corina","family":"C\u00eerstea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(95)00011-K","article-title":"On the greatest fixed point of a set functor","volume":"150","author":"Ad\u00e1mek","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB2","doi-asserted-by":"crossref","unstructured":"A. Baltag. A logic for coalgebraic simulation. In H. Reichel, editor, Coalgebraic Methods in Computer Science, volume 33 of Electronic Notes in Theoretical Computer Science, 2000.","DOI":"10.1016\/S1571-0661(05)80343-3"},{"issue":"3","key":"10.1016\/S1571-0661(04)80635-2_NEWBIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0022-4049(92)90169-G","article-title":"Algebraically compact functors","volume":"82","author":"Barr","year":"1992","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB4","doi-asserted-by":"crossref","unstructured":"C.A. Hermida. Fibrations, Logical Predicates and Indeterminates. PhD thesis, University of Edinburgh, 1993.","DOI":"10.7146\/dpb.v22i462.6935"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1051\/ita:2001108","article-title":"Many-sorted coalgebraic modal logic: a model-theoretic study","volume":"35","author":"Jacobs","year":"2001","journal-title":"Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"A. Kurz and D. Pattinson. Definability, canonical models, compactness for finitary coalgebraic modal logic. In L. S. Moss, editor, Coalgebraic Methods in Computer Science, volume 65.1 of Electronic Notes in Theoretical Computer Science, 2002.","DOI":"10.1016\/S1571-0661(04)80363-3"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB7","doi-asserted-by":"crossref","first-page":"277","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\/S1571-0661(04)80635-2_NEWBIB8","unstructured":"D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Technical report, LMU M\u00fcnchen, 2002."},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB9","doi-asserted-by":"crossref","unstructured":"M. R\u00f6\u00dfiger. Coalgebras and modal logic. In H. Reichel, editor, Coalgebraic Methods in Computer Science, volume 33 of Electronic Notes in Theoretical Computer Science, 2000.","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"10.1016\/S1571-0661(04)80635-2_NEWBIB10","unstructured":"J. Worrell. On the final sequence of an accessible set functor. To appear in Theoretical Computer Science."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:53:41Z","timestamp":1549173221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S1571066104806352"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80635-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}