{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:10:03Z","timestamp":1746375003204,"version":"3.40.4"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_1","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"1-16","source":"Crossref","is-referenced-by-count":3,"title":["From Universal Logic to Computer Science, and Back"],"prefix":"10.1007","author":[{"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: \u0141o\u015b lemma holds in every category. Studia Scientiarum Mathematicarum Hungarica\u00a013, 361\u2013376 (1978)"},{"key":"1_CR2","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: A general axiomatizability theorem formulated in terms of cone-injective subcategories. In: Csakany, B., Fried, E., Schmidt, E.T. (eds.) Universal Algebra, pp. 13\u201335. North-Holland (1981); Colloquia Mathematics Societas J\u00e1nos Bolyai, 29"},{"key":"1_CR3","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: Generalization of the concept of variety and quasivariety to partial algebras through category theory. Dissertationes Mathematicae, vol.\u00a0204. Pa\u0144stwowe Wydawnictwo Naukowe (1983)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0003-4843(74)90016-3","volume":"7","author":"J. Barwise","year":"1974","unstructured":"Barwise, J.: Axioms for abstract model theory. Annals of Mathematical Logic\u00a07, 221\u2013265 (1974)","journal-title":"Annals of Mathematical Logic"},{"key":"1_CR5","unstructured":"Barwise, J., Feferman, S.: Model-Theoretic Logics. Springer (1985)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/77600.77621","volume":"37","author":"J. Bergstra","year":"1990","unstructured":"Bergstra, J., Heering, J., Klint, P.: Module algebra. Journal of the Association for Computing Machinery\u00a037(2), 335\u2013372 (1990)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/S1385-7258(53)50042-3","volume":"15","author":"E.W. Beth","year":"1953","unstructured":"Beth, E.W.: On Padoa\u2019s method in the theory of definition. Indagationes Mathematic\u00e6\u00a015, 330\u2013339 (1953)","journal-title":"Indagationes Mathematic\u00e6"},{"issue":"2\/3","key":"1_CR8","first-page":"133","volume":"35","author":"J.-Y. B\u00e9ziau","year":"2006","unstructured":"B\u00e9ziau, J.-Y.: 13 questions about universal logic. Bulletin of the Section of Logic\u00a035(2\/3), 133\u2013150 (2006)","journal-title":"Bulletin of the Section of Logic"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"B\u00e9ziau, J.-Y. (ed.): Universal Logic: an Anthology. Studies in Universal Logic. Springer Basel (2012)","DOI":"10.1007\/978-3-0346-0145-0"},{"issue":"2-3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6423(95)00014-3","volume":"25","author":"M. Bidoit","year":"1995","unstructured":"Bidoit, M., Hennicker, R., Wirsing, M.: Behavioural and abstractor specifications. Sci. Comput. Program.\u00a025(2-3), 149\u2013186 (1995)","journal-title":"Sci. Comput. Program."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0020-0190(00)00120-4","volume":"76","author":"T. Borzyszkowski","year":"2001","unstructured":"Borzyszkowski, T.: Generalized interpolation in CASL. Information Processing Letters\u00a076, 19\u201324 (2001)","journal-title":"Information Processing Letters"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(01)00317-6","volume":"286","author":"T. Borzyszkowski","year":"2002","unstructured":"Borzyszkowski, T.: Logical systems for structured specifications. Theoretical Computer Science\u00a0286(2), 197\u2013245 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.3233\/FUN-2005-66301","volume":"66","author":"T. Borzyszkowski","year":"2005","unstructured":"Borzyszkowski, T.: Generalized interpolation in first-order logic. Fundamenta Informatic\u00e6\u00a066(3), 199\u2013219 (2005)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-10007-5_41","volume-title":"Abstract Software Specifications","author":"R. Burstall","year":"1980","unstructured":"Burstall, R., Goguen, J.: The semantics of Clear, a specification language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol.\u00a086, pp. 292\u2013332. Springer, Heidelberg (1980)"},{"key":"1_CR15","volume-title":"Model Theory","author":"C.-C. Chang","year":"1990","unstructured":"Chang, C.-C., Keisler, H.J.: Model Theory. North Holland, Amsterdam (1990)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W. Craig","year":"1957","unstructured":"Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic\u00a022, 269\u2013285 (1957)","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR17","unstructured":"Diaconescu, R.: Category-based semantics for equational and constraint logic programming. DPhil thesis, University of Oxford (1994)"},{"key":"#cr-split#-1_CR18.1","doi-asserted-by":"crossref","unstructured":"Diaconescu, R.: Grothendieck institutions. Applied Categorical Structures\u00a010(4), 383-402 (2002)","DOI":"10.1023\/A:1016330812768"},{"key":"#cr-split#-1_CR18.2","unstructured":"Preliminary version appeared as IMAR Preprint 2-2000, ISSN 250-3638 (February 2000)"},{"issue":"3-4","key":"1_CR19","first-page":"321","volume":"55","author":"R. Diaconescu","year":"2003","unstructured":"Diaconescu, R.: Institution-independent ultraproducts. Fundamenta Informatic\u00e6\u00a055(3-4), 321\u2013348 (2003)","journal-title":"Fundamenta Informatic\u00e6"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:STUD.0000034185.62660.d6","volume":"77","author":"R. Diaconescu","year":"2004","unstructured":"Diaconescu, R.: An institution-independent proof of Craig Interpolation Theorem. Studia Logica\u00a077(1), 59\u201379 (2004)","journal-title":"Studia Logica"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tcs.2003.10.030","volume":"311","author":"R. Diaconescu","year":"2004","unstructured":"Diaconescu, R.: Interpolation in Grothendieck institutions. Theoretical Computer Science\u00a0311, 439\u2013461 (2004)","journal-title":"Theoretical Computer Science"},{"key":"1_CR22","unstructured":"Diaconescu, R.: Institution-independent Model Theory. Birkh\u00e4user (2008)"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.jlap.2009.09.001","volume":"79","author":"R. Diaconescu","year":"2010","unstructured":"Diaconescu, R.: Quasi-boolean encodings and conditionals in algebraic specification. Journal of Logic and Algebraic Programming\u00a079(2), 174\u2013188 (2010)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2012.03.001","volume":"433","author":"R. Diaconescu","year":"2012","unstructured":"Diaconescu, R.: An axiomatic approach to structuring specifications. Theoretical Computer Science\u00a0433, 20\u201342 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1093\/logcom\/exr007","volume":"22","author":"R. Diaconescu","year":"2012","unstructured":"Diaconescu, R.: Borrowing interpolation. Journal of Logic and Computation\u00a022(3), 561\u2013586 (2012)","journal-title":"Journal of Logic and Computation"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Diaconescu, R.: Three decades of institution theory. In: B\u00e9ziau, J.-Y. (ed.) Universal Logic: an Anthology, pp. 309\u2013322. Springer Basel (2012)","DOI":"10.1007\/978-3-0346-0145-0_25"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Diaconescu, R.: Quasi-varieties and initial semantics in hybridized institutions. Journal of Logic and Computation, doi:10.1093\/logcom\/ext016","DOI":"10.1093\/logcom\/ext016"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Diaconescu, R., Futatsugi, K.: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing, vol.\u00a06. World Scientific (1998)","DOI":"10.1142\/3831"},{"key":"1_CR29","unstructured":"Diaconescu, R., Futatsugi, K.: Behavioural coherence in object-oriented algebraic specification. Universal Computer Science\u00a06(1), 74\u201396 (1998); First version appeared as JAIST Technical Report IS-RR-98-0017F (June 1998)"},{"key":"1_CR30","unstructured":"Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G. (eds.) Logical Environments, Cambridge, pp. 83\u2013130 (1993); Proceedings of a Workshop held in Edinburgh, Scotland (May 1991)"},{"key":"1_CR31","unstructured":"Diaconescu, R., Madeira, A.: Encoding hybridized institutions into first order logic. Mathematical Structures in Computer Science (to appear)"},{"issue":"6","key":"1_CR32","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s00153-010-0193-8","volume":"49","author":"R. Diaconescu","year":"2010","unstructured":"Diaconescu, R., Petria, M.: Saturated models in institutions. Archive for Mathematical Logic\u00a049(6), 693\u2013723 (2010)","journal-title":"Archive for Mathematical Logic"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0020-0190(00)00037-5","volume":"74","author":"T. Dimitrakos","year":"2000","unstructured":"Dimitrakos, T., Maibaum, T.: On a generalized modularization theorem. Information Processing Letters\u00a074, 65\u201371 (2000)","journal-title":"Information Processing Letters"},{"key":"1_CR34","unstructured":"Ehresmann, C.: Cat\u00e9gories et strcutures, Dunod Paris (1965)"},{"issue":"18","key":"1_CR35","first-page":"1","volume":"14","author":"C. Ehresmann","year":"1968","unstructured":"Ehresmann, C.: Esquisses et types des structures alg\u00e9briques. Buletinul Institutului Politehnic Ia\u015fi\u00a014(18), 1\u201314 (1968)","journal-title":"Buletinul Institutului Politehnic Ia\u015fi"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Maksimova, L.: Interpolation and Definability: modal and intuitionistic logics. Oxford University Press (2005)","DOI":"10.1093\/acprof:oso\/9780198511748.001.0001"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Goguen, J.: A categorical manifesto. Mathematical Structures in Computer Science\u00a01(1), 49\u201367 (1991); Also, Programming Research Group Technical Monograph PRG\u201372, Oxford University (March 1989)","DOI":"10.1017\/S0960129500000050"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Goguen, J.: Types as theories. In: Reed, G.M., Roscoe, A.W., Wachter, R.F. (eds.) Topology and Category Theory in Computer Science, Oxford, pp. 357\u2013390 (1991); Proceedings of a Conference held at Oxford (June 1989)","DOI":"10.1093\/oso\/9780198537601.003.0014"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-12896-4_366","volume-title":"Logics of Programs","author":"J. Goguen","year":"1984","unstructured":"Goguen, J., Burstall, R.: Introducing institutions. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 221\u2013256. Springer, Heidelberg (1984)"},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery\u00a039(1), 95\u2013146 (1992)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57867-6_1","volume-title":"Recent Trends in Data Type Specification","author":"J. Goguen","year":"1994","unstructured":"Goguen, J., Diaconescu, R.: Towards an algebraic semantics for the object paradigm. In: Ehrig, H., Orejas, F. (eds.) Abstract Data Types 1992 and COMPASS 1992. LNCS, vol.\u00a0785, pp. 1\u201334. Springer, Heidelberg (1994)"},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(99)00275-3","volume":"245","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Malcolm, G.: A hidden agenda. Theoretical Computer Science\u00a0245(1), 55\u2013101 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR43","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11225-007-9022-4","volume":"85","author":"D. G\u0103in\u0103","year":"2007","unstructured":"G\u0103in\u0103, D., Popescu, A.: An institution-independent proof of Robinson consistency theorem. Studia Logica\u00a085(1), 41\u201373 (2007)","journal-title":"Studia Logica"},{"key":"1_CR44","unstructured":"Guitart, R., Lair, C.: Calcul syntaxique des mod\u00e8les et calcul des formules internes. Diagramme\u00a04 (1980)"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-49253-4_20","volume-title":"Algebraic Methodology and Software Technology","author":"R. Hennicker","year":"1998","unstructured":"Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, pp. 263\u2013277. Springer, Heidelberg (1998)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Makkai, M.: Ultraproducts and categorical logic. In: DiPrisco, C.A. (ed.) Methods in Mathematical Logic. Lecture Notes in Mathematics, vol.\u00a01130, pp. 222\u2013309. Springer (1985)","DOI":"10.1007\/BFb0075314"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Makkai, M., Reyes, G.: First order categorical logic: Model-theoretical methods in the theory of topoi and related categories. Lecture Notes in Mathematics, vol.\u00a0611. Springer (1977)","DOI":"10.1007\/BFb0066201"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-22944-2_20","volume-title":"Algebra and Coalgebra in Computer Science","author":"M.A. Martins","year":"2011","unstructured":"Martins, M.A., Madeira, A., Diaconescu, R., Barbosa, L.S.: Hybridization of institutions. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 283\u2013297. Springer, Heidelberg (2011)"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"250","DOI":"10.4153\/CJM-1978-024-5","volume":"30","author":"G. Matthiessen","year":"1978","unstructured":"Matthiessen, G.: Regular and strongly finitary structures over strongly algebroidal categories. Canadian Journal of Mathematics\u00a030, 250\u2013261 (1978)","journal-title":"Canadian Journal of Mathematics"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Donald Monk, J.: Mathematical Logic. Springer (1976)","DOI":"10.1007\/978-1-4684-9452-5"},{"issue":"3","key":"1_CR51","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.2178\/jsl\/1154698588","volume":"71","author":"M. Petria","year":"2006","unstructured":"Petria, M., Diaconescu, R.: Abstract Beth definability in institutions. Journal of Symbolic Logic\u00a071(3), 1002\u20131028 (2006)","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR52","unstructured":"Reichel, H.: Behavioural equivalence \u2013 a unifying concept for initial and final specifications. In: Proceedings, Third Hungarian Computer Science Conference, Budapest. Akademiai Kiado (1981)"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Reichel, H.: Initial Computability, Algebraic Specifications, and Partial Algebras, Clarendon (1987)","DOI":"10.1515\/9783112573426"},{"key":"1_CR54","unstructured":"Ro\u015fu, G.: Hidden Logic. PhD thesis, University of California at San Diego (2000)"},{"key":"1_CR55","unstructured":"Rodenburg, P.-H.: Interpolation in conditional equational logic. Preprint from Programming Research Group at the University of Amsterdam (1989)"},{"key":"1_CR56","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01190411","volume":"28","author":"P.-H. Rodenburg","year":"1991","unstructured":"Rodenburg, P.-H.: A simple algebraic proof of the equational interpolation theorem. Algebra Universalis\u00a028, 48\u201351 (1991)","journal-title":"Algebra Universalis"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specifications and Formal Software Development. Springer (2012)","DOI":"10.1007\/978-3-642-17336-3"},{"key":"1_CR58","unstructured":"Shoenfield, J.: Mathematical Logic. Addison-Wesley (1967)"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-17162-2_132","volume-title":"Proceedings, Summer Workshop on Category Theory and Computer Programming","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A.: Bits and pieces of the theory of institutions. In: Pitt, D., Abramsky, S., Poign\u00e9, A., Rydeheard, D. (eds.) Category Theory and Computer Programming. LNCS, vol.\u00a0240, pp. 334\u2013360. Springer, Heidelberg (1986)"},{"key":"1_CR60","unstructured":"Tarski, A.: On some fundamental concepts of metamathematics. In: Logic, Semantics, Metamathematics, pp. 30\u201337. Oxford University Press (1956)"},{"issue":"2","key":"1_CR61","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0020-0190(96)00146-9","volume":"60","author":"P. Veloso","year":"1996","unstructured":"Veloso, P.: On pushout consistency, modularity and interpolation for logical specifications. Information Processing Letters\u00a060(2), 59\u201366 (1996)","journal-title":"Information Processing Letters"},{"key":"1_CR62","unstructured":"Wells, C.F.: Sketches: Outline with references (unpublished draft)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:44:37Z","timestamp":1746373477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}