{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:49Z","timestamp":1761611329230},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T00:00:00Z","timestamp":1372377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11225-013-9498-z","type":"journal-article","created":{"date-parts":[[2013,6,27]],"date-time":"2013-06-27T01:56:27Z","timestamp":1372298187000},"page":"783-825","source":"Crossref","is-referenced-by-count":1,"title":["A Coalgebraic Perspective on Logical Interpretations"],"prefix":"10.1007","volume":"101","author":[{"given":"M. A.","family":"Martins","sequence":"first","affiliation":[]},{"given":"A.","family":"Madeira","sequence":"additional","affiliation":[]},{"given":"L. S.","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,28]]},"reference":[{"key":"9498_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., and L. Cardelli, A Theory of Objects. Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4419-8598-9"},{"issue":"8","key":"9498_CR2","first-page":"157","volume":"14","author":"J. Adamek","year":"2005","unstructured":"Adamek J.: An introduction to coalgebra. Theory and Applications of Categories 14(8), 157\u2013199 (2005)","journal-title":"Theory and Applications of Categories"},{"key":"9498_CR3","unstructured":"Barbosa, L. S., J. N. Oliveira, and A. M. Silva, Calculating invariants as coreflexive bisimulations. In J. Meseguer and G. Rosu, (eds.), Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Urbana, IL, USA, July 28-31, 2008, Proceedings Springer Lect. Notes Comp. Sci. (5140), 2008, pp. 83\u201399."},{"issue":"6","key":"9498_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TSE.2004.23","volume":"30","author":"D. Batory","year":"2004","unstructured":"Batory D., J. N. Sarvela, A. Rauschmayer: Scaling step-wise refinement. IEEE Trans. in Sofware Engineering 30(6), 355\u2013371 (2004)","journal-title":"IEEE Trans. in Sofware Engineering"},{"key":"9498_CR5","unstructured":"Bird R., and O. Moor, The Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997."},{"key":"9498_CR6","doi-asserted-by":"crossref","unstructured":"Blok, W., and D. Pigozzi, Algebraizable logics. Memoirs of the American Mathematical Society (396). Amer. Math. Soc., Providence, 1989.","DOI":"10.1090\/memo\/0396"},{"key":"9498_CR7","unstructured":"Blok, W., and D. Pigozzi, Abstract algebraic logic and the deduction theorem, 2001. Available from http:\/\/www.math.iastate.edu\/dpigozzi\/papers\/aaldedth.pdf ."},{"issue":"1-2","key":"9498_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1024626023417","volume":"74","author":"W. Blok","year":"2003","unstructured":"Blok W., J. Rebagliato: Algebraic semantics for deductive systems. Studia Logica 74(1-2), 153\u2013180 (2003)","journal-title":"Studia Logica"},{"key":"9498_CR9","doi-asserted-by":"crossref","unstructured":"Caleiro, C., and R. Gon\u00e7alves, Equipollent logical systems. In Logica Universalis, Birkh\u00e4user, Basel, 2005, pp. 99\u2013111.","DOI":"10.1007\/3-7643-7304-0_6"},{"issue":"1","key":"9498_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11787-009-0002-5","volume":"3","author":"W. A. Carnielli","year":"2009","unstructured":"Carnielli W. A., M.E. Coniglio, I. M.L. D\u2019Ottaviano: New dimensions on translations between logics. Logica Universalis 3(1), 1\u201318 (2009)","journal-title":"Logica Universalis"},{"key":"9498_CR11","doi-asserted-by":"crossref","unstructured":"Czelakowski, J., Protoalgebraic Logics. Trends in logic, Studia Logica Library, Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-94-017-2807-2"},{"key":"9498_CR12","unstructured":"Czelakowski, J., and D. Pigozzi, Amalgamation and interpolation in abstract algebraic logic. In X. Caicedo and C. H. Montenegro, (eds.), Models, Algebras, and Proofs, Lecture Notes in Pure and Applied Mathematics (vol. 203), 1998, pp. 187\u2013265."},{"key":"9498_CR13","unstructured":"Descal\u00e7o, L., A. Madeira, and M. A. Martins, Applying abstract algebraic logic to classic automata theory: an exercise. In F. Ferreira, Guerra H., and E. Mayordomo, (eds.), Programs, Proofs and Processes; Computability in Europe Cie 2010, 2010, pp. 146\u2013157."},{"key":"9498_CR14","unstructured":"Feitosa, H. A., Tradu\u00e7\u00f5es Conservativas. PhD thesis, Universidade Federal de Campinas, Instituto de Filosofia e Ci\u00eancias Humanas, 1997."},{"issue":"1-3","key":"9498_CR15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0168-0072(00)00046-4","volume":"108","author":"H. A. Feitosa","year":"2001","unstructured":"Feitosa H. A., I. M. L. D\u2019Ottaviano: Conservative translations. Ann. Pure Appl. Logic 108(1-3), 205\u2013227 (2001)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9498_CR16","unstructured":"Font J. M., and R. Jansana, A general Algebraic Semantics for Sentential Logics, 2nd edition, volume 7. Lecture Notes in Logic, 2009."},{"key":"9498_CR17","unstructured":"Freyd, P. J., and A. \u0160\u010dedrov, Categories, Allegories, volume 39 of Mathematical Library. North-Holland, 1990."},{"issue":"5","key":"9498_CR18","first-page":"183","volume":"15","author":"V. Glivenko","year":"1929","unstructured":"Glivenko V.: Sur quelques points de la logique de M. Brouwer. Bulletins de la classe des sciences 15(5), 183\u2013188 (1929)","journal-title":"Brouwer. Bulletins de la classe des sciences"},{"key":"9498_CR19","unstructured":"G\u00f6del, K., An interpretation of the intuitionistic proposicional calculus (1933). In S. Feferman et\u00a0alii, (eds.), Collected works of Kurt G\u00f6del (vol. I), Oxford: Oxford University Press, 1986, pp. 301\u2013303."},{"key":"9498_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C. Hermida","year":"1998","unstructured":"Hermida C., B. Jacobs: Structural induction and coinduction in a fibrational setting. Information and Computation 145, 105\u2013121 (1998)","journal-title":"Information and Computation"},{"key":"9498_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"Kock A.: Strong functors and monoidal monads. Archiv f\u00fcr Mathematik 23, 113\u2013120 (1972)","journal-title":"Archiv f\u00fcr Mathematik"},{"key":"9498_CR22","unstructured":"Kolmogorov, A. N., On the principle of excluded middle (1925). In J. Hei-Jenoort, (ed.), From Frege to Gddot\u00f6del: a source book in mathematical logic 1879-1931, Cambridge: Harvard University Press, 1977, pp. 414\u2013437."},{"key":"9498_CR23","unstructured":"Lucanu, D., E. Goriac, G. Caltais, and G. Rosu, Circ: A behavioral verification tool based on circular coinduction. In Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings, Springer Lect. Notes Comp. Sci. (5728), 2009, pp. 433\u2013442."},{"issue":"3-4","key":"9498_CR24","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF00370681","volume":"50","author":"R. D. Maddux","year":"1991","unstructured":"Maddux R. D.: The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica 50(3-4), 42\u2013455 (1991)","journal-title":"Studia Logica"},{"issue":"2","key":"9498_CR25","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.scico.2006.01.007","volume":"65","author":"C.E. Martin","year":"2007","unstructured":"Martin C.E., S.A. Curtis, I. Rewitzky: Modelling angelic and demonic nondeterminism with multirelations. Sci. Comput. Program 65(2), 140\u2013158 (2007)","journal-title":"Sci. Comput. Program"},{"issue":"8","key":"9498_CR26","first-page":"1020","volume":"12","author":"M. A. Martins","year":"2006","unstructured":"Martins M. A.: Behavioral institutions and refinements in generalized hidden logics. Journal of Universal Computer Science 12(8), 1020\u20131049 (2006)","journal-title":"Journal of Universal Computer Science"},{"issue":"1-2","key":"9498_CR27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2007.01.024","volume":"379","author":"M.A. Martins","year":"2007","unstructured":"Martins M.A.: Closure properties for the class of behavioral models. Theor. Comput. Sci. 379(1-2), 53\u201383 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9498_CR28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1093\/comjnl\/bxm031","volume":"51","author":"M.A. Martins","year":"2008","unstructured":"Martins M.A.: On the behavioral equivalence between k-data structures. The Computer Journal 51(2), 181\u2013191 (2008)","journal-title":"The Computer Journal"},{"key":"9498_CR29","doi-asserted-by":"crossref","unstructured":"Martins, M. A., A. Madeira, and L. S. Barbosa, Refinement by interpretation. In Dang Van Hung and P. Krishnan, (eds.), 7th IEEE International Conference on Software Engineering and Formal Methods (SEFM\u201909), IEEE Computer Society Press, 2009, pp. 250\u2013259.","DOI":"10.1109\/SEFM.2009.35"},{"key":"9498_CR30","doi-asserted-by":"crossref","unstructured":"Martins, M. A., A. Madeira, and L. S. Barbosa, Refinement by interpretation in a general setting. In J. Derrick, E. Boiten, and S. Reeves, (eds.), Proc. Refinement Workshop 2009, Electr. Notes Theor. Comput. Sci. (256), Elsevier, 2009, pp. 105\u2013121.","DOI":"10.1016\/j.entcs.2009.12.020"},{"issue":"5","key":"9498_CR31","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1017\/S0960129507006305","volume":"17","author":"M.A. Martins","year":"2007","unstructured":"Martins M.A., D. Pigozzi: Behavioural reasoning for conditional equations. Math. Struct. Comput. Sci. 17(5), 1075\u20131113 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9498_CR32","doi-asserted-by":"crossref","unstructured":"Meinke, K., and J. V. Tucker, Universal algebra. In Handbook of logic in computer science, Vol. 1, volume 1 of Handb. Log. Comput. Sci., Oxford Univ. Press, New York, 1992, pp. 189\u2013411.","DOI":"10.1093\/oso\/9780198537359.003.0003"},{"key":"9498_CR33","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.tcs.2005.09.072","volume":"351","author":"Meng","year":"2005","unstructured":"Meng , Sun , L.S. Barbosa: Components as coalgebras: The refinement dimension. Theor. Comp. Sci. 351, 276\u2013294 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"9498_CR34","doi-asserted-by":"crossref","unstructured":"Michel Bidoit, M., and R. Hennicker, Proving behavioral refinements of colspecifications. In Essays Dedicated to Joseph A. Goguen, 2006, pp. 333\u2013354.","DOI":"10.1007\/11780274_18"},{"issue":"1","key":"9498_CR35","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s11787-009-0005-2","volume":"3","author":"T. Mossakowski","year":"2009","unstructured":"Mossakowski T., R. Diaconescu, A. Tarlecki: What is a logic translation?. Logica Universalis 3(1), 95\u2013124 (2009)","journal-title":"Logica Universalis"},{"key":"9498_CR36","first-page":"285","volume":"22","author":"T. Mossakowski","year":"2003","unstructured":"Mossakowski T., A.Haxthausen D. Sannella, A. Tarlecki: CASL: The common algebraic specification language: Semantics and proof theory. Computing and Informatics 22, 285\u2013321 (2003)","journal-title":"Computing and Informatics"},{"key":"9498_CR37","doi-asserted-by":"crossref","unstructured":"Palmigiano, A., Abstract logics as dialgebras. Electr. Notes Theor. Comput. Sci. 65(1), 2002.","DOI":"10.1016\/S1571-0661(04)80367-0"},{"key":"9498_CR38","unstructured":"Park, D., Concurrency and automata on infinite sequences. Springer Lect. Notes Comp. Sci. (104), 1981, pp. 561\u2013572."},{"key":"9498_CR39","doi-asserted-by":"crossref","unstructured":"Poll, E., and J. Zwanenburg, From algebras and coalgebras to dialgebras. In H. Reichel, (ed.), Coalgebraic Methods in Computer Science (CMCS\u20192001), number 44 in ENTCS. Elsevier, 2001.","DOI":"10.1016\/S1571-0661(04)80915-0"},{"key":"9498_CR40","unstructured":"Pratt, V., Origins of the calculus of binary relations. In Proc. IEEE Symp. on Logic in Computer Science, Santa Cruz, CA,USAIEEE, 1992, pp. 248\u2013254."},{"key":"9498_CR41","doi-asserted-by":"crossref","unstructured":"Prawitz, D., and P.-E. Malmn\u00e4s, A survey of some connections between classical, intuitionistic and minimal logic. In Contributions to Mathematical Logic: Proc. Logic Colloq. (Hannover 1966), North-Holland, 1968, pp. 215\u2013229.","DOI":"10.1016\/S0049-237X(08)70527-5"},{"key":"9498_CR42","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/s001650200014","volume":"13","author":"E. P. Robinson","year":"2002","unstructured":"Robinson E. P.: Variations on algebra: monadicity and generalisations of equational theories. Formal Aspects of Computing 13, 308\u2013326 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"9498_CR43","unstructured":"Rutten, J., Universal coalgebra: A theory of systems. Theoretical Computer Science 249(1):3\u201380, 2000. (Revised version of CWI Techn. Rep. CS-R9652, 1996)."},{"issue":"3","key":"9498_CR44","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00283329","volume":"25","author":"D. Sannella","year":"1988","unstructured":"Sannella D., A. Tarlecki: Towards Formal Development of Programs from Algebraic Specifications: Implementations Revisited. Acta Informatica 25(3), 233\u2013281 (1988)","journal-title":"Acta Informatica"},{"issue":"3","key":"9498_CR45","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01211084","volume":"9","author":"D. Sannella","year":"1997","unstructured":"Sannella D., A. Tarlecki: Essential concepts of algebraic specification and program development. Formal Aspects of Computing 9(3), 229\u2013269 (1997)","journal-title":"Formal Aspects of Computing"},{"key":"9498_CR46","unstructured":"Da Silva, J., I. D\u2019Ottaviano, and A. M. Sette, Translations between logics. In Models, algebras, and proofs: Selected papers of the X Latin American Symposium on Mathematical Logic, (Bogot\u00e1, 1995), Lect. Notes Pure Appl. Math. (203), 1968, pp. 435\u2013448."},{"key":"9498_CR47","unstructured":"Tarlecki, A., Abstract specification theory: An overwiew. In M. Broy, and M. Pizka, (eds.), Models, Algebras, and Logics of Engineering Software, NATO Science Series, Computer and Systems Sciences, VOL 191, IOS Press, 2003, pp. 43\u201379."},{"issue":"3","key":"9498_CR48","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski A.: On the calculus of relations. The Journal of Symbolic Logic 6(3), 73\u201389 (1941)","journal-title":"The Journal of Symbolic Logic"},{"key":"9498_CR49","doi-asserted-by":"crossref","unstructured":"Wirsing, M., Algebraic specification. In J. van Leeuwen, (ed.), Handbook of Theoretical Computer Science (volume B), Elsevier - MIT Press, 1990, pp. 673\u2013788.","DOI":"10.1016\/B978-0-444-88074-1.50018-4"},{"key":"9498_CR50","unstructured":"W\u00f3jcicki, R., Theory of logical caculi. Basic theory of consequence operations. Synthese Library, 199. Kluwer Academic Publishers., 1988."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-013-9498-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-013-9498-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-013-9498-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T02:18:27Z","timestamp":1715566707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-013-9498-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,28]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9498"],"URL":"https:\/\/doi.org\/10.1007\/s11225-013-9498-z","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,28]]}}}