Interpolation and compactness in categories of pre-institutions

Mathematical Structures in Computer Science

Volumn 6, Issue 3, 1996, Pages 261-286

  Salibra, Antonino ^a   Scollo, Giuseppe ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SOCIETIES AND INSTITUTIONS;

CLOSURE PROPERTY; MODEL TRANSFORMATION; MODEL-THEORETIC; NATURALITY; ROBINSON; STYLE INTERPOLATION;

INTERPOLATION;

EID: 0005261451     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500001006     Document Type: Article

References (32)

1. Andreka, H. and Nemeti, I. (1981) A general axiomatizability theorem formulated in terms of coneinjective subcategories. In: Csakany, B., Fried, E. and Schmidt, E. T. (eds.) Universal Algebra. Colloquia Mathematics Societatis Jdnos Bolyai 29 13-35.
2. Andreka, H., Nemeti, I. and Sain, I. (1984) Abstract model theoretic approach to algebraic logic (an overview). Manuscript, Mathematical Institute, Budapest. Revised version available as CCSOM Working Paper 92-92 (1992), Amsterdam, The Netherlands.
3. Andreka, H.( Nemeti, I. and Sain, I. (1994) Applying Algebraic Logic to Logic. In: Nivat, M., Rattray, C. M. I., Rus, T. and Scollo, G. (eds.) Algebraic Methodology and Software Technology (AMAST'93) Workshops in Computing, Springer-Verlag 5-26.
4. Astesiano, E. and Cerioli, M. (1993) Relationships between logical frameworks. In: Bidoit, M. and Choppy, C. (eds.) Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 665 126-143.
5. Bernot, G. and Bidoit, M. (1992) Proving the correctness of algebraically specified software: Modularity and Observability issues. In: Nivat, M., Rattray, C. M. I., Rus, T. and Scollo, G. (eds.) Algebraic Methodology and Software Technology (AMAST'93) Workshops in Computing, Springer-Verlag 216-239.
6. Cerioli, M. (1993) Relationships between logical formalisms, Ph.D. Thesis, DISI, University of Genova, Genova, Italy.
7. Diaconescu, R., Goguen J. A. and Stefaneas, P. (1993) Logical Support for Modularisation. In: Huet, G. and Plotkin, G. (eds.) Logical Environments, Cambridge University Press 83-130.
8. Ebbinghaus, H.-D. (1985) Extended logics: the general framework. In: Barwise, J. and Feferman, S. (eds.) Model-Theoretic Logics, Springer-Verlag 25-76.
9. Ebbinghaus, H.-D., Flum, J. and Thomas, W. (1984) Mathematical Logic, Springer-Verlag.
10. Ehrig, H., Baldamus, M., Cornelius, F. and Orejas, F. (1992) Theory of Algebraic Module Specification Including Behavioural Semantics and Constraints. In: Nivat, M., Rattray, C. M. I., Rus, T. and Scollo, G. (eds.) Algebraic Methodology and Software Technology (AMAST'93) Workshops in Computing, Springer-Verlag 145-172.
11. Goguen, J.A. and Burstall, R.M. (1984) Introducing Institutions. In: Clarke, E. and Kozen, D. (eds.) Logics of Programs. Springer-Verlag Lecture Notes in Computer Science 164 221-256.
12. Goguen, J. A. and Burstall, R. M. (1986) A Study in the Foundations of Programming Methodology: Specifications, Institutions, Charters and Parchments. In: Pitt, D., Abramsky, S., Poigne, A. and Rydeheard, D. (eds.) Category Theory and Computer Programming. Springer-Verlag Lecture Notes in Computer Science 240 313-333.
13. Goguen, J.A. and Burstall, R.M. (1992) Institutions: Abstract model theory for specification and programming. J. Assoc. Comput. Mack 39 95-146.
14. Goguen, J.A. and Meseguer, J. (1989) Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations, Report SRI-CSL-89-10, SRI International, Computer Science Laboratory, Menlo Park, California.
15. Kreowski, H.-J. and Mossakowski, T. (1993) Equivalence and Difference of Institutions: Simulating Horn Clause Logic with Based Algebras. Draft, FB Informatik, Universitat Bremen.
16. Los, J. (1954) Quelques remarques, theoremes, et problemes sur les classes definissables d'algebres. In: Mathematical Interpretation of Formal Systems, Studies in Logic and the Foundations of Mathematics, Symposium, Amsterdam 98-113.
17. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics 5 Springer-Verlag.
18. Makowski, J.-A. (1985) Compactness, Embeddings and Definability. In: Barwise, J. and Feferman, S. (eds.) Model-Theoretic Logics, Springer-Verlag 645-716.
19. Makowski, J.-A. and Mundici, D. (1985) Abstract Equivalence Relations. In: Barwise, J. and Feferman, S. (eds.) Model-Theoretic Logics, Springer-Verlag 717-746.
20. Manca, V., Salibra, A. and Scollo, G. (1990) Equational type logic. Theoretical Computer Science 77 131-159.
21. Manca, V., Salibra, A. and Scollo, G. (1992) On the expressiveness of equational type logic. In: Rattray, C. M. I., and Clark, R. G. (eds.) The Unified Computation Laboratory: Modelling, Specifications and Tools, Oxford University Press 85-100.
22. Meseguer, J. (1989) General Logics. In: Ebbinghaus, H.-D. et al. (eds.) Logic Colloquium '87, North-Holland 275-329.
23. Mossakowski, T. (1994) Parameterized Recursion Theory - A Tool for the Systematic Classification of Specification Methods. In: Nivat, M., Rattray, C. M. I., Rus, T. and Scollo, G. (eds.) Algebraic Methodology and Software Technology (AMAST'93) Workshops in Computing, Springer-Verlag 137-144.
24. Nivela, M.P. and Orejas, F. (1988) Initial Behaviour Semantics for Algebraic Specifications. In: Sannella, D. T. and Tarlecki, A. (eds.) Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 332 184-207.
25. Nivela, M. P., Orejas, F. and Ehrig, H. (1989) Semantical Constructions for Categories of Behavioural Specifications. In: Ehrig, H., Herrlich, H., Kreowski, H.-J. and PreuB, G. (eds.) Categorical Methods in Computer Science - with Aspects from Topology. Springer-Verlag Lecture Notes in Computer Science 393 220-245.
26. Rodenburg, P. H. (1991) A simple algebraic proof of the equational interpolation theorem. Algebra Universalis 28 48-51.
27. Rodenburg, P. H. and Van Glabbeek, R. J. (1988) An interpolation theorem in equational logic. CWI Report CS-R8838, Amsterdam, The Netherlands.
28. Salibra, A. and Scollo, G. (1993) A soft stairway to institutions. In: Bidoit, M. and Choppy, C. (eds.) Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 665 310-329.
29. Salibra, A. and Scollo, G. (1993) Compactness and Lowenheim-Skolem properties in categories of pre-institutions. In: Rauszer, C. (ed.) Algebraic Methods in Logic and in Computer Science, Banach Center Publ. 28, Inst. Math. Polish Acad. Sci., Warszawa. Poland 67-94.
30. Sannella, D. T. and Tarlecki, A. (1988) Specifications in an arbitrary institution. Inform, and Comput. 76 165-210.
31. Tarlecki, A. (1985) On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37 269-304.
32. Tarlecki, A. (1986) Bits and pieces of the theory of institutions. In: Pitt, D., Abramsky, S., Poigne, A. and Rydeheard, D. (eds.) Category Theory and Computer Programming. Springer-Verlag Lecture Notes in Computer Science 240 334-360.