{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:36Z","timestamp":1776316836936,"version":"3.50.1"},"reference-count":20,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2004,1,1]]},"DOI":"10.1305\/ndjfl\/1094155277","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T14:31:55Z","timestamp":1099405915000},"source":"Crossref","is-referenced-by-count":57,"title":["Expressive Logics for Coalgebras via Terminal Sequence Induction"],"prefix":"10.1215","volume":"45","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Aczel, P., and N. Mendler, \"A final coalgebra theorem\", pp. 357--65 in <i>Category Theory and Computer Science (Manchester, 1989)<\/i>, edited by D. H. Pitt et al., vol. 389 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 1989.","DOI":"10.1007\/BFb0018361"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Barr, M., \"Algebraically compact functors\", <i>Journal of Pure and Applied Algebra<\/i>, vol. 82 (1992), pp. 211--31.","DOI":"10.1016\/0022-4049(92)90169-G"},{"key":"4","unstructured":"[4] Borceux, F., <i>Handbook of Categorical Algebra. 1, 2, and 3<\/i>, vols. 50, 51, 52 of <i>Encyclopedia of Mathematics and its Applications<\/i>, Cambridge University Press, Cambridge, 1994. 1. Basic Category Theory: 2. Categories and Structures: 3. Categories of Sheaves"},{"key":"5","unstructured":"[5] Goldblatt, R., <i>Logics of Time and Computation<\/i>, 2d edition, vol. 7 of <i>CSLI Lecture Notes<\/i>, CSLI, Stanford, 1992."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Hennessy, M., and R. Milner, \"On observing nondeterminism and concurrency\", pp. 299--309 in <i>Automata, Languages and Programming (Proceedings of the Seventh International Colloquium, Noordwijkerhout, 1980)<\/i>, edited by J. W. de Bakker and J. van Leeuwen, vol. 85 of <i>Lecture Notes in Computer Science<\/i>, Springer-Verlag, Berlin, 1980.","DOI":"10.1007\/3-540-10003-2_79"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Hermida, C., and B. Jacobs, \"Structural induction and coinduction in a fibrational setting\", <i>Information and Computation<\/i>, vol. 145 (1998), pp. 107--52.","DOI":"10.1006\/inco.1998.2725"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Jacobs, B., \"Many-sorted coalgebraic modal logic: A model-theoretic study\", <i>Theoretical Informatics and Applications. Informatique Th\u00e9orique et Applications<\/i>, vol. 35 (2001), pp. 31--59.","DOI":"10.1051\/ita:2001108"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Kurz, A., \"Specifying coalgebras with modal logic\", <i>Theoretical Computer Science<\/i>, vol. 260 (2001), pp. 119--38.","DOI":"10.1016\/S0304-3975(00)00125-0"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] MacLane, S., <i>Categories for the Working Mathematician<\/i>, vol. 5 of <i>Graduate Texts in Mathematics<\/i>, Springer-Verlag, New York, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Makkai, M., and R. Par\u00e9, <i>Accessible Categories: The Foundations of Categorical Model Theory<\/i>, vol. 104 of <i>Contemporary Mathematics<\/i>, American Mathematical Society, Providence, 1989.","DOI":"10.1090\/conm\/104"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Moss, L. S., \"Coalgebraic logic. Festschrift on the occasion of Professor Rohit Parikh's 60th birthday\", <i>Annals of Pure and Applied Logic<\/i>, vol. 96 (1999), pp. 277--317. See Erratum [?].","DOI":"10.1016\/S0168-0072(98)00042-6"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Moss, L. S., \"Erratum to: `Coalgebraic logic'\", <i>Annals of Pure and Applied Logic<\/i>, vol. 99 (1999), pp. 241--59.","DOI":"10.1016\/S0168-0072(98)00042-6"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Pattinson, D., \"Semantical principles in the modal logic of coalgebras\", pp. 514--26 in <i>Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science (STACS 2001 Dresden)<\/i>, edited by H. Reichel and A. Ferreira, vol. 2010 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2001.","DOI":"10.1007\/3-540-44693-1_45"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Pattinson, D., \"Coalgebraic modal logic: Soundness, completeness and decidability of local consequence\", <i>Theoretical Computer Science<\/i>, vol. 309 (2003), pp. 177--93.","DOI":"10.1016\/S0304-3975(03)00201-9"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R\u00f6\u00dfiger, M., \"Coalgebras and modal logic\", pp. 299--320 (in paper) in <i>CMCS'2000: Coalgebraic Methods in Computer Science (Berlin)<\/i>, edited by H. Reichel, vol. 33 of <i>Electronic Notes Theoretical Computer Science<\/i>, Elsevier, Amsterdam, 2000.","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] R\u00f6\u00dfiger, M., \"From modal logic to terminal coalgebras\", <i>Theoretical Computer Science<\/i>, vol. 260 (2001), pp. 209--28.","DOI":"10.1016\/S0304-3975(00)00128-6"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Rutten, J. J. M. M., \"Universal coalgebra: A theory of systems\", <i>Theoretical Computer Science<\/i>, vol. 249 (2000), pp. 3--80.","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"3","unstructured":"[3] Blackburn, P., M. de Rijke, and Y. Venema, <i>Modal Logic<\/i>, vol. 53 of <i>Cambridge Tracts in Theoretical Computer Science<\/i>, Cambridge University Press, Cambridge, 2001."},{"key":"9","unstructured":"[9] Kurz, A., <i>Logics for Coalgebras and Applications to Computer Science<\/i>, Ph.D. thesis, Universit\u00e4t M\u00fcnchen, 2000."},{"key":"20","unstructured":"[20] Worrell, J., \"On the final sequence of an accessible set functor\", <i>Theoretical Computer Science<\/i>, (2003). to appear."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1094155277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:56:07Z","timestamp":1706648167000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-45\/issue-1\/Expressive-Logics-for-Coalgebras-via-Terminal-Sequence-Induction\/10.1305\/ndjfl\/1094155277.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2004,1,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1094155277","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1,1]]}}}