Elementary Diagrams in Institutions

Journal of Logic and Computation

Volumn 14, Issue 5, 2004, Pages 651-674

  Diaconescu, Rǎzvan ^a  

^a INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Abstract model theory; Algebraic specification; Elementary diagrams; Institutions; Quasi varities

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATHEMATICAL MODELS; SEMANTICS;

ABSTRACT MODEL THEORY; ALGEBRAIC SPECIFICATION; ELEMENTARY DIAGRAMS;

FORMAL LOGIC;

EID: 7544232780     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.5.651     Document Type: Article

References (35)

1. H. Andréka and I. Németi. A general axiomatizability theorem formulated in terms of cone-injective subcategories. In Universal Algebra, B. Csakany, E. Fried, and E. Schmidt, eds. pp. 13-35. North-Holland, 1981. Colloquia Mathematics Societas János Bolyai, 29.
2. E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. Mosses, D. Sannella, and A. Tarlecki. CASL: the common algebraic specification language. Theoretical Computer Science, 286, 153-196, 2002.
3. F. Borceux. Handbook of Categorical Algebra. Cambridge University Press, 1994.
4. P. Burmeister. A Model Theoretic Approach to Partial Algebras. Akademie Verlag Berlin, 1986.
5. C.C.Chang and H.J.Keisler. Model Theory. North Holland, Amsterdam, 1990.
6. V. E. Cǎzǎnescu and G. Roşu. Weak inclusion systems. Mathematical Structures in Computer Science, 7, 195-206, 1997.
7. R. Diaconescu. Category-based constraint logic. Mathematical Structures in Computer Science, 10, 373-407, 2000.
8. R. Diaconescu.Institution-independent ultraproducts. Fundaments Informative, 55, 321-348, 2003.
9. R. Diaconescu. Institution-independent model theory. In preparation.
10. R. Diaconescu. An institution-independent proof of Craig interpolation theorem. Studia Logica, 77, 59-79, 2004.
11. R. Diaconescu and K. Futatsugi. Behavioural coherence in object-oriented algebraic specification. Universal Computer Science, 6, 74-96, 2000. First version appeared as JAIST Technical Report IS-RR-98-0017F, June 1998.
12. R. Diaconescu and K. Futatsugi. Behavioural coherence in object-oriented algebraic specification. Universal Computer Science, 6, 74-96, 2000. First version appeared as JAIST Technical Report IS-RR-98-0017F, June 1998.
13. R. Diaconescu and K. Futatsugi. Logical foundations of CafeOBJ. Theoretical Computer Science, 285, 289-318, 2002.
14. R. Diaconescu, J. Goguen, and P. Stefaneas. Logical support for modularisation. In Logical Environments. G. Huet and G. Plotkin, eds. pp. 83-130. Cambridge, 1993. Proceedings of a Workshop held in Edinburgh, Scotland, May 1991.
15. J. Fiadeiro and A. Sernadas. Structuring theories on consequence. In Recent Trends in Data Type Specification, D. Sannella and A. Tarlecki, eds. pp. 44-72. Volume 332 of Lecture Notes in Computer Science, Springer, 1988.
16. J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39, 95-146, 1992.
17. J. Goguen and G. Roşu. Hiding more of hidden algebra. In FM'99 - Formal Methods, J. M. Wing, J. Woodcock, and J. Davies, eds, pp. 1704-1719. Volume 1709 of Lecture Notes in Computer Science, Springer, 1999.
18. G. Grätzer. Universal Algebra. Springer, 1979.
19. R. Harper, D. Sannella, and A. Tarlecki. Logic representation in LF. In Proceedings, Conference on Category Theory and Computer Science, D. Pitt, D. Rydeheard, P. Dybjer, A. Pitts, and A. Poigné, eds. pp. 250-272. Volume 389 of Lecture Notes in Computer Science, Springer, 1989.
20. R. Hennicker and M. Bidoit. Observational logic. In Algebraic Methodology and Software Technology, Proc AMAST'99, A. M. Haeberer, ed. pp. 263-277, 1999.
21. S. MacLane. Categories for the Working Mathematician, second edition. Springer, 1998.
22. A. I. MaIcev. The Metamathematics of Algebraic Systems. North-Holland, 1971.
23. J. Meseguer. General logics. In: Proceedings, Logic Colloquium, 1987, H.-D. Ebbinghaus et al., eds. pp. 275-329. North-Holland, 1989.
24. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96, 73-155, 1992.
25. J. Mesegner. A logical theory of concurrent objects and its realization in the Maude language. In Research Directions in Concurrent Object-Oriented Programming, G. Agha, P. Wegner, and A. Yonezawa, eds. MIT Press, 1993.
26. H. Reichel. Structural Induction on Partial Algebras. Akademie Veriag Berlin, 1984.
27. A. Salibra and G. Scollo. Interpolation and compactness in categories of pre-institutions. Mathematical Structures in Computer Science, 6, 261-286, 1996.
28. D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Control, 76, 165-210, 1988. Earlier version in Proceedings, International Symposium on the Semantics of Data Types, Volume 173 of Lecture Notes in Computer Science, Springer, 1985.
29. D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Control, 76, 165-210, 1988. Earlier version in Proceedings, International Symposium on the Semantics of Data Types, Volume 173 of Lecture Notes in Computer Science, Springer, 1985.
30. A. Tarlecki. Bits and pieces of the theory of institutions. In Proceedings, Summer Workshop on Category Theory and Computer Programming, D. Pitt, S. Abramsky, A. Poigné, and D. Rydeheard, eds, pp 334-360. Volume 240 of Lecture Notes in Computer Science, Springer, 1986.
31. A. Tarlecki. On the existence office 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.
32. A. Tarlecki. On the existence office 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.
33. A. Tarlecki. Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences, 33, 333-360. 1986. Original version. University of Edinburgh, Report CSR-173-84.
34. A. Tarlecki. Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences, 33, 333-360. 1986. Original version. University of Edinburgh, Report CSR-173-84.
35. A. Tarlecki, R. Burstall, and J. Goguen. Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories. Theoretical Computer Science, 91, 239-264, 1991. Also, Monograph PRG-77, August 1989, Programming Research Group, Oxford University.