{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:07:40Z","timestamp":1743116860466,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319403694"},{"type":"electronic","value":"9783319403700"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40370-0_6","type":"book-chapter","created":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T09:50:55Z","timestamp":1464947455000},"page":"73-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Duality of Equations and Coequations via Contravariant Adjunctions"],"prefix":"10.1007","author":[{"given":"Julian","family":"Salamanca","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,4]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11538363_7","volume-title":"Computer Science Logic","author":"J Ad\u00e1mek","year":"2005","unstructured":"Ad\u00e1mek, J.: A logic of coequations. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 70\u201386. Springer, Heidelberg (2005)"},{"issue":"2","key":"6_CR2","first-page":"197","volume":"46","author":"J Ad\u00e1mek","year":"2005","unstructured":"Ad\u00e1mek, J.: Birkhoff\u2019s covariety theorem without limitation. Comment. Math. Univ. Carolinae 46(2), 197\u2013215 (2005)","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Milius, S., Myers, R.S.R., Urbat, H.: Generalized eilenberg theorem I: local varieties of languages. In: FoSSaCS 2014, pp. 366\u2013380 (2014)","DOI":"10.1007\/978-3-642-54830-7_24"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Milius, S., Myers, R.S.R., Urbat, H.: Varieties of languages in a category. In: Proceedings of LICS 2015. IEEE (2015)","DOI":"10.1109\/LICS.2015.46"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0960129502003894","volume":"13","author":"S Awodey","year":"2003","unstructured":"Awodey, S., Hughes, J.: Modal operators and the formal dual of Birkhoff\u2019s completeness theorem. Math. Struct. CS 13(2), 233\u2013258 (2003)","journal-title":"Math. Struct. CS"},{"key":"6_CR6","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568612.001.0001","volume-title":"Category Theory","author":"S Awodey","year":"2006","unstructured":"Awodey, S.: Category Theory. Oxford University Press, Oxford (2006)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ic.2015.08.001","volume":"244","author":"A Ballester-Bolinches","year":"2015","unstructured":"Ballester-Bolinches, A., Cosme-Ll\u00f3pez, E., Rutten, J.J.M.M.: The dual equivalence of equations and coequations for automata. Inf. Comput. 244, 49\u201375 (2015)","journal-title":"Inf. Comput."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-31982-5_29","volume-title":"Foundations of Software Science and Computational Structures","author":"MM Bonsangue","year":"2005","unstructured":"Bonsangue, M.M., Kurz, A.: Duality for logics of transition systems. In: Sassone, V. (ed.) FOSSACS 2005 and ETAPS 2005. LNCS, vol. 3441, pp. 455\u2013469. Springer, Heidelberg (2005)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11560647_19","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"R Clouston","year":"2005","unstructured":"Clouston, R., Goldblatt, R.: Covarieties of coalgebras: comonads and coequations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 288\u2013302. Springer, Heidelberg (2005)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"6_CR11","first-page":"159","volume":"13","author":"HP Gumm","year":"2000","unstructured":"Gumm, H.P.: Birkhoff\u2019s variety theorem for coalgebras. Contrib. Gen. Algebra 13, 159\u2013173 (2000)","journal-title":"Contrib. Gen. Algebra"},{"key":"6_CR12","first-page":"42","volume":"11","author":"HP Gumm","year":"1998","unstructured":"Gumm, H.P., Schr\u00f6der, T.: Covarieties and complete covarieties. ENTCS 11, 42\u201355 (1998)","journal-title":"ENTCS"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. Comput. 145(2), 107\u2013152 (1998)","journal-title":"Inf. Comput."},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exn093","volume":"20","author":"B Jacobs","year":"2010","unstructured":"Jacobs, B., Sokolova, A.: Exemplaric expressivity of modal logics. J. Log. Comput. 20(5), 1041\u20131068 (2010)","journal-title":"J. Log. Comput."},{"key":"6_CR16","first-page":"177","volume":"173","author":"B Klin","year":"2007","unstructured":"Klin, B.: ENTCS 173, 177\u2013201 (2007)","journal-title":"ENTCS"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-46678-0_10","volume-title":"Foundations of Software Science and Computation Structures","author":"B Klin","year":"2015","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. In: Pitts, A. (ed.) FOSSACS 2015 and ETAPS 2015. LNCS, vol. 9034, pp. 151\u2013166. Springer, Heidelberg (2015)"},{"key":"6_CR18","unstructured":"Kurz, A.: Logics for coalgebras and applications to computer science. Doctoral Thesis, Ludwigs-Maximilians-Universit\u00e4t M\u00fcnchen (2000)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1017\/S0960129504004402","volume":"15","author":"A Kurz","year":"2005","unstructured":"Kurz, A., Rosick\u00fd, J.: Operations and equations for coalgebras. Math. Struct. Comput. Sci. 15(1), 149\u2013166 (2005)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11784180_24","volume-title":"Algebraic Methodology and Software Technology","author":"D Pavlovic","year":"2006","unstructured":"Pavlovic, D., Mislove, M.W., Worrell, J.B.: Testing semantics: connecting processes and process logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 308\u2013322. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"6_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0304-3975(00)00129-8","volume":"260","author":"G Ro\u015fu","year":"2001","unstructured":"Ro\u015fu, G.: Equational axiomatizability for coalgebra. Theoret. Comput. Sci. 260(1\u20132), 229\u2013247 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1016\/j.ic.2009.10.010","volume":"208","author":"D Schwencke","year":"2010","unstructured":"Schwencke, D.: Coequational logic for accessible functors. Inf. Comput. 208(12), 1469\u20131489 (2010)","journal-title":"Inf. Comput."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-19797-5_11","volume-title":"Mathematics of Program Construction","author":"J Salamanca","year":"2015","unstructured":"Salamanca, J., Ballester-Bolinches, A., Bonsangue, M.M., Cosme-Ll\u00f3pez, E., Rutten, J.J.M.M.: Regular varieties of automata and coequations. In: Hinze, R., Voigtl\u00e4nder, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 224\u2013237. Springer, Heidelberg (2015)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-48057-1_35","volume-title":"Mathematical Foundations of Computer Science 2015","author":"J Salamanca","year":"2015","unstructured":"Salamanca, J., Bonsangue, M., Rutten, J.: Equations and coequations for weighted automata. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 444\u2013456. Springer, Heidelberg (2015)"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40370-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T00:03:10Z","timestamp":1591142590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40370-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319403694","9783319403700"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40370-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}