Interpolation and compactness in categories of pre-institutions
- 1 June 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 6 (3) , 261-286
Abstract
An analysis of relationships between Craig-style interpolation, compactness, and other related model-theoretic properties is carried out in the softer framework of categories of pre-institutions. While the equivalence between sentence interpolation and the Robinson property under compactness and Boolean closure is well known, a similar result under different assumptions (not involving compactness) is newly established for presentation interpolation. The standard concept of naturality of model transformation is enriched by a new property, termed restriction adequacy, which proves useful for the reduction of interpolation along pre-institution transformations. A distinct reduction theorem for the Robinson property is presented as well. A variant of the ultraproduct concept is further introduced, and the related closure property for pre-institutions is shown to be equivalent to compactnessKeywords
This publication has 17 references indexed in Scilit:
- Parameterized Recursion Theory — A Tool for the Systematic Classification of Specification Methods1994
- A soft stairway to institutionsLecture Notes in Computer Science, 1993
- Relationships between logical frameworks1993
- Semantical constructions for categories of behavioural specifications1989
- General Logics1989
- Initial behaviour semantics for algebraic specifications1988
- Bits and pieces of the theory of institutions1986
- A study in the foundations of programming methodology: Specifications, institutions, charters and parchments1986
- Introducing institutions1984
- Categories for the Working Mathematician1971