Abstract
This paper is dedicated to Joseph Goguen, my beloved teacher and friend, on the ocassion of his 65th anniversary. It is a survey of institution-independent model theory as it stands today, the true form of abstract model theory which is based on the concept of institution. Institution theory was co-fathered by Joseph Goguen and Rod Burstall in late 1970’s. In the final part we discuss some philosophical roots of institution-independent methodologies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andréka, H., Németi, I.: A general axiomatizability theorem formulated in terms of cone-injective subcategories. In: Csakany, B., Fried, E., Schmidt, E.T. (eds.) Universal Algebra. Colloquia Mathematics Societas János Bolyai, vol. 29, pp. 13–35. North-Holland, Amsterdam (1981)
Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Brückner, B., Mosses, P., Sannella, D., Tarlecki, A.: CASL: The common algebraic specification language. Theoretical Computer Science 286(2), 153–196 (2002)
Barbier, F.: Géneralisation et préservation au travers de la combinaison des logique des résultats de théorie des modèles standards liés à la structuration des spécifications algébriques. PhD thesis, Université Evry (2005)
Barwise, J.: Axioms for abstract model theory. Annals of Mathematical Logic 7, 221–265 (1974)
Barwise, J., Feferman, S.: Model-Theoretic Logics. Springer, Heidelberg (1985)
Bernot, G., Le Gall, P., Aiguier, M.: Label algebras and exception handling. Science of Computer and Programming 23, 227–286 (1994)
Bidoit, M., Hennicker, R.: On the integration of the observability and reachability concepts. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 21–36. Springer, Heidelberg (2002)
Borzyszkowski, T.: Higher-order logic and theorem proving for structured specifications. In: Bert, D., Choppy, C., Mosses, P.D. (eds.) WADT 1999. LNCS, vol. 1827, pp. 401–418. Springer, Heidelberg (2000)
Borzyszkowski, T.: Logical systems for structured specifications. Theoretical Computer Science 286(2), 197–245 (2002)
Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras. Akademie-Verlag, Berlin (1986)
Burstall, R., Goguen, J.: Semantics of Clear. In: Unpublished notes handed out at the 1978 Symposium on Algebra and Applications, Stefan Banach Center, Warsaw (1978)
Chang, C.C., Keisler, H.J.: Model Theory. North Holland, Amsterdam (1990)
Círstea, C.: Institutionalising many-sorted coalgebraic modal logic. In Coalgebraic Methods in Computer Science 2002, Electronic Notes in Theoretical Computer Science (2002)
Sȩrbănut¸ă, T.: Institutional concepts in first-order logic, parameterized specification, and logic programming. Master’s thesis, University of Bucharest (2004)
Căzănescu, V.E., Ros̨u, G.: Weak inclusion systems. Mathematical Structures in Computer Science 7(2), 195–206 (1997)
Diaconescu, R.: Institution-independent Model Theory. Book draft (Ask author for current draft at Razvan.Diaconescu@imar.ro) (to appear)
Diaconescu, R.: Extra theory morphisms for institutions: logical semantics for multi-paradigm languages. Applied Categorical Structures 6(4), 427–453 (1998), A preliminary version appeared as JAIST Technical Report IS-RR-97-0032F in 1997
Diaconescu, R.: Grothendieck institutions. Applied Categorical Structures 10(4), 383–402 (2002), Preliminary version appeared as IMAR Preprint 2-2000, ISSN 250-3638 (February 2000)
Diaconescu, R.: Institution-independent ultraproducts. Fundamenta Informaticæ 55(3-4), 321–348 (2003)
Diaconescu, R.: Elementary diagrams in institutions. Journal of Logic and Computation 14(5), 651–674 (2004)
Diaconescu, R.: Herbrand theorems in arbitrary institutions. Information Processing Letters 90, 29–37 (2004)
Diaconescu, R.: An institution-independent proof of Craig Interpolation Theorem. Studia Logica 77(1), 59–79 (2004)
Diaconescu, R.: Interpolation in Grothendieck institutions. Theoretical Computer Science 311, 439–461 (2004)
Diaconescu, R.: Proof systems for institutional logic. Journal of Logic and Computation (2006) (to appear)
Diaconescu, R., Futatsugi, K.: Logical foundations of CafeOBJ. Theoretical Computer Science 285, 289–318 (2002)
Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G. (eds.) Proceedings of a Workshop held in Logical Environment, Edinburgh, Scotland (May 1991)
Diaconescu, R., Petria, M.: Saturated models in institutions. (in preparation)
Diaconescu, R., Stefaneas, P.: Possible worlds semantics in arbitrary institutions. Technical Report 7, Institute ofMathematics of the Romanian Academy, ISSN 250-3638 (June 2003)
Dimitrakos, T., Maibaum, T.: On a generalized modularization theorem. Information Processing Letters 74, 65–71 (2000)
Fiadeiro, J.L., Costa, J.F.: Mirror, mirror in my hand: A duality between specifications and models of process behaviour. Mathematical Structures in Computer Science 6(4), 353–373 (1996)
Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)
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. 785, pp. 1–34. Springer, Heidelberg (1994)
Grätzer, G.: Universal Algebra. Springer, Heidelberg (1979)
G˘ain˘a, D., Popescu, A.: An institution-independent generalization of Tarski’s Elementary Chain Theorem. Journal of Logic and Computation (to appear)
G˘ain˘a, D., Popescu, A.: An institution-independent proof of Robinson consistency theorem. Studia Logica (to appear)
Bell, J.L., Slomson, A.B.: Models and Ultraproducts. North-Holland, Amsterdam (1969)
Lambek, J., Scott, P.: Introduction to Higher Order Categorical Logic, Cambridge. Cambridge Studies in Advanced Mathematics, vol. 7 (1986)
Lane, S.M.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (1998)
Łoś, J.: Quleques remarques, théorèmes et problèmes sur les classes définissables d’algèbres. In: Mathematical Interpretation of Formal Systems, pp. 98–113. North-Holland, Amsterdam (1955)
Makkai, M.: Ultraproducts and categorical logic. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 222–309. Springer, Heidelberg (1996)
Makkai Stone, M.: duality for first order logic. Advances in Mathematics 65(2), 97–170 (1987)
Malcev, I.: The Metamathematics of Algebraic Systems. North-Holland, Amsterdam (1971)
Matthiessen, G.: Regular and strongly finitary structures over strongly algebroidal categories. Canad. J. Math. 30, 250–261 (1978)
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)
Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, The MIT Press, Cambridge (1993)
Mossakowski, T.: Comorphism-based Grothendieck logics. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 593–604. Springer, Heidelberg (2002)
Mossakowski, T.: Foundations of heterogeneous specification. In: 16th Workshop on Algebraic Development Techniques 2002. LNCS, Springer, Heidelberg (2003)
Mossakowski, T., Goguen, J., Diaconescu, R., Tarlecki, A.: What is a logic. In: Beziau, J.-Y. (ed.) Logica Universalis, pp. 113–133. Birkhauser, Basel (2005)
Petria, M., Diaconescu, R.: Abstract Beth definability in institutions. Journal of Symbolic Logic (2006) (to appear)
Popescu, A., Sęrbănut̨ă, T., Ros̨u, G.: A semantic approach to interpolation (submitted)
Salibra, A., Scollo, G.: Interpolation and compactness in categories of pre-institutions. Mathematical Structures in Computer Science 6, 261–286 (1996)
Schröder, L., Mossakowski, T., Lüth, C.: Type class polymorphism in an institutional framework. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 234–248. Springer, Heidelberg (2005)
Tarlecki, A.: Bits and pieces of the theory of institutions. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 334–360. Springer, Heidelberg (1986)
Tarlecki, A.: On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37, 269–304 (1986), Preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165-84 (1984)
Tarlecki, A.: Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences 33(3), 333–360 (1986), Original version, University of Edinburgh, Report CSR-173-84.
Tarlecki, A., Burstall, R., Goguen, J.: Some fundamental algebraic tools for the semantics of computation, part 3: Indexed categories. Theoretical Computer Science 91, 239–264 (1991), Also, Monograph PRG–77, Programming Research Group, Oxford University (August 1989)
Tarski, A., Vaught, R.: Arithmetical extensions of relational systems. Compositio Mathematicæ 13, 81–102 (1957)
His Holiness the XIVth Dalai Lama. The Universe in a Single Atom. Wisdom Publications (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Diaconescu, R. (2006). Jewels of Institution-Independent Model Theory. In: Futatsugi, K., Jouannaud, JP., Meseguer, J. (eds) Algebra, Meaning, and Computation. Lecture Notes in Computer Science, vol 4060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780274_5
Download citation
DOI: https://doi.org/10.1007/11780274_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35462-8
Online ISBN: 978-3-540-35464-2
eBook Packages: Computer ScienceComputer Science (R0)