{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:39Z","timestamp":1761611139484},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3954,"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":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80359-1","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"54-70","source":"Crossref","is-referenced-by-count":7,"title":["Institutionalising Many-Sorted Coalgebraic Modal Logic"],"prefix":"10.1016","volume":"65","author":[{"given":"Corina","family":"C\u00eerstea","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80359-1_NEWBIB1","doi-asserted-by":"crossref","unstructured":"C. C\u00eerstea. On specification logics for algebra-coalgebra structures: Reconciling reachability and observability. In M. Nielsen and U. Engberg, editors, Foundations of Software Science and Computation Structures, volume 2303 of Lecture Notes in Compute Science, pages 82\u201397. Springer, 2002.","DOI":"10.1007\/3-540-45931-6_7"},{"issue":"1","key":"10.1016\/S1571-0661(04)80359-1_NEWBIB2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","article-title":"Institutions: Abstract model theory for specification and programming","volume":"39","author":"Goguen","year":"1992","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80359-1_NEWBIB3","unstructured":"R. Goldblatt. Logics of Time and Computation, volume 7 of CSLI Lecture Notes. Center for the Study of Language and Information, Stanford University, 1992"},{"issue":"1","key":"10.1016\/S1571-0661(04)80359-1_NEWBIB4","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)80359-1_NEWBIB5","doi-asserted-by":"crossref","unstructured":"A. Kurz. Specifying coalgebras with modal logic. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, Coalgebraic Methods in Computer Science, volume 11 of Electronic Notes in Theoretical Computer Science, pages 57\u201371. Elsevier Science, 1998","DOI":"10.1016\/S1571-0661(04)00053-2"},{"key":"10.1016\/S1571-0661(04)80359-1_NEWBIB6","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)80359-1_NEWBIB7","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, pages 299\u2013320. Elsevier Science, 2000","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"10.1016\/S1571-0661(04)80359-1_NEWBIB8","unstructured":"J.J.M.M. Rutten. A calculus of transition systems (towards universal coalgebra). Technical Report CS-R9503, CWI, 1995."},{"issue":"1","key":"10.1016\/S1571-0661(04)80359-1_NEWBIB9","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"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803591?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803591?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T12:22:45Z","timestamp":1549196565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104803591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S1571066104803591"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80359-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}