Quasi-varieties in abstract algebraic institutions
Journal of Computer and System Sciences
Bits and pieces of the theory of institutions
Proceedings of a tutorial and workshop on Category theory and computer programming
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Abstract and concrete categories
Abstract and concrete categories
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
CASL: the common algebraic specification language
Theoretical Computer Science
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Institution-independent Model Theory
Institution-independent Model Theory
Interpolation in logics with constructors
Theoretical Computer Science
Hi-index | 0.00 |
We generalise the ultraproducts method from conventional model theory to an institution-independent (i.e. independent of the details of the actual logic formalised as an institution) framework based on a novel very general treatment of the semantics of some important concepts in logic, such as quantification, logical connectives, and ground atomic sentences. Unlike previous abstract model theoretic approaches to ultraproducts based on category theory, our work makes essential use of concepts central to institution theory, such as signature morphisms and model reducts. The institution-independent fundamental theorem on ultraproducts is presented in a modular manner, different combinations of its various parts giving different results in different logics or institutions. We present applications to institution-independent compactness, axiomatizability, and higher order sentences, and illustrate our concepts and results with examples from four different algebraic specification logics. In the introduction we also discuss the relevance of our institution-independent approach to the model theory of algebraic specification and computing science, but also to classical and abstract model theory.