Institution-independent ultraproducts
Fundamenta Informaticae
Stratified institutions and elementary homomorphisms
Information Processing Letters
A categorical study on the finiteness of specifications
Information Processing Letters
A Heterogeneous Approach to UML Semantics
Concurrency, Graphs and Models
A semantic approach to interpolation
Theoretical Computer Science
Conservativity in Structured Ontologies
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An encoding of partial algebras as total algebras
Information Processing Letters
An institutional version of Gödel's completeness theorem
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A heterogeneous approach to service-oriented systems specification
Proceedings of the 2010 ACM Symposium on Applied Computing
Towards a Functional Approach to Modular Ontologies using Institutions
Proceedings of the 2010 conference on Modular Ontologies: Proceedings of the Fourth International Workshop (WoMO 2010)
Complete calculi for structured specifications in fork algebra
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Towards managing dynamic reconfiguration of software systems in a categorical setting
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Coinduction for preordered algebra
Information and Computation
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Hybrid specification of reactive systems: an institutional approach
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
First-order logic with dependent types
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Interpolation for predefined types
Mathematical Structures in Computer Science
Behavioral extensions of institutions
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
An axiomatic approach to structuring specifications
Theoretical Computer Science
Towards logical frameworks in the heterogeneous tool set hets
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Institution-independent Ultraproducts
Fundamenta Informaticae
Principles of proof scores in CafeOBJ
Theoretical Computer Science
Interpolation in logics with constructors
Theoretical Computer Science
Institutional semantics for many-valued logics
Fuzzy Sets and Systems
Towards an institution for Object-Z specifications
International Journal of Computer Applications in Technology
Comorphisms of structured institutions
Information Processing Letters
Parameterisation for abstract structured specifications
Theoretical Computer Science
| Hi-index | 0.01 |
A model theory that is independent of any concrete logical system allows a general handling of a large variety of logics. This generality can be achieved by applying the theory of institutions that provides a precise mathematical formulation for the intuitive concept of a logical system. Especially in computer science, where the development of a huge number of specification logics is observable, institution-independent model theory simplifies and sometimes even enables a concise model-theoretic analysis of the system. Besides incorporating important methods and concepts from conventional model theory, the proposed top-down methodology allows for a structurally clean understanding of model-theoretic phenomena. As a consequence, results from conventional concrete model theory can be understood more easily, and sometimes even new results are obtained.