Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-16T08:41:28.805Z Has data issue: false hasContentIssue false

ON THE FRAGILITY OF INTERPOLATION

Published online by Cambridge University Press:  21 March 2024

ANDRZEJ TARLECKI*
Affiliation:
INSTITUTE OF INFORMATICS UNIVERSITY OF WARSAW UL. BANACHA 2, 02-097 WARSAW, POLAND
Rights & Permissions [Opens in a new window]

Abstract

We study a version of the Craig interpolation theorem formulated in the framework of the theory of institutions. This formulation proved crucial in the development of a number of key results concerning foundations of software specification and formal development. We investigate preservation of interpolation properties under institution extensions by new models and sentences. We point out that some interpolation properties remain stable under such extensions, even if quite arbitrary new models and sentences are permitted. We give complete characterisations of such situations for institution extensions by new models, by new sentences, as well as by new models and sentences, respectively.

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

1. Introduction

The Craig interpolation theorem [Reference Craig13] states that when an implication $\varphi \mathbin {\Rightarrow }\psi $ between premise $\varphi $ and conclusion $\psi $ holds then there is an interpolant $\theta $ built using the symbols the premise and the conclusion have in common (i.e., built on the intersection of the signatures of $\varphi $ and of $\psi $ , respectively) that witnesses this implication, that is, such that both $\varphi \mathbin {\Rightarrow }\theta $ and $\theta \mathbin {\Rightarrow }\psi $ hold. This is one of the fundamental properties of the classical first-order logic, with numerous consequences and links with other key properties developed in the framework of classical model theory [Reference Chang and Jerome Keisler12].

In the area of foundations of system specification and formal development, interpolation proved indispensable for a number of most fundamental features of various approaches. This was perhaps first pointed out in [Reference Maibaum, Sadler, Veloso, Joseph and Shyamasundar28], where it was used to ensure composability of subsequent implementation steps (later refined in various forms of so-called modularisation theorem [Reference Veloso49, Reference Veloso and Maibaum50]). Perhaps better known is the work on module algebra [Reference Bergstra, Heering and Klint3], where the interpolation theorem was used to obtain crucial distributive laws for their export operator ([Reference Renardel de Lavalette35] joined the two threads later). The standard by now proofs of completeness of proof calculi for consequences of structured specification rely on interpolation [Reference Borzyszkowski6, Reference Cengarle11] (in fact, no “good” sound and complete such proof calculus may exist without an appropriate interpolation property for the underlying logic [Reference Sannella and Tarlecki41]). These and further results concerning completeness of various reasoning systems necessary in the process of reliable software development involve interpolation explicitly, but the same idea that showing properties of a union of a number of extensions of a basic theory must rely on some form of interpolation (perhaps disguised as the Robinson consistency theorem [Reference Robinson36]) is omnipresent in both practical and foundational aspects of computing.

Applications of logic in computer science face the problem of dealing with a multitude of logical systems. This follows from the real needs of practical software development, based on the multitude of application areas as well as of practically important programming paradigms, features, and languages. In the area of software specification, this led to various attempts to abstract away from the details of a specific logical system in use. Such an independence of the foundations for software specification from the particulars of the underlying logic has been successfully achieved by relying on the concept of an institution, introduced by Goguen and Burstall as a formalisation of the notion of a logical system [Reference Goguen and Burstall26] (see, for instance, [Reference Sannella and Tarlecki40] for an exhaustive account of such ideas, with further examples in the development of specification formalisms such as Casl [Reference Astesiano, Bidoit, Kirchner, Krieg-Brückner, Mosses, Sannella and Tarlecki1]).

Independently of these applications, it has been realised quite early that institutions offer a framework for developing a very abstract version of model theory, going beyond what has been studied within abstract model theory following [Reference Barwise2]. This was noted in [Reference Tarlecki, Pitt, Abramsky, Poigné and Rydeheard42] and expanded in many crucial directions by Diaconescu and his group; Diaconescu’s monograph [Reference Diaconescu15] offers an extensive overview of this work, with later developments scattered through numerous articles (see, e.g., [Reference Diaconescu and Béziau18] and the references therein).

In particular, in the institutional model theory the interpolation property is formulated so that it can be studied (and used) for logical systems departing considerably from the first-order logic. This was put forward in [Reference Tarlecki, Pitt, Abramsky, Poigné and Rydeheard42], but we use here a still more refined formulation of interpolation given in [Reference Diaconescu14, Reference Roşu and Goguen38]. This formulation of the interpolation property uses logical entailment (rather than implication), sets of sentences (rather than individual sentences) and, most crucially, works over arbitrary commutative squares of signature morphisms (rather than over union/intersection squares only). Consequently, it caters for instance for logical systems where one lacks compactness, conjunction and other classical connectives, and even the concept of the set of symbols used in a formula and intersection/union of signatures may not be directly available. Indeed, the key point of many of the applications mentioned above is the need to abstract away from signature inclusions and deal with interpolation properties with respect to other signature morphisms. For instance, non-injective signature morphisms are of practical importance when parameterised specifications with the standard pushout-style parameter passing are considered [Reference Ehrig, Kreowski, Thatcher, Wagner and Wright21, Reference Thatcher, Wagner and Wright47]. Much subsequent work used this formulation, and included development of generic model-theoretic proof techniques to establish interpolation property for logical systems formalised as institutions satisfying a number of structural properties. This led to new results concerning various logical systems, as well as to studying interpolation in even more general context of non-standard entailment relations [Reference Borzyszkowski7, Reference Diaconescu14, Reference Diaconescu17, Reference Diaconescu19, Reference Găină23Reference Găină and Popescu25, Reference Popescu, Şerbănuţă and Roşu34].

The need for the use of many logical systems leads to the need for establishing their required properties, including the interpolation property we study here. Rather than establishing such properties for each system anew, it is desirable to ensure them in the course of systematic construction of new logics, perhaps along the lines aimed at for instance in [Reference Mossakowski, Pawłowski, Sannella, Tarlecki, Iida, Meseguer and Ogata31, Reference Mossakowski, Tarlecki, Pawłowski and Parisi-Presicce32] or [Reference Caleiro, Gouveia, Ramos, Wirsing, Pattinson and Hennicker8Reference Caleiro, Sernadas, Sernadas, Artëmov, Barringer, d’Avila Garcez, Lamb and Woods10]. Typically, the new logics are linked with the original ones by institution (co)morphisms [Reference Goguen and Burstall26, Reference Goguen and Roşu27]. An important line of research here was to clarify sufficient conditions on the institution (co)morphisms that allow interpolation properties to be “borrowed” from one institution by another [Reference Diaconescu16, Reference Găină23].

In this paper we address a perhaps more basic question that arises in this framework: namely, whether interpolation properties can be spoiled by extending a logic by new abstract models or sentences. Looking at the standard formulation of the Craig interpolation property, it seems that the answer is always positive: given a true implication, to spoil an interpolant for its premise and conclusion, just add a new abstract model that satisfies the premise but not the interpolant, or a new abstract model that satisfies the interpolant but not the conclusion, thus spoiling the required entailment between the premise and the interpolant, or between the interpolant and the conclusion, respectively. This should work, except for the trivial cases when the signature of the premise includes or is included in the signature of the conclusion. At a closer look though, in the framework where one considers arbitrary morphisms between the signatures involved, when we add new models for the signature of the premise or for the signature of the conclusion, new models for their union signature may emerge (as reducts w.r.t. some signature morphisms of the models added explicitly) and ruin the implication between the premise and the conclusion one starts with.

We explore the consequences of this phenomena, and characterise exactly the situations where interpolation is stable under extensions of the institution. Equivalently, looking at the other side of this coin, we characterise the situations where new models or sentences may spoil the interpolation property. More precisely: we consider separately institution extensions where only new models, only new sentences, and both new models and sentences, respectively, are permitted. In each of these three cases complete characterisations are given, formulating necessary and sufficient conditions for a commutative square of signature morphisms under which no such institution extension may spoil interpolation properties over this square.

Similar characterisations are then derived for a natural finitary version of the Craig interpolation property, where the interpolant set of sentences is required to be finite (or, somewhat more generally, of a bounded cardinality) for any sets of premises and conclusions similarly bounded.

Finally, we study the so-called Craig–Robinson (or parameterised) interpolation, which is in general stronger than the Craig interpolation and is in fact needed in many applications, for instance in the area of software specifications and development [Reference Diaconescu15, Reference Dimitrakos and Maibaum20, Reference Sannella and Tarlecki40]. Similar complete characterisations are obtained, with an interesting difference concerning the characterisation of commutative squares of signature morphisms that admit interpolation in any extension of the institution by new models and sentences, when a certain symmetry in the role of the premise and conclusion signatures, present in the classical Craig interpolation, breaks down.

2. Institutions

2.1. Notational preliminaries

For any function $f\colon X\to Y$ , given a set $X'\subseteq X$ , $f(X')=\{f(x) \mid x\in X'\}\subseteq Y$ is the image of $X'$ w.r.t. f, and for $Y'\subseteq Y$ , $f^{-1}(Y') = \{ x\in X \mid f(x)\in Y'\}$ is the coimage of $Y'$ w.r.t. f.

Throughout the paper we freely use the basic notions from category theory (category, functor, natural transformation, pushout, etc.). Composition in any category is denoted by “ ${\mathord {;}}$ ” (semicolon) and written in the diagrammatic order. For instance, $f\colon A\to B$ is a retraction if for some $g\colon B\to A$ we have $g\mathord {;} f= {id}_B$ , and $f\colon A\to B$ is a coretraction (or section) if for some $g\colon B\to A$ we have $f\mathord {;} g= {id}_A$ . The collection of objects of any category $\textbf {K}$ is written as $|\textbf {K}|$ . The category of sets is denoted by $\mathbf {Set}$ , and the (quasi-)category of classes (or discrete categories) by $\mathbf {Class}$ .

2.2. Institutions

In the area of foundations of software specification and development [Reference Sannella and Tarlecki40] it is standard by now to abstract away from the details of the logical system in use, relying on the formalisation of a logical system as an institution [Reference Goguen and Burstall26]. An institution ${\mathbf {I}}$ consists of:

  • a category $\mathbf {Sig}_{\mathbf {I}}$ of signatures;

  • a functor $\mathbf {Sen}_{\mathbf {I}} \colon \mathbf {Sig}_{\mathbf {I}} \rightarrow \mathbf {Set}$ , giving a set $\mathbf {Sen}_{\mathbf {I}}(\Sigma )$ of $\Sigma $ -sentences for each signature $\Sigma \in |\mathbf {Sig}_{\mathbf {I}}|$ ;

  • a functor $\mathbf {Mod}_{\mathbf {I}} \colon \mathbf {Sig}_{\mathbf {I}}^{\mathit{op}} \rightarrow \mathbf {Class}$ , giving a class (or a discrete category)Footnote 1 $\mathbf {Mod}_{\mathbf {I}}(\Sigma )$ of $\Sigma $ -models for each signature $\Sigma \in |\mathbf {Sig}_{\mathbf {I}}|$ ; and

  • a family $\langle {{\models _{\mathbf {I},\Sigma }} \subseteq {\mathbf {Mod}_{\mathbf {I}}(\Sigma ) \times \mathbf {Sen}_{\mathbf {I}}(\Sigma )}}\rangle _{\Sigma \in |\mathbf {Sig}_{\mathbf {I}}|}$ of satisfaction relations

such that the reducts $\mathbf {Mod}_{\mathbf {I}}(\sigma ) \colon \mathbf {Mod}_{\mathbf {I}}(\Sigma ') \rightarrow \mathbf {Mod}_{\mathbf {I}}(\Sigma )$ of models and translations $\mathbf {Sen}_{\mathbf {I}}(\sigma ) \colon \mathbf {Sen}_{\mathbf {I}}(\Sigma ) \rightarrow \mathbf {Sen}_{\mathbf {I}}(\Sigma ')$ of sentences induced any signature morphism $\sigma \colon \Sigma \rightarrow \Sigma '$ preserve the satisfaction relation, that is, for any $\varphi \in \mathbf {Sen}_{\mathbf {I}}(\Sigma )$ and $M' \in \mathbf {Mod}_{\mathbf {I}}(\Sigma ')$ the following satisfaction condition holds:

$$\begin{align*}M' \models_{\mathbf{I},\Sigma'} \mathbf{Sen}_{\mathbf{I}}(\sigma)(\varphi) \quad\textrm{iff}\quad \mathbf{Mod}_{\mathbf{I}}(\sigma)(M^{\prime}) \models_{\mathbf{I},\Sigma} \varphi. \end{align*}$$

The subscripts I and $\Sigma $ are typically omitted. For any signature morphism ${\sigma \colon \Sigma \rightarrow \Sigma '}$ , the translation $\mathbf {Sen}(\sigma ) \colon \mathbf {Sen}(\Sigma ) \rightarrow \mathbf {Sen}(\Sigma ')$ is often denoted by ${\sigma \colon \mathbf {Sen}(\Sigma ) \rightarrow \mathbf {Sen}(\Sigma ')}$ , and the reduct $\mathbf {Mod}(\sigma ) \colon \mathbf {Mod}(\Sigma ^{\prime }) \rightarrow \mathbf {Mod}(\Sigma )$ by . For instance, combining this with the notation for image and coimage, for $\Phi \subseteq \mathbf {Sen}(\Sigma )$ , $\sigma (\Phi ) = \{\sigma (\varphi ) \mid \varphi \in \Phi \}\subseteq \mathbf {Sen}(\Sigma ')$ , and for $\mathcal {M}\subseteq \mathbf {Mod}(\Sigma )$ , , and the satisfaction condition may be re-stated as: $M'\models \sigma (\varphi )$ iff .

For any signature $\Sigma $ , the satisfaction relation extends naturally to sets of $\Sigma $ -sentences and classes of $\Sigma $ -models. For any set $\Phi \subseteq \mathbf {Sen}(\Sigma )$ , the class of models of $\Phi $ is ${Mod}(\Phi ) = \{M\in \mathbf {Mod}(\Sigma ) \mid M\models \Phi \}$ (such classes of models are called definable), and for any class $\mathcal {M}\subseteq \mathbf {Mod}(\Sigma )$ , the theory of $\mathcal {M}$ is ${{Th}(\mathcal {M}) = \{\varphi \in \mathbf {Sen}(\Sigma ) \mid \mathcal {M}\models \varphi \}}$ . The latter notation is also used for the theory generated by a set of sentences: for $\Phi \subseteq \mathbf {Sen}(\Sigma )$ , ${Th}(\Phi ) = {Th}({Mod}(\Phi ))$ .

As usual, each satisfaction relation determines (semantic) entailment between sets of sentences: $\Phi \subseteq \mathbf {Sen}(\Sigma )$ entails $\Psi \subseteq \mathbf {Sen}(\Sigma )$ (or $\Psi $ is a consequence of $\Phi $ ), written $\Phi \models \Psi $ , when $\Psi \subseteq {Th}(\Phi )$ . The satisfaction condition implies that the semantic entailment is preserved under translation along signature morphisms: for any $\sigma \colon \Sigma \to \Sigma '$ , if $\Phi \models \Psi $ then $\sigma (\Phi )\models \sigma (\Psi )$ . If the opposite implication holds as well, i.e., $\Phi \models \Psi $ iff $\sigma (\Phi )\models \sigma (\Psi )$ for all $\Phi ,\Psi \subseteq \mathbf {Sen}(\Sigma )$ , we say that $\sigma \colon \Sigma \to \Sigma '$ is conservative. In particular, if the reduct is surjective then $\sigma \colon \Sigma \to \Sigma '$ is conservative.Footnote 2

We typically decorate the names for institution components and for other derived notions by primes, indices, etc., to identify the institution they refer to, and rely on this convention whenever the institution is clear from the context. So, for instance, $\mathbf {Mod}_1$ is the model functor in an institution $\mathbf {I}_1$ , ${\models '}$ is the satisfaction relation (and entailment) in $\mathbf {I}'$ , etc.

Examples of institutions abound, see, for instance, [Reference Diaconescu15, Reference Sannella and Tarlecki40] for detailed definitions of many standard and not so standard logical systems formalised as institutions. Here, let us just sketch three standard examples.

Example 2.1. The institution $\mathbf {FO}$ of (many-sorted) first-order logic has signatures that consist of a set of sort names, a set of operation names with an arity (given as a finite sequence of sort names) and a result sort indicated for each operation name, and a set of predicate names with an arity indicated for each predicate name. We consider finite signatures only, with all symbols taken from a predefined (infinite) vocabulary, which makes the category of signatures small. Terms are built from variables by “formal application” of operation names respecting their arities and result sorts (constants are nullary operations). Then atomic formulae are predicate “applications” to tuples of terms of the sorts indicated by the predicate arities, and first-order formulae are built from those using the usual Boolean connectives (including nullary $\mathsf {false}$ ) and quantification. First-order sentences are closed formulae (i.e., formulae with no free occurrences of variables). We assume that in each sentence variables of different sorts are distinct. First-order models consist of many-sorted carrier sets (one set for each sort name), functions to interpret operation names and relations to interpret predicate names, in accordance with the indicated arities and result sorts. Satisfaction of first-order sentences in first-order models so built is defined as usual. Finally, signature morphisms map sort names to sort names, operation names to operation names and predicate names to predicate names preserving their arities and result sorts. For any such morphism, translation of sentences is defined by renaming sorts (for variables), operation and predicate names as indicated by the morphism, and reducts of models are defined by interpreting each symbol of the source signature as the symbol the signature morphism maps it to is interpreted in the argument model. The satisfaction condition holds, and this indeed defines an institution [Reference Goguen and Burstall26]. We will assume that all carrier sets in first-order models are nonempty. The variant of first-order logic where empty carrier sets are allowed in models will be denoted by $\mathbf {FO}_\emptyset $ .Footnote 3 Another variant is the institution $\mathbf {FO}_{\mathbf {EQ}}$ of first-order logic with equality, where we have a binary equality predicate for each sort, interpreted as the identity relation in all models.

Example 2.2. The institution $\mathbf {EQ}$ of (many-sorted) equational logic may be defined as the restriction of the institution $\mathbf {FO}_{\mathbf {EQ}}$ of first-order logic with equality to the signatures with no predicates other than equalities (models are usually called algebras then), and sentences are limited to universally quantified equalities. Again, $\mathbf {EQ}_\emptyset $ is the variant of $\mathbf {EQ}$ where empty carriers are permitted (see [Reference Diaconescu15, Reference Sannella and Tarlecki40] for a more explicit definition).

Example 2.3. The institution $\mathbf {PL}$ of propositional logic may be viewed as a restriction of the institution of first-order logic to signatures with no sort names (and hence no operation names and nullary predicates only). More explicitly, $\mathbf {PL}$ has finite sets of propositional variables as signatures, with signature morphisms being arbitrary functions between those sets. Propositional sentences are built from propositional variables using the usual Boolean connectives (with obvious translations under functions renaming propositional variables). Models over a signature are given as subsets of this signature (consisting of the propositional variables that are satisfied in the model) with reducts w.r.t. signature morphisms given as their coimage. With the usual satisfaction of propositional sentences in such models, the satisfaction condition is easy to check.

In the above sample institutions $\mathbf {FO}$ , $\mathbf {EQ}$ , and $\mathbf {PL}$ all injective signature morphisms induce surjective reducts, and so are conservative. This need not be the case for non-injective morphisms. However, in $\mathbf {FO}_\emptyset $ in $\mathbf {EQ}_\emptyset $ , the variants of $\mathbf {FO}$ and of $\mathbf {EQ}$ where empty carriers of some sorts are permitted in models, not all injective signature morphisms are conservative.

In the examples above, and in many other standard cases, all the signatures, sentences, and models are quite familiar, and link with many intuitions and implicit assumptions. We should stress though that when exploiting the generality of the concept and working with an arbitrary institution, such connotations should be dropped. All the entities involved (signatures, their morphisms, sentences, models, satisfaction relations) are considered entirely abstract, with completely unknown structure and properties. It is perhaps surprising how far one can go with developments of the foundations for software specification [Reference Sannella and Tarlecki40] and an abstract version of model theory [Reference Diaconescu15] in such an abstract setting.

2.3. Extending institutions by models and sentences

We introduce two basic ways of extending institutions, by adding new “abstract” models, and new “abstract” sentences, respectively. The definitions are shaped after the definition of constraints in [Reference Goguen and Burstall26, Reference Sannella and Tarlecki40]. The basic observation is that when a new sentence is to be added to the set of sentences over a signature, with some predefined notion of satisfaction in the institution models, it must also be “fitted” to other signatures to mimic its translation along signature morphisms with this signature as a source. Hence, together with each new sentence, we also add its “formal translations” along signature morphisms. Then, the satisfaction of the formal translations so added is determined by the satisfaction condition. Similarly, when we want to add new models to the class of models over a signature—apart from the new models themselves, we must also add their “formal reducts”.

Consider an arbitrary institution $\mathbf {I}=\langle {\mathbf {Sig}, \mathbf {Sen}, \mathbf {Mod}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |\mathbf {Sig}|}}\rangle $ .

Suppose that for each signature we are given a set of (new) “sentences” with predefined satisfaction relation in $\mathbf {I}$ -models, which may be organised as a signature-indexed family of sets with relations between the model classes and these sets: $\mathcal {N\!S}=\langle {\mathcal {N\!S}_\Sigma ,{\models ^{\mathcal {N\!S}}_\Sigma }\subseteq {\mathbf {Mod}(\Sigma )\times \mathcal {N\!S}_\Sigma }}\rangle _{\Sigma \in |\mathbf {Sig}|}$ .Footnote 4

We define the extension of $\mathbf {I}$ by sentences $\mathcal {N\!S}$ to be the institution $\mathbf {I}^{+}=\langle {\mathbf {Sig}, \mathbf {Sen}^{+}, \mathbf {Mod}, \langle {{\models ^{+}_\Sigma }}\rangle _{\Sigma \in |\mathbf {Sig}|}}\rangle $ , where for $\Sigma \in |\mathbf {Sig}|$ , $\mathbf {Sen}^{+}(\Sigma ) = \mathbf {Sen}(\Sigma ) \cup \{\lceil \tau (\varphi ')\rceil \mid \varphi '\in \mathcal {N\!S}_{\Sigma '},\tau \colon \Sigma '\to \Sigma \}$ .Footnote 5 Then for $M\in \mathbf {Mod}(\Sigma )$ , $M\models ^{+}_{\Sigma }\varphi $ iff $M\models _{\Sigma }\varphi $ for $\varphi \in \mathbf {Sen}(\Sigma )$ , and for $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ , $\tau \colon \Sigma '\to \Sigma $ , we define $M\models ^{+}_{\Sigma }\lceil \tau (\varphi ')\rceil $ to hold iff . Finally, for any signature morphism $\sigma \colon \Sigma \to \Sigma "$ , $\mathbf {Sen}^{+}(\sigma )(\varphi )=\mathbf {Sen}(\sigma )(\varphi )$ for $\varphi \in \mathbf {Sen}(\Sigma )$ , and for $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ , $\tau \colon \Sigma '\to \Sigma $ , we define $\mathbf {Sen}^{+}(\sigma )(\lceil \tau (\varphi ')\rceil )=\lceil (\tau \mathord {;}\sigma )(\varphi ')\rceil $ .

This defines an institution, where for $\Sigma \in |\mathbf {Sig}|$ , the new sentences $\varphi \in \mathcal {N\!S}_\Sigma $ are present as $\lceil {id}_\Sigma (\varphi )\rceil $ . Clearly, such an extension does not affect semantic entailments between sets of sentences of the original institution.

Institution extensions by new sentences compose in the following sense: if $\mathbf {I}^{{+}\!\!{+}}$ is an extension by new sentences of an extension $\mathbf {I}^{+}$ of $\mathbf {I}$ by new sentences then $\mathbf {I}^{{+}\!\!{+}}$ is an extension of $\mathbf {I}$ by sentences (the union of the sets of new sentences added in each step should be used for each signature). Note also that $\mathbf {I}$ is its own extension by (the empty set of) new sentences.

Suppose then that for each signature we are given a class of (new) “models” with predefined satisfaction relation for $\mathbf {I}$ -sentences, organised as a signature-indexed family of classes with relations between these classes and the sets of sentences: $\mathcal {N\!M}=\langle {\mathcal {N\!M}_\Sigma ,{\models ^{\mathcal {N\!M}}_\Sigma }\subseteq {\mathcal {N\!M}_\Sigma \times \mathbf {Sen}(\Sigma )}}\rangle _{\Sigma \in |\mathbf {Sig}|}$ .

Then we define the extension of $\mathbf {I}$ by models $\mathcal {N\!M}$ to be the institution $\mathbf {I}^{+}=\langle {\mathbf {Sig}, \mathbf {Sen}, \mathbf {Mod}^{+}, \langle {{\models ^{+}_\Sigma }}\rangle _{\Sigma \in |\mathbf {Sig}|}}\rangle $ , where for $\Sigma \in |\mathbf {Sig}|$ , .Footnote 6 Then for $\varphi \in \mathbf {Sen}(\Sigma )$ , $M\models ^{+}_{\Sigma }\varphi $ iff $M\models _{\Sigma }\varphi $ for $M\in \mathbf {Mod}(\Sigma )$ , and for $M'\in \mathcal {N\!M}_{\Sigma '}$ , $\tau \colon \Sigma \to \Sigma '$ , we define to hold iff $M'\models ^{\mathcal {N\!M}}_{\Sigma '}\tau (\varphi )$ . Finally, for any signature morphism $\sigma \colon \Sigma "\to \Sigma $ , for $M\in \mathbf {Mod}(\Sigma )$ , and for $M'\in \mathcal {N\!S}_{\Sigma '}$ , $\tau \colon \Sigma \to \Sigma '$ , we define .

This defines an institution, where for $\Sigma \in |\mathbf {Sig}|$ , the new models $M\in \mathcal {N\!M}_\Sigma $ are present as . Clearly, such an extension mail spoil some of the semantic entailments between sets of sentences of the original institution: for $\Sigma \in |\mathbf {Sig}|$ , $\Phi ,\Psi \subseteq \mathbf {Sen}(\Sigma )$ if $\Phi \models ^{+}\Psi $ then $\Phi \models \Psi $ but the opposite may fail in general (this is in contrast with institution extensions by sentences).

Institutions extensions by new models compose in the following sense: if $\mathbf {I}^{{+}\!\!{+}}$ is an extension by new models of an extension $\mathbf {I}^{+}$ of $\mathbf {I}$ by new models then $\mathbf {I}^{{+}\!\!{+}}$ is an extension of $\mathbf {I}$ by models (the union of the classes of new models added in each step should be used for each signature). Note also that $\mathbf {I}$ is its own extension by (the empty class of) new models.

In the rest of this paper we will use the above constructions presenting new sentences $\mathcal {N\!S}$ and new models $\mathcal {N\!M}$ somewhat informally, avoiding much of the notational burden. In particular, we will disregard the formal distinction between $\varphi \in \mathcal {N\!S}_\Sigma $ and $\lceil {id}_\Sigma (\varphi )\rceil $ , as well as between $M\in \mathcal {N\!M}_\Sigma $ and . For $\Sigma \in |\mathbf {Sig}|$ , we may also define the satisfaction relations ${\models ^{\mathcal {N\!S}}_\Sigma }$ indirectly by defining ${Mod}^{+}(\varphi )\subseteq \mathbf {Mod}(\Sigma )$ for each $\varphi \in \mathcal {N\!S}_\Sigma $ (then for $M\in \mathbf {Mod}(\Sigma )$ , $M\models ^{\mathcal {N\!S}}_\Sigma \varphi $ iff $M\in {Mod}^{+}(\Sigma )$ ), and ${\models ^{\mathcal {N\!M}}_\Sigma }$ by defining ${Th}^{+}(M)\subseteq \mathbf {Sen}(\Sigma )$ for each $M\in \mathcal {N\!M}_\Sigma $ (then for $\varphi \in \mathbf {Sen}(\Sigma )$ , $M\models ^{\mathcal {N\!M}}_\Sigma \varphi $ iff $\varphi \in {Th}^{+}(M)$ ).

Example 2.4. We may define an extension of the institution $\mathbf {PL}$ of propositional logic (see Example 2.3) by sentences, adding for each signature $\Sigma $ a new sentence $\texttt {even}_\Sigma $ , with the satisfaction relation extended so that $M\models ^{+}\texttt {even}_\Sigma $ if M contains an even number of propositional variables (an even number of propositional variables holds in M). In the resulting extension $\mathbf {PL}^{+}$ defined as above, for a signature morphism (which is a function between the sets of propositional variables) $\sigma \colon \Sigma \to \Sigma '$ , $\mathbf {Sen}^{+}(\sigma )(\texttt {even}_\sigma )$ is $\lceil \sigma (\texttt {even}_\Sigma )\rceil $ , which is distinct from $\texttt {even}_{\Sigma '}$ . Indeed, putting $\mathbf {Sen}^{+}(\sigma )(\texttt {even}_\Sigma )=\texttt {even}_{\Sigma '}$ would violate the satisfaction condition for some  $\sigma $ .

Example 2.5. We may also define an extension of the institution $\mathbf {PL}$ of propositional logic by models, adding for each signature $\Sigma $ and $\Sigma $ -model M, a new model $\widetilde {M}$ , where the satisfaction of propositional sentences in $\widetilde {M}$ is defined by interpreting propositional connectives as usual, but the truth of all occurrences of propositional variables is determined separately for each occurrence, from left to right, and after each occurrence the values of all propositional variables are “swapped” (from true to false and vice versa). Thus, for instance the sentence $p\wedge q$ holds in $\widetilde {M}$ if $p\in M$ and $q\not \in M$ , and $p\vee p$ holds in any model $\widetilde {M}$ . In the resulting extension $\mathbf {PL}^{+}$ , for any signature $\Sigma $ and $M\in \mathbf {Mod}(\Sigma )$ , for any signature morphism $\sigma \colon \Sigma '\to \Sigma $ , (that is, $\mathbf {Mod}^{+}(\sigma )(\widetilde {M})$ ) and are distinct $\Sigma '$ -models, even though one may easily check that they satisfy exactly the same propositional sentences.

2.4. Institution morphisms

There are a number of standard notions to capture relationships between different institutions, with institution morphisms [Reference Goguen and Burstall26] and comorphisms [Reference Goguen and Roşu27] (plain maps [Reference Meseguer and Ebbinghaus29] or representations [Reference Tarlecki, Haveraaen, Owe and Dahl43]) perhaps the most common.

Let ${\mathbf {I}} = \langle {\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}\rangle $ and ${\mathbf {I}}' = \langle {\mathbf {Sig}}', {\mathbf {Sen}}', {\mathbf {Mod}}', \langle {{\models _{\Sigma '}^{\prime }}}\rangle _{\Sigma '\in |{\mathbf {Sig}}'|}\rangle $ be institutions. An institution morphism $\mu \colon {\mathbf {I}} \rightarrow {\mathbf {I}}'$ consists of:

  • a functor $\mu ^{{Sig}} \colon {\mathbf {Sig}} \rightarrow {\mathbf {Sig}}'$ ,

  • a natural transformation $\mu ^{{Sen}} \colon \mu ^{{Sig}}\mathord {;}{\mathbf {Sen}}' \rightarrow {\mathbf {Sen}}$ , i.e., a family of functions $\mu ^{{Sen}}_\Sigma \colon {\mathbf {Sen}}'(\mu ^{{Sig}}(\Sigma )) \rightarrow {\mathbf {Sen}}(\Sigma )$ natural in $\Sigma \in |{\mathbf {Sig}}|$ , and

  • a natural transformation $\mu ^{{Mod}} \colon {\mathbf {Mod}} \rightarrow (\mu ^{{Sig}})^{\mathit{op}}\mathord {;}{\mathbf {Mod}}'$ , i.e., a family of functions $\mu ^{{Mod}}_\Sigma \colon {\mathbf {Mod}}(\Sigma ) \rightarrow {\mathbf {Mod}}'(\mu ^{{Sig}}(\Sigma ))$ natural in $\Sigma \in |{\mathbf {Sig}}|$

such that for any signature $\Sigma \in |{\mathbf {Sig}}|$ , $\varphi '\in {\mathbf {Sen}}'(\mu ^{{Sig}}(\Sigma )),$ and $M\in {\mathbf {Mod}}(\Sigma )$ , $M\models _\Sigma \mu ^{{Sen}}_\Sigma (\varphi ')$ iff $\mu ^{{Mod}}_\Sigma (M)\models ^{\prime }_{\mu ^{{Sig}}(\Sigma )}\varphi '$ (this is referred to as the satisfaction condition for  $\mu $ ).

To simplify the notation, all three components of an institution morphism $\mu $ are typically denoted by $\mu $ as well, omitting the superscripts whenever they are clear from the context.

It follows that semantic entailment is preserved by translation under institution morphisms: for any signature $\Sigma \in |{\mathbf {Sig}}|$ and sets of sentences $\Phi ',\Psi '\subseteq {\mathbf {Sen}}'(\mu (\Sigma ))$ , if $\Phi '\models '\Psi '$ then $\mu _\Sigma (\Phi ')\models \mu _\Sigma (\Psi ')$ . Moreover, if the translation of models $\mu _\Sigma \colon {\mathbf {Mod}}(\Sigma )\to {\mathbf {Mod}}'(\mu (\Sigma ))$ is surjective then the opposite implication holds as well, that is, $\Phi '\models '\Psi '$ iff $\mu _\Sigma (\Phi ')\models \mu _\Sigma (\Psi ')$ .

For instance, there is an obvious institution morphisms from the institution ${\mathbf {FO}}$ of first-order logic to the institution ${\mathbf {PL}}$ of propositional logic (removing from signatures everything but nullary predicates). For further examples of institution morphisms spelled out in detail we refer to [Reference Diaconescu15, Reference Sannella and Tarlecki40].

Throughout this paper we deal with a special case of institution morphisms that leave the signature category intact, that is, where the signature functor is the identity. This also allows us to disregard institution comorphisms, since in this case the two notions are essentially the same (institution morphisms from ${\mathbf {I}}$ to ${\mathbf {I}}'$ with the identity signature functor coincide with comorphisms from ${\mathbf {I}}'$ to ${\mathbf {I}}$ with the identity signature functor).

An institution morphism $\mu \colon {\mathbf {I}} \rightarrow {\mathbf {I}}'$ is logically trivial if it is the identity on signatures and surjective on sentences and models, that is, ${\mathbf {Sig}}'={\mathbf {Sig}}$ and ${\mu ^{{Sig}}={id}_{\mathbf {Sig}}}$ , and for all signatures $\Sigma \in |{\mathbf {Sig}}|$ , the functions $\mu _\Sigma \colon {\mathbf {Sen}}'(\Sigma ) \to {\mathbf {Sen}}(\Sigma )$ and $\mu _\Sigma \colon {\mathbf {Mod}}(\Sigma ) \to {\mathbf {Mod}}'(\Sigma )$ are surjective.

Proposition 2.6. Logically trivial institution morphisms identify only sentences and models that are logically equivalent, that is, if an institution morphism $\mu \colon {\mathbf {I}} \rightarrow {\mathbf {I}}'$ is logically trivial then for any signature $\Sigma \in |{\mathbf {Sig}}|:$

  1. 1. for any ${\mathbf {I}}'$ -sentences $\varphi ', \psi '\in {\mathbf {Sen}}'(\Sigma )$ , if $\mu _\Sigma (\varphi ')=\mu _\Sigma (\psi ')$ then for all ${\mathbf {I}}'$ -models $M'\in {\mathbf {Mod}}'(\Sigma )$ , $M'\models '\varphi '$ iff $M'\models '\psi ';$

  2. 2. for any ${\mathbf {I}}$ -models $M,N\in {\mathbf {Mod}}(\Sigma )$ , if $\mu _\Sigma (M)=\mu _\Sigma (N)$ then for all ${\mathbf {I}}$ -sentences $\varphi \in {\mathbf {Sen}}(\Sigma )$ , $M\models \varphi $ iff $N\models \varphi $ .

Proof Follows by the satisfaction condition for $\mu \colon {\mathbf {I}}\to {\mathbf {I}}'$ and surjectivity of $\mu _\Sigma \colon {\mathbf {Mod}}(\Sigma ) \to {\mathbf {Mod}}'(\Sigma )$ and $\mu _\Sigma \colon {\mathbf {Sen}}'(\Sigma ) \to {\mathbf {Sen}}(\Sigma )$ :

  1. 1. Suppose $\varphi =\mu _\Sigma (\varphi ')=\mu _\Sigma (\psi ')$ . Since $\mu _\Sigma \colon {\mathbf {Mod}}(\Sigma ) \to {\mathbf {Mod}}'(\Sigma )$ is surjective, for any $M'\in {\mathbf {Mod}}'(\Sigma )$ there is $M\in {\mathbf {Mod}}(\Sigma )$ such that $\mu _\Sigma (M)=M'$ . Hence, by the satisfaction condition for $\mu \colon {\mathbf {I}}\to {\mathbf {I}}'$ , $M'\models '\varphi '$ iff $M\models \varphi $ iff $M'\models '\psi '$ .

  2. 2. Similarly, suppose $\mu _\Sigma (M)=\mu _\Sigma (N) =M'$ . Since $\mu _\Sigma \colon {\mathbf {Sen}}'(\Sigma )\to {\mathbf {Sen}}(\Sigma )$ is surjective, for any $\varphi \in {\mathbf {Sen}}(\Sigma )$ there is $\varphi '\in {\mathbf {Sen}}'(\Sigma )$ such that $\mu _\Sigma (\varphi ')=\varphi $ . Hence, by the satisfaction condition for $\mu \colon {\mathbf {I}}\to {\mathbf {I}}'$ , $M\models \varphi $ iff $M'\models '\varphi '$ iff $N\models \varphi $ .

Special institution morphisms relate institutions with their extensions by new sentences and by new models, respectively, introduced in Section 2.3.

Let ${\mathbf {I}}^{+}_{\mathcal {N\!S}}$ be the extension of institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ by sentences $\mathcal {N\!S}=\langle {\mathcal {N\!S}_\Sigma ,{\models ^{\mathcal {N\!S}}_\Sigma }\subseteq {\mathbf {Mod}}(\Sigma )\times \mathcal {N\!S}_\Sigma }\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , as defined in Section 2.3. Then there is an obvious institution morphism $\mu _{\mathcal {N\!S}}\colon {\mathbf {I}}^{+}_{\mathcal {N\!S}}\to {\mathbf {I}}$ , where $\mu ^{{Sig}}_{\mathcal {N\!S}}$ and $\mu ^{{Mod}}_{\mathcal {N\!S}}$ are identities (the former is the identity functor on ${\mathbf {Sig}}$ , the latter is the identity natural transformation on ${\mathbf {Mod}}\colon {\mathbf {Sig}}^{\mathit{op}}\to \mathbf {Class}$ ), and for $\Sigma \in |{\mathbf {Sig}}|$ , $(\mu ^{{Sen}}_{\mathcal {N\!S}})_\Sigma \colon {\mathbf {Sen}}(\Sigma )\to {\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma )$ are inclusions. Somewhat ambiguously, we refer to this institution morphism as the extension of ${\mathbf {I}}$ by $\mathcal {N\!S}$ as well.

Similarly, let ${\mathbf {I}}^{+}_{\mathcal {N\!M}}$ be the extension of ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {{\mathbf {Mod}}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ by models $\mathcal {N\!M}=\langle {\mathcal {N\!M}_\Sigma ,{\models ^{\mathcal {N\!M}}_\Sigma }\subseteq {\mathcal {N\!M}_\Sigma \times {\mathbf {Sen}}(\Sigma )}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , as defined in Section 2.3. There is an obvious institution morphism $\mu _{\mathcal {N\!M}}\colon {\mathbf {I}}\to {\mathbf {I}}^{+}_{\mathcal {N\!M}}$ , where $\mu ^{{Sig}}_{\mathcal {N\!M}}$ and $\mu ^{{Sen}}_{\mathcal {N\!M}}$ are identities, and for $\Sigma \in |{\mathbf {Sig}}|$ , $(\mu ^{{Mod}}_{\mathcal {N\!M}})_\Sigma \colon {\mathbf {Mod}}(\Sigma )\to {\mathbf {Mod}}^{+}_{\mathcal {N\!M}}(\Sigma )$ are inclusions. We also refer to this institution morphism as the extension of ${\mathbf {I}}$ by $\mathcal {N\!M}$ .

Institution morphisms compose in the obvious, component-wise manner [Reference Goguen and Burstall26].

Proposition 2.7. Consider institutions ${\mathbf {I}}'=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}', {\mathbf {Mod}}', \langle {{\models _{\Sigma }'}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ and ${\mathbf {I}}"=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}", {\mathbf {Mod}}", \langle {{\models _{\Sigma }"}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ with a common signature category, and an institution morphism $\mu \colon {\mathbf {I}}'\to {\mathbf {I}}"$ with $\mu ^{{Sig}}={id}_{{\mathbf {Sig}}}$ . Then for some institution ${\mathbf {I}}$ , extension ${\mathbf {I}}^{+}_{\mathcal {N\!S}}$ of ${\mathbf {I}}$ by new sentences, extension ${\mathbf {I}}^{+}_{\mathcal {N\!M}}$ of ${\mathbf {I}}$ by new models, and logically trivial institution morphisms $\mu '\colon {\mathbf {I}}'\to {\mathbf {I}}^{+}_{\mathcal {N\!S}}$ and $\mu "\colon {\mathbf {I}}^{+}_{\mathcal {N\!M}}\to {\mathbf {I}}"$ we have $\mu =\mu '\mathord {;}\mu _{\mathcal {N\!S}}\mathord {;}\mu _{\mathcal {N\!M}}\mathord {;}\mu"$ :

$$\begin{align*}\underbrace{{\mathbf{I}}' \stackrel{\mu'}{\longrightarrow} {\mathbf{I}}^{+}_{\mathcal{N\!S}} \xrightarrow{\mu_{\mathcal{N\!S}}} {\mathbf{I}} \xrightarrow{\mu_{\mathcal{N\!M}}} {\mathbf{I}}^{+}_{\mathcal{N\!M}} \stackrel{\mu"}{\longrightarrow} {\mathbf{I}}"}_{\mu} \end{align*}$$

Proof First, define ${\mathbf {I}}=\langle {{\mathbf {Sig}},{\mathbf {Sen}}",{\mathbf {Mod}}',\langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ , where for $\Sigma \in {\mathbf {Sig}}$ , $M'\in {\mathbf {Mod}}'(\Sigma )$ and $\varphi "\in {\mathbf {Sen}}"(\Sigma )$ , we define $M'\models _\Sigma \varphi "$ to hold iff $M'\models ^{\prime }_\Sigma \mu _\Sigma (\varphi ")$ , or equivalently (by the satisfaction condition for $\mu $ ) iff $\mu _\Sigma (M^{\prime })\models ^{\prime \prime }_\Sigma \varphi "$ . This indeed defines an institution, since the satisfaction condition for ${\mathbf {I}}$ follows from the satisfaction condition for ${\mathbf {I}}'$ and naturality of $\mu ^{{Sen}}$ (or the satisfaction condition for ${\mathbf {I}}"$ and naturality of $\mu ^{{Mod}}$ ).

Consider “new” sentences $\mathcal {N\!S}=\langle {\mathcal {N\!S}_\Sigma ,{\models ^{\mathcal {N\!S}}_\Sigma }\subseteq {{\mathbf {Mod}}'(\Sigma )\times \mathcal {N\!S}_\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , where for $\Sigma \in |{\mathbf {Sig}}|$ , $\mathcal {N\!S}_\Sigma = {{\mathbf {Sen}}'(\Sigma )\setminus \mu _\Sigma ({\mathbf {Sen}}"(\Sigma ))}$ and ${\models ^{\mathcal {N\!S}}_\Sigma }$ is the restriction of ${\models ^{\prime }_\Sigma }$ to $\mathcal {N\!S}_\Sigma $ . Let ${\mathbf {I}}^{+}_{\mathcal {N\!S}}$ be the extension of ${\mathbf {I}}$ by sentences $\mathcal {N\!S}$ , as defined in Section 2.3, with the institution morphism $\mu _{\mathcal {N\!S}}\colon {\mathbf {I}}^{+}_{\mathcal {N\!S}}\to {\mathbf {I}}$ defined above.Footnote 7 Then define the institution morphism $\mu '\colon {\mathbf {I}}'\to {\mathbf {I}}^{+}_{\mathcal {N\!S}}$ to be the identity on signatures and models, with $\mu ^{\prime }_\Sigma \colon {\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma )\to {\mathbf {Sen}}'(\Sigma )$ , for $\Sigma \in |{\mathbf {Sig}}|$ , defined as $\mu _\Sigma \colon {\mathbf {Sen}}"(\Sigma )\to {\mathbf {Sen}}'(\Sigma )$ on ${\mathbf {Sen}}"(\Sigma )\subseteq {\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma )$ , and for $\tau \colon \Sigma '\to \Sigma $ in ${\mathbf {Sig}}$ and $\varphi '\in \mathcal {N\!S}_{\Sigma '}\subseteq {\mathbf {Sen}}'(\Sigma ')$ , $\mu ^{\prime }_\Sigma (\lceil \tau (\varphi ')\rceil )={\mathbf {Sen}}'(\tau )(\varphi ')\in {\mathbf {Sen}}'(\Sigma )$ .

The translations of sentences so defined are indeed natural in $\Sigma $ : for any ${\sigma \colon \Sigma _1\to \Sigma _2}$ , we have to check that $\mu ^{\prime }_{\Sigma _1}\mathord {;}{\mathbf {Sen}}'(\sigma )={\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\sigma )\mathord {;}\mu ^{\prime }_{\Sigma _2}$ as functions from ${\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma _1)$ to ${\mathbf {Sen}}'(\Sigma _2)$ . For sentences in ${\mathbf {Sen}}"(\Sigma _1)$ this follows directly from the naturality of $\mu ^{{Sen}}$ . For sentences of the form $\lceil \tau (\varphi ')\rceil \in {\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma _1)$ , where $\tau \colon \Sigma '\to \Sigma _1$ and $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ , we have

$$ \begin{align*} {\mathbf{Sen}}'(\sigma)(\mu^{\prime}_{\Sigma_1}(\lceil\tau(\varphi')\rceil)) &= {\mathbf{Sen}}'(\sigma)({\mathbf{Sen}}'(\tau)(\varphi')) = {\mathbf{Sen}}'(\tau\mathord{;}\sigma)(\varphi') = \\[-1ex] &\kern4pt\quad \mu^{\prime}_{\Sigma_2}(\lceil(\tau\mathord{;}\sigma)(\varphi')\rceil) = \mu^{\prime}_{\Sigma_2}({\mathbf{Sen}}^{+}_{\mathcal{N\!S}}(\sigma)(\lceil\tau(\varphi')\rceil)). \end{align*} $$

To check the satisfaction condition for $\mu '$ , consider $\Sigma \in |{\mathbf {Sig}}|$ , $M'\in {\mathbf {Mod}}'(\Sigma )$ and $\varphi \in {\mathbf {Sen}}^{+}_{\mathcal {N\!S}}(\Sigma )$ . We have to show that $M'\models ^{\prime }_\Sigma \mu ^{\prime }_\Sigma (\varphi )$ iff $M'\models ^{+}_{\mathcal {N\!S},\Sigma }\varphi $ . For ${\varphi \in {\mathbf {Sen}}"(\Sigma )}$ , this follows from the satisfaction condition for $\mu $ and our definitions: $M'\models ^{\prime }_\Sigma \mu ^{\prime }_\Sigma (\varphi )$ is then the same as $M'\models ^{\prime }_\Sigma \mu _\Sigma (\varphi )$ , which is equivalent to $\mu _\Sigma (M^{\prime })\models ^{\prime \prime }_{\Sigma }\varphi $ , which in turn defines $M'\models _{{\mathbf {I}},\Sigma }\varphi $ and $M'\models ^{+}_{\mathcal {N\!S},\Sigma }\varphi $ . For $\varphi $ of the form $\lceil \tau (\varphi ')\rceil $ , where $\tau \colon \Sigma '\to \Sigma $ and $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ , this follows as well, since $M'\models ^{\prime }_\Sigma \mu ^{\prime }_\Sigma (\lceil \tau (\varphi ')\rceil )$ coincides with $M'\models ^{\prime }_\Sigma {\mathbf {Sen}}'(\tau )(\varphi ')$ , which is the same as $M'\models ^{\mathcal {N\!S}}_\Sigma {\mathbf {Sen}}'(\tau )(\varphi ')$ , which in turn defines $M'\models ^{+}_{\mathcal {N\!S},\Sigma }\lceil \tau (\varphi ')\rceil $ .

Consider now “new” models $\mathcal {N\!M}=\langle {\mathcal {N\!M}_\Sigma ,{\models ^{\mathcal {N\!M}}_\Sigma }\subseteq {\mathcal {N\!M}_\Sigma \times {\mathbf {Sen}}"(\Sigma )}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , where for $\Sigma \in |{\mathbf {Sig}}|$ , $\mathcal {N\!M}_\Sigma = {\mathbf {Mod}}"(\Sigma )\setminus \mu _\Sigma ({\mathbf {Mod}}'(\Sigma ))$ and ${\models ^{\mathcal {N\!M}}_\Sigma }$ is the restriction of ${\models ^{\prime \prime }_\Sigma }$ to $\mathcal {N\!M}_\Sigma $ . Let ${\mathbf {I}}^{+}_{\mathcal {N\!M}}$ be the extension of ${\mathbf {I}}$ by models $\mathcal {N\!M}$ , as defined in Section 2.3, with institution morphism $\mu _{\mathcal {N\!M}}\colon {\mathbf {I}}\to {\mathbf {I}}^{+}_{\mathcal {N\!M}}$ defined above. Then let the institution morphism $\mu "\colon {\mathbf {I}}^{+}_{\mathcal {N\!M}}\to {\mathbf {I}}"$ be the identity on signatures and sentences, with $\mu ^{\prime \prime }_\Sigma \colon {\mathbf {Mod}}^{+}_{\mathcal {N\!M}}(\Sigma )\to {\mathbf {Mod}}"(\Sigma )$ , for $\Sigma \in |{\mathbf {Sig}}|$ , defined as $\mu _\Sigma \colon {\mathbf {Mod}}'(\Sigma )\to {\mathbf {Mod}}"(\Sigma )$ on ${\mathbf {Mod}}'(\Sigma )\subseteq {\mathbf {Mod}}^{+}_{\mathcal {N\!M}}(\Sigma )$ , and for $\tau \colon \Sigma \to \Sigma '$ in ${\mathbf {Sig}}$ and $M'\in \mathcal {N\!M}_{\Sigma '}\subseteq {\mathbf {Mod}}"(\Sigma )$ , . By similar arguments as for $\mu '\colon {\mathbf {I}}'\to {\mathbf {I}}^{+}_{\mathcal {N\!S}}$ , it follows that $\mu ^{\prime \prime }_\Sigma \colon {\mathbf {Mod}}^{+}_{\mathcal {N\!M}}(\Sigma )\to {\mathbf {Mod}}"(\Sigma )$ , $\Sigma \in |{\mathbf {Sig}}|$ , are natural in $\Sigma $ , and the satisfaction condition holds for $\mu "$ .

It is easy now to check directly that indeed $\mu =\mu '\mathord {;}\mu _{\mathcal {N\!S}}\mathord {;}\mu _{\mathcal {N\!M}}\mathord {;}\mu "$ .

3. Interpolation

3.1. Classical interpolation

The Craig interpolation theorem [Reference Craig13] states that if an implication between two first-order formulae $\varphi \mathbin {\Rightarrow }\psi $ holds then there is a formula $\theta $ that uses only the symbols common to $\varphi $ and $\psi $ such that both $\varphi \mathbin {\Rightarrow }\theta $ and $\theta \mathbin {\Rightarrow }\psi $ hold; $\theta $ is then called an interpolant for $\varphi $ and $\psi $ . This is one of the key properties of first-order logic, with numerous applications, including simpler proofs of similarly famous and important results like the Robinson consistency [Reference Robinson36] and Beth definability [Reference Beth4] theorems. The original proof in [Reference Craig13] relied on proof-theoretic arguments, even though many of the applications (as well as some later proofs) of the result have been model-theoretic in nature. The interpolation property has been investigated (and proved or disproved) for many standard extensions (and fragments) of first-order logic [Reference Väänänen48] as well as for other logical systems, for instance for various modal and intuitionistic logics [Reference Gabbay and Maksimova22].

The above statement of the interpolation property implicitly involves the following union/intersection square of signatures:

where $\Sigma _{{p}}$ and $\Sigma _{{c}}$ are (first-order) signatures for $\varphi $ and $\psi $ , respectively, and the arrows indicate signature inclusions.

As recalled in Section 1, interpolation proved indispensable for many foundational aspects of computer science and software engineering, in particular, in the foundations of software specification and development [Reference Sannella and Tarlecki40]. However, the classical formulation of Craig’s interpolation for many applications in this area requires some generalisations, which perhaps do not bring much new insight for this property in the framework of first-order logic, but may be important when other logical systems are considered.

To begin with, the use of implication should be replaced by entailment. Then, we should deal with entailments between sets of sentences, rather than between individual sentences (strictly speaking, this is needed for the premise $\varphi $ and especially for the interpolant $\theta $ —for notational symmetry, we do this for the conclusion $\psi $ as well). Both these generalisations are irrelevant for first-order logic, where implication captures semantic entailment, and a set of sentences in the premise of each single-conclusion entailment may always be replaced by a single sentence (since we have finite conjunctions and the logic is compactFootnote 8 ). However, for instance, working in equational logic we have no implication available, and an interpolant cannot be always expressed as a single equation—even though the interpolation property holds if a set of equations is permitted as an interpolant [Reference Rodenburg37].

Perhaps most importantly, for instance in applications where parameterised specifications and their “pushout-style” instantiations [Reference Ehrig, Kreowski, Thatcher, Wagner and Wright21] are involved, we have to go beyond union/intersection squares of signatures and beyond inclusions to relate the signatures. More general classes of signature squares are needed, with non-injective signature morphisms necessary to capture for instance morphisms from the formal to actual parameters, used to “fit” the latter into the mould given by the former. Typically in applications at least pushouts of signature morphism are involved, sometimes additionally restricted to indicated classes of morphisms permitted at the “bottom-left” and “bottom-right” of the squares, respectively [Reference Borzyszkowski6, Reference Diaconescu15, Reference Popescu, Şerbănuţă and Roşu34, Reference Veloso49, Reference Veloso and Maibaum50]. However, for the purposes of this paper we will consider interpolation properties for an arbitrary commuting square of signature morphisms.

The above remarks lead to a general definition of the interpolation property in an arbitrary institution.

3.2. Interpolation in an institution

Throughout the rest of this paper, we consider an institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ , and study interpolation properties over the following commutative square $(\ast )$ of signature morphisms:Footnote 9

Let $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ be such that $\sigma _{{\!pu}}(\Phi )\models _{\Sigma _{{u}}}\sigma _{{\!cu}}(\Psi )$ . An interpolant for $\Phi $ and $\Psi $ (over diagram $(\ast )$ ) is a set $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ of $\Sigma _{{i}}$ -sentences such that $\Phi \models _{\Sigma _{{p}}}\sigma _{{\!ip}}(\Theta )$ and $\sigma _{{\!ic}}(\Theta )\models _{\Sigma _{{c}}}\Psi $ .

To simplify some further statements, if $\sigma _{{\!pu}}(\Phi )\not \models _{\Sigma _{{u}}}\sigma _{{\!cu}}(\Psi )$ then we say that any set $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ is an interpolant for $\Phi $ and $\Psi $ (over diagram $(\ast )$ ).

A commutative square $(\ast )$ of signature morphisms admits interpolation if all sets $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ such that $\sigma _{{\!pu}}(\Phi )\models _{\Sigma _{{u}}}\sigma _{{\!cu}}(\Psi )$ have an interpolant.

Example 3.1. In the institution $\mathbf {FO}$ of first-order logic, as well as any of its variants mentioned in Example 2.1, if the square $(\ast )$ is a pushout and at least one of $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ , $\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}$ is injective on sorts then $(\ast )$ admits interpolation; otherwise interpolation may fail for $(\ast )$ (see [Reference Borzyszkowski7]). In the institution $\mathbf {EQ}$ of equational logic if the square $(\ast )$ is a pushout and $\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}$ is injective then $(\ast )$ admits interpolation; otherwise interpolation may fail for $(\ast )$ , and in $\mathbf {EQ}_\emptyset $ , where empty carriers are permitted, interpolation may fail even for intersection/union squares of signatures (see [Reference Tarlecki45]). In the institution $\mathbf {PL}$ of propositional logic, all pushouts admit interpolation.

It is well known that the interpolation property of a logical system is fragile. When the logic is strengthened or weakened, when new models or sentences are added, the interpolation property may easily be spoiled. Clearly, this may happen when entirely new signatures are added, with new models and sentences over them. Therefore, we will consider the category of signatures to be fixed, and consider only such extensions of institutions that preserve it.

Throughout the rest of the paper we study in some detail how the interpolation property may be spoiled by adding new models or sentences. This will be done from a “local” perspective, for particular commutative squares of signature morphisms, as well as for particular interpolants.

We say that an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ (over diagram $(\ast )$ ) is stable under extensions of the institution by models if for every extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new models, $\Theta $ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ ; otherwise we say that the interpolant $\Theta $ is fragile.

While adding new models may spoil existing interpolants, it cannot create new non-trivial ones: in all extensions ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new models, if $\sigma _{{\!pu}}(\Phi )\models ^{+}_{\Sigma _{{u}}}\sigma _{{\!cu}}(\Psi )$ then any interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ . Adding new sentences cannot spoil a particular interpolant, but may spoil interpolation property for a given diagram (there may be no interpolant for new sentences, or sets of sentences that contain them), and may create new interpolants (involving some new sentences).

To begin with, we identify some special cases where interpolation is ensured and is stable under any extension of the institution.

3.3. Interpolants may be stable

Lemma 3.2. Consider the diagram $(\ast )$ of signature morphisms.

  1. 1. If ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is conservative then $(\ast )$ admits interpolation.

  2. 2. If ${\mathbf {Sen}}(\sigma _{{\!ic}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{c}})$ is surjective and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is conservative then $(\ast )$ admits interpolation.

Proof Let $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ and $\Psi \in {\mathbf {Sen}}(\Sigma _{{c}})$ be such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ .

  1. 1. Suppose ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is conservative. Consider $\Theta =\sigma _{{\!ip}}^{-1}(\Phi )\subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ . First, since $\Phi =\sigma _{{\!ip}}(\Theta )$ , we have $\Phi \models \sigma _{{\!ip}}(\Theta )$ . Then, since $(\ast )$ commutes, $\sigma _{{\!pu}}(\Phi )=\sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))=\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))$ , and so $\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))\models \sigma _{{\!cu}}(\Psi )$ . Hence $\sigma _{{\!ic}}(\Theta )\models \Psi $ by conservativity of $\sigma _{{\!cu}}$ . Thus $\Theta $ is an interpolant for $\Phi $ and $\Psi $ .

  2. 2. Suppose ${\mathbf {Sen}}(\sigma _{{\!ic}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{c}})$ is surjective and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is conservative. Consider $\Theta =\sigma _{{\!ic}}^{-1}(\Psi )\subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ . Then $\Psi =\sigma _{{\!ic}}(\Theta )$ , and so $\sigma _{{\!ic}}(\Theta )\models \Psi $ . Moreover, $\sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))=\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))=\sigma _{{\!cu}}(\Psi )$ , and so $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))$ , which implies $\Phi \models \sigma _{{\!ip}}(\Theta )$ by conservativity of $\sigma _{{\!pu}}$ . Thus $\Theta $ is an interpolant for $\Phi $ and $\Psi $ .

A trivial special case here is when $\sigma _{{\!ip}}$ and $\sigma _{{\!cu}}$ , or $\sigma _{{\!ic}}$ and $\sigma _{{\!pu}}$ , are isomorphisms, which can be further refined as follows:

Corollary 3.3. Consider the diagram $(\ast )$ of signature morphisms. If $:$

  1. 1. $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is a retraction and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is a coretraction, or

  2. 2. $\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}$ is a retraction and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is a coretraction,

then $(\ast )$ admits interpolation.

Proof Follows by Lemma 3.2, since signature morphisms that are retractions induce surjective translations of sentences, and signature morphisms that are coretractions induce surjective reduct functions on model classes, and so are conservative.

This shows that if the signature morphisms in $(\ast )$ satisfy the premises of Corollary 3.3 then the diagram enjoys a stable interpolation property, which cannot be spoiled by any institution extension that leaves the category of signatures unchanged! No matter how we add new models or sentences, the interpolation property is ensured by the properties of the signature morphisms involved and the implied properties of the translations of sentences and reducts of models they induce in the institution and in any of its extensions.

The conditions stated in Corollary 3.3 are in fact quite strong and in many practical situations do not depart too far from the trivial case when $\Sigma _{{p}}$ is (up to isomorphism) included in $\Sigma _{{c}}$ or vice versa. Namely, when the diagram $(\ast )$ is a pushout then condition 1 implies that $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is an isomorphism, and condition 2 implies that $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is an isomorphism. Dually, when $(\ast )$ is a pullback then condition 1 implies that $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is an isomorphism, and condition 2 implies that ${\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}}$ is an isomorphism.

Somewhat similarly, interpolation is preserved and reflected by logically trivial institution morphisms:

Proposition 3.4. Let $\mu \colon {\mathbf {I}}\to {\mathbf {I}}'$ be a logically trivial institution morphism. Diagram $(\ast )$ in the category of signatures admits interpolation in ${\mathbf {I}}$ iff it admits interpolation in ${\mathbf {I}}'$ .

Proof Since for each signature $\Sigma \in |{\mathbf {Sig}}|$ , $\mu _\Sigma \colon {\mathbf {Mod}}(\Sigma )\to {\mathbf {Mod}}'(\Sigma )$ is surjective, for any sets of ${\mathbf {I}}'$ -sentences $\Phi ',\Psi '\subseteq {\mathbf {Sen}}'(\Sigma )$ , $\Phi '\models '\Psi '$ iff $\mu _\Sigma (\Phi ')\models \mu _\Sigma (\Psi ')$ (by the remark after the definition of institution morphism in Section 2.4). Moreover, since $\mu _\Sigma \colon {\mathbf {Sen}}'(\Sigma )\to {\mathbf {Sen}}(\Sigma )$ is surjective, for any sets of ${\mathbf {I}}$ -sentences $\Phi ,\Psi \subseteq {\mathbf {Sen}}(\Sigma )$ , $\Phi =\mu _\Sigma (\mu _\Sigma ^{-1}(\Phi ))$ and $\Psi =\mu _\Sigma (\mu _\Sigma ^{-1}(\Psi ))$ , so that $\Phi \models \Psi $ iff $\mu _\Sigma ^{-1}(\Phi )\models '\mu _\Sigma ^{-1}(\Psi )$ .

Thus, for $\Phi '\subseteq {\mathbf {Sen}}'(\Sigma _{{p}})$ and $\Psi '\subseteq {\mathbf {Sen}}'(\Sigma _{{c}})$ , if $\mu _{\Sigma _{{p}}}(\Phi ')$ and $\mu _{\Sigma _{{c}}}(\Psi ')$ have an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ in ${\mathbf {I}}$ then $\mu _{\Sigma _{{i}}}^{-1}(\Theta )$ is an interpolant for $\Phi '$ and $\Psi '$ in ${\mathbf {I}}'$ . Similarly, for $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ , if $\mu _{\Sigma _{{p}}}^{-1}(\Phi )$ and $\mu _{\Sigma _{{c}}}^{-1}(\Psi )$ have an interpolant $\Theta '\subseteq {\mathbf {Sen}}'(\Sigma _{{i}})$ in ${\mathbf {I}}'$ then $\mu _{\Sigma _{{i}}}(\Theta ')$ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ .

Propositions 2.7 and 3.4 imply that institution extensions by new models and by new sentences are of primary importance for our study of the fragility of interpolation.

4. Spoiling an interpolant by new models

Recall that we study interpolation over a commutative square of signature morphisms $(\ast )$ in an institution ${{\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle }$ . Throughout this section, let $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ and ${\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})}$ be such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ , and let $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ be an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ .

Lemma 4.1. Suppose that there exists a set of $\Sigma _{{p}}$ -sentences $\Phi ^\bullet \supseteq \Phi $ such that $\sigma _{{\!ip}}(\Theta )\not \subseteq \Phi ^\bullet $ and for all signature morphisms $\tau \colon \Sigma _{{u}}\to \Sigma _{{p}}$ , if $\tau (\sigma _{{\!pu}}(\Phi ))\subseteq \Phi ^\bullet $ then $\tau (\sigma _{{\!cu}}(\Psi ))\subseteq \Phi ^\bullet $ . Then the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models.

Proof Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M (and its reducts for $\tau \colon \Sigma \to \Sigma _{{p}}$ , see Section 2.3), with ${Th}^{+}(M)=\Phi ^\bullet $ .

Then for all models $K\in {\mathbf {Mod}}^{+}(\Sigma _{{u}})$ , if $K\models ^{+}\sigma _{{\!pu}}(\Phi )$ then $K\models ^{+}\sigma _{{\!cu}}(\Psi )$ : this clearly holds for $K\in {\mathbf {Mod}}(\Sigma _{{u}})$ . For new models of the form with $\tau \colon \Sigma _{{u}}\to \Sigma _{{p}}$ , if then $M\models ^{+}\tau (\sigma _{{\!pu}}(\Phi ))$ , that is $\tau (\sigma _{{\!pu}}(\Phi ))\subseteq \Phi ^\bullet $ , which by the assumptions implies $\tau (\sigma _{{\!cu}}(\Psi ))\subseteq \Phi ^\bullet $ . Hence $M\models ^{+}\tau (\sigma _{{\!cu}}(\Psi ))$ and so . This shows $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ .

However, $M\not \models ^{+}\sigma _{{\!ip}}(\Theta )$ (since $\sigma _{{\!ip}}(\Theta )\not \subseteq \Phi ^\bullet $ ) and so $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ , which proves that $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

The key property of the set $\Phi ^\bullet $ used in the above lemma is that it cannot be used to separate $\sigma _{{\!pu}}(\Phi )$ from $\sigma _{{\!cu}}(\Psi )$ via any morphism $\tau \colon \Sigma _{{u}}\to \Sigma _{{p}}$ . More formally, for any signatures $\Sigma , \Sigma '\in |{\mathbf {Sig}}|$ , we say that $\Upsilon \subseteq {\mathbf {Sen}}(\Sigma )$ never separates $\Phi '\subseteq {\mathbf {Sen}}(\Sigma ')$ from $\Psi '\subseteq {\mathbf {Sen}}(\Sigma ')$ when for all morphisms $\tau \colon \Sigma '\to \Sigma $ , if $\tau (\Phi ')\subseteq \Upsilon $ then $\tau (\Psi ')\subseteq \Upsilon $ .

Lemma 4.2. For any sets $\Phi \subseteq {\mathbf {Sen}}(\Sigma )$ of $\Sigma $ -sentences and $\Phi ',\Psi '\subseteq {\mathbf {Sen}}(\Sigma ')$ of $\Sigma '$ -sentences, there is the least set $[{\Phi '}\,{\stackrel [{\Sigma }]{{\Sigma '}}{\leadsto }}\,{\Psi '}](\Phi )\subseteq {\mathbf {Sen}}(\Sigma )$ of $\Sigma $ -sentences that includes $\Phi $ and never separates $\Phi '$ from $\Psi '$ .

Proof Consider the set $\mathcal {E}$ of all sets $\Upsilon \subseteq {\mathbf {Sen}}(\Sigma )$ such that $\Phi \subseteq \Upsilon $ and for all signature morphisms $\tau \colon \Sigma '\to \Sigma $ , if $\tau (\Phi ')\subseteq \Upsilon $ then $\tau (\Psi ')\subseteq \Upsilon $ . $\mathcal {E}$ is nonempty and is closed under intersection. Then $[{\Phi '}\,{\stackrel [{\Sigma }]{{\Sigma '}}{\leadsto }}\,{\Psi '}](\Phi )=\bigcap \mathcal {E}$ .

Corollary 4.3. If $\sigma _{{\!ip}}(\Theta )\not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ then the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models.

Proof Directly from Lemma 4.1, with $\Phi ^\bullet =[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ .

Lemma 4.4. Suppose that there exists a set of $\Sigma _{{c}}$ -sentences $\Psi ^\circ \supseteq \sigma _{{\!ic}}(\Theta )$ such that $\Psi \not \subseteq \Psi ^\circ $ and for all signature morphisms $\tau \colon \Sigma _{{u}}\to \Sigma _{{c}}$ , if $\tau (\sigma _{{\!cu}}(\Phi )) \subseteq \Psi ^\circ $ then $\tau (\sigma _{{\!pu}}(\Psi )) \subseteq \Psi ^\circ $ . Then the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models.

Proof Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{c}}$ -model N (and its reducts for $\tau \colon \Sigma \to \Sigma _{{c}}$ ), with ${Th}^{+}(N)=\Psi ^\circ $ .

Then for all models $K\in {\mathbf {Mod}}^{+}(\Sigma _{{u}})$ , if $K\models ^{+}\sigma _{{\!pu}}(\Phi )$ then $K\models ^{+}\sigma _{{\!cu}}(\Psi )$ : this clearly holds for $K\in {\mathbf {Mod}}(\Sigma _{{u}})$ . For new models of the form with $\tau \colon \Sigma _{{u}}\to \Sigma _{{c}}$ , if then $N\models ^{+}\tau (\sigma _{{\!pu}}(\Phi ))$ , that is, $\tau (\sigma _{{\!pu}}(\Phi ))\subseteq \Psi ^\circ $ . By the assumptions this implies $\tau (\sigma _{{\!pu}}(\Psi ))\subseteq \Psi ^\circ $ . Hence $N\models ^{+}\tau (\sigma _{{\!cu}}(\Psi ))$ , and so . This shows $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ .

However, $N\models \sigma _{{\!ic}}(\Theta )$ (since $\sigma _{{\!ic}}(\Theta )\subseteq \Psi ^\circ $ ), while $N\not \models \Psi $ (since $\Psi \not \subseteq \Psi ^\circ $ ). Hence $\sigma _{{\!ic}}(\Theta )\not \models ^{+}\Psi $ , which shows that $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

Corollary 4.5. If $\Psi \not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ then the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extension of ${\mathbf {I}}$ by models.

Proof By Lemma 4.4, with $\Psi ^\circ =[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ .

Corollaries 4.3 and 4.5 present sufficient conditions which ensure that a particular interpolant may be spoiled under an extension of the institution by new models. In fact, these conditions jointly are also necessary:

Theorem 4.6. The interpolant $\Theta $ for $\Phi $ and $\Psi $ is stable under extensions of ${\mathbf {I}}$ by models if and only if the following conditions hold $:$

  1. 1. $\sigma _{{\!ip}}(\Theta )\subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ , and

  2. 2. $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ .

Proof The “only if” part follows by Corollaries 4.3 and 4.5, by contraposition.

For the “if” part: assume that the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models, and let ${\mathbf {I}}^{+}$ be an extension of ${\mathbf {I}}$ by models such that $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ , that is, we have $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ , but $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ or $\sigma _{{\!ic}}(\Theta )\not \models ^{+}\Psi $ .

  1. 1. If $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ then for some model $M\in {\mathbf {Mod}}^{+}(\Sigma _{{p}})$ , $M\models ^{+} \Phi $ and $M\not \models ^{+}\sigma _{{\!ip}}(\Theta )$ . Then $\Phi \subseteq {Th}^{+}(M)$ and $\sigma _{{\!ip}}(\Theta )\not \subseteq {Th}^{+}(M)$ . Moreover, ${Th}^{+}(M)$ never separates $\sigma _{{\!pu}}(\Phi )$ from $\sigma _{{\!cu}}(\Psi )$ , since if for some $\tau \colon \Sigma _{{u}}\to \Sigma _{{p}}$ , $\tau (\sigma _{{\!pu}}(\Phi ))\subseteq {Th}^{+}(M)$ and $\tau (\sigma _{{\!cu}}(\Psi ))\not \subseteq {Th}^{+}(M)$ , then and , which contradicts $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ . It follows now that $[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )\subseteq {Th}^{+}(M)$ , and so $\sigma _{{\!ip}}(\Theta )\not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ .

  2. 2. If $\sigma _{{\!ic}}(\Theta )\not \models ^{+}\Psi $ then for some model $N\in {\mathbf {Mod}}^{+}(\Sigma _{{c}})$ , $N\models ^{+}\sigma _{{\!ic}}(\Theta )$ and $N\not \models ^{+}\Psi $ . Then $\sigma _{{\!ic}}(\Theta )\subseteq {Th}^{+}(N)$ and $\Psi \not \subseteq {Th}^{+}(N)$ . Moreover, ${Th}^{+}(N)$ never separates $\sigma _{{\!pu}}(\Phi )$ from $\sigma _{{\!cu}}(\Psi )$ , since if for some $\tau \colon \Sigma _{{u}}\to \Sigma _{{c}}$ , $\tau (\sigma _{{\!pu}}(\Phi ))\subseteq {Th}^{+}(N)$ and $\tau (\sigma _{{\!cu}}(\Psi ))\not \subseteq {Th}^{+}(N)$ , then and , contradicting $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ . It follows now that $[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))\subseteq {Th}^{+}(N)$ , so $\Psi \not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ .

The above theorem gives precise conditions that ensure stability of a particular interpolant under extensions of the institution by new models. Of course, this also yields a precise characterisation of specific interpolation properties that can be spoiled by adding new abstract models. It should be stressed that the conditions in use a purely “syntactic”—they do not refer to the semantic properties of the sets of sentences involved, so in particular, they depend on a specific syntactic form of the sentences, and the conclusions may vary when sentences considered are replaced by semantically equivalent sentences that are of a different syntactic form.

Example 4.7. Consider a trivial example in the institution $\mathbf {PL}$ of propositional logic. In the diagram $(\ast )$ , let $\Sigma _{{p}} = \{p,r\}$ , $\Sigma _{{c}}=\{p,q\}$ , $\Sigma _{{u}}=\Sigma _{{p}}\cup \Sigma _{{c}}=\{r,p,q\}$ , $\Sigma _{{i}}=\Sigma _{{p}}\cap \Sigma _{{c}}=\{p\}$ , and the four signature morphisms are inclusions.

Let $\varphi $ be $r\wedge p$ and $\psi $ be $p\vee q$ . Clearly, $\varphi \models \psi $ , and $\varphi $ and $\psi $ have a number of distinct interpolants in $\mathbf {PL}$ .Footnote 10

One interpolant for $\varphi $ and $\psi $ is p (since clearly ${r\wedge p}\models p$ and $p\models {p\vee q}$ ). Consider $\mathbf {PL}$ -model $M=\{r\}\in {\mathbf {Mod}}_{\mathbf {PL}}(\Sigma _{{p}})$ . Let $\mathbf {PL}^{+}$ be an extension of $\mathbf {PL}$ by a new $\Sigma _{{p}}$ -model $\widetilde {M}$ (with interpretation of propositional sentences “swapping” the valuation of propositional variables, as in Example 2.5). Then $\widetilde {M}\models ^{+}{r\wedge p}$ while $\widetilde {M}\not \models ^{+}{p}$ , and so p is not an interpolant for $\varphi $ and $\psi $ in $\mathbf {PL}^{+}$ . In fact, it is easy to check that $\Phi ^\bullet = \{ {\varphi \in {\mathbf {Sen}}_{\mathbf {PL}}(\Sigma _{{p}})} \mid {\widetilde {M}\models ^{+}\varphi } \}$ satisfies the premises of Lemma 4.1.

Moreover, one can easily calculate $[{r\wedge p}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{p\vee q}](r\wedge p)\subseteq {\mathbf {Sen}}_{\mathbf {PL}}(\Sigma _{{p}})$ : there are exactly two morphisms $\tau ,\tau '\colon \Sigma _{{u}}\to \Sigma _{{p}}$ such that $\tau (r\wedge p)=\tau '(r\wedge p)={r\wedge p}$ , namely they both map r to r and p to p, and then map q to any of the symbols in $\Sigma _{{p}}$ , say, $\tau (q)=p$ and $\tau '(q)=r$ . Consequently, $[{r\wedge p}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{q\vee p}](r\wedge p)=\{r\wedge p, r\vee p, p\vee p\}$ (since no morphism from $\Sigma _{{u}}$ to $\Sigma _{{p}}$ maps $r\wedge p$ into $\{p\vee r, p\vee p\}$ ). Thus, by Corollary 4.3, any interpolant for $\varphi $ and $\psi $ other than $p\vee p$ may be spoiled by extending $\mathbf {PL}$ by new models.

Indeed, $p\vee p$ is an interpolant for $\varphi $ and $\psi $ (since of course ${r\wedge p}\models {p\vee p}$ and ${p\vee p}\models {p\vee q}$ ). Consider $\mathbf {PL}$ -model $N=\{q\}\in {\mathbf {Mod}}_{\mathbf {PL}}(\Sigma _{{c}})$ . Let now $\mathbf {PL}^{+}$ be the extension of $\mathbf {PL}$ by a new $\Sigma _{{c}}$ -model $\widetilde {N}$ (with interpretation of propositional sentences “swapping” the valuation of propositional variables, as in Example 2.5). Then $\widetilde {N}\models ^{+}{p\vee p}$ while $\widetilde {N}\not \models ^{+}{p\vee q}$ , which shows that $p\vee p$ is not an interpolant for $\varphi $ and $\psi $ in $\mathbf {PL}^{+}$ . In fact, since no morphism from $\Sigma _{{u}}$ to $\Sigma _{{c}}$ maps $r\wedge p$ to $p\vee p$ , we have $[{r\wedge p}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{p\vee q}](p\vee p)=\{p\vee p\}\subseteq {\mathbf {Sen}}_{\mathbf {PL}}(\Sigma _{{c}})$ , and so it also follows directly from Corollary 4.5 that in some extension of $\mathbf {PL}$ by new models $p\vee p$ is not an interpolant for $\varphi $ and $\psi $ .

Summing up: none of the interpolants for $\varphi $ and $\psi $ in $\mathbf {PL}$ is stable under extension of $\mathbf {PL}$ by new models.

Let now $\varphi '$ be $(p\vee r)\wedge (p\vee {\neg r})$ and $\psi '$ be $(p\vee q)\wedge (p\vee {\neg q})$ . Clearly, ${(p\vee r)\wedge (p\vee {\neg r})}\models {(p\vee q)\wedge (p\vee {\neg q})}$ . Perhaps the most obvious interpolant for $\varphi '$ and $\psi '$ is p (since ${(p\vee r)\wedge (p\vee {\neg r})}\models p$ and $p \models {(p\vee q)\wedge (p\vee {\neg q})}$ ). This interpolant, however, is fragile: it may be spoiled by extending $\mathbf {PL}$ by new models. Namely, reasoning similarly as above, we can calculate:

$$ \begin{align*} {[{(p\vee r)\wedge(p\vee{\neg r})}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{ }(p\vee q)\wedge(p\vee{\neg q})]} {((p\vee r)\wedge(p\vee{\neg r}))}= \\[-1ex] \{(p\vee r)\wedge(p\vee{\neg r}), (p\vee p)\wedge(p\vee{\neg p})\} \subseteq{\mathbf{Sen}}_{\mathbf{PL}}(\Sigma_{{p}}). \end{align*} $$

Thus, by Corollary 4.3, p is not an interpolant for $\varphi '$ and $\psi '$ in an extension of $\mathbf {PL}$ by new models.

Another interpolant for $\varphi '$ and $\psi '$ in $\mathbf {PL}$ is $(p\vee p)\wedge (p\vee {\neg p})$ (which in $\mathbf {PL}$ is semantically equivalent to p). Since

$$\begin{align*}(p\vee p)\wedge(p\vee{\neg p}) \in {[{(p\vee r)\wedge(p\vee{\neg r})}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{ }(p\vee q)\wedge(p\vee{\neg q})]} {((p\vee r)\wedge(p\vee{\neg r}))}, \end{align*}$$

Corollary 4.3 cannot be used here to conclude that this interpolant gets spoiled in an extension of $\mathbf {PL}$ by new models. Moreover,

$$ \begin{align*} {[{(p\vee r)\wedge(p\vee{\neg r})}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{ }(p\vee q)\wedge(p\vee{\neg q})]} {((p\vee p)\wedge(p\vee{\neg p}))} = \\[-1ex] \{(p\vee p)\wedge(p\vee{\neg p}), (p\vee q)\wedge(p\vee{\neg q})\} \subseteq {\mathbf{Sen}}_{\mathbf{PL}}(\Sigma_{{c}}). \end{align*} $$

Consequently, Corollary 4.5 does not apply here either.

Theorem 4.6 implies that $(p\vee p)\wedge (p\vee {\neg p})$ is an interpolant for $\varphi '$ and $\psi '$ stable under extensions of $\mathbf {PL}$ by new models.

5. Spoiling interpolation by new models

As in the previous section, consider institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ , commutative square of signature morphisms $(\ast )$ , and sets of sentences $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \in {\mathbf {Sen}}(\Sigma _{{c}})$ such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ . Theorem 4.6 gives the exact characterisation of interpolants that are stable under extensions of ${\mathbf {I}}$ by new models. Of course, this also characterises interpolants that are fragile. In this section we characterise situations where all interpolants for the premise $\Phi $ and conclusion $\Psi $ may be spoiled at once when the institution is extended by new models.

Corollary 5.1. Define $\Phi ^\bullet =[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )\subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi ^\circ =[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\sigma _{{\!ip}}^{-1}(\Phi ^\bullet )))\subseteq \mathbf { Sen}{\Sigma _{{c}}}$ . If $\Psi \not \subseteq \Psi ^\circ $ then there is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by models such that there is no interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

Proof Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M (and its reducts for $\tau \colon \Sigma \to \Sigma _{{p}}$ ), with ${Th}^{+}(M)=\Phi ^\bullet $ , and a new $\Sigma _{{c}}$ -model N (and its reducts for $\tau \colon \Sigma \to \Sigma _{{c}}$ ), with ${Th}^{+}(N)=\Psi ^\circ $ .

Then $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ —the corresponding arguments in the proofs of Lemmas 4.1 and 4.4 work here as well.

Consider now any set $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ . If $\sigma _{{\!ip}}(\Theta )\not \subseteq \Phi ^\bullet $ then $M\not \models ^{+}\sigma _{{\!ip}}(\Theta )$ , but $M\models ^{+} \Phi $ (since $\Phi \subseteq \Phi ^\bullet $ ), and so $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ . Otherwise $\Theta \subseteq \sigma _{{\!ip}}^{-1}(\Phi ^\bullet )$ , so $\sigma _{{\!ic}}(\Theta )\subseteq \sigma _{{\!ic}}(\sigma _{{\!ip}}^{-1}(\Phi ^\bullet ))\subseteq \Psi ^\circ $ . Hence $N\models ^{+}\sigma _{{\!ic}}(\Theta )$ and since $N\not \models ^{+}\Psi $ , $\sigma _{{\!ic}}(\Theta )\not \models ^{+}\Psi $ . Thus, no set $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

The converse of Corollary 5.1 does not hold, since the conclusion follows as well when we limit our attention to consequences of $\Phi $ , rather than arbitrary sentences in $\Phi ^\bullet =[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ .

To avoid repetition, for the rest of this section let

$$\begin{align*}\Theta^\ast = \sigma_{{\!ip}}^{-1}([{\sigma_{{\!pu}}(\Phi)}\,{\stackrel[{\Sigma_{{u}}}]{{\Sigma_{{p}}}}{\leadsto}}\,{\sigma_{{\!cu}}(\Psi)}](\Phi)\cap{Th}(\Phi)) \end{align*}$$

(more explicitly: $\Theta ^\ast = \{\theta \in {\mathbf {Sen}}(\Sigma _{{i}}) \mid \sigma _{{\!ip}}(\theta )\in [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{u}}}]{{\Sigma _{{p}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi ), \Phi \models \sigma _{{\!ip}}(\theta )\}$ ).

Lemma 5.2. If $\Psi \not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ then no interpolant for $\Phi $ and $\Psi $ is stable under extensions of ${\mathbf {I}}$ by models.

Proof Consider an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ .

If $\Theta \not \subseteq \Theta ^\ast $ then $\sigma _{{\!ip}}(\Theta )\not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ , since $\Phi \models \sigma _{{\!ip}}(\Theta )$ . Therefore, by Corollary 4.3, the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models.

Otherwise $\Theta \subseteq \Theta ^\ast $ . Then we have $\Psi \not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ since $[{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta )) \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ . Hence, by Corollary 4.5, the interpolant $\Theta $ for $\Phi $ and $\Psi $ is not stable under extensions of ${\mathbf {I}}$ by models.

The thesis of Lemma 5.2 seems weaker that that of Corollary 5.1—but only superficially so:

Lemma 5.3. If no interpolant for $\Phi $ and $\Psi $ is stable under extensions of ${\mathbf {I}}$ by models then there is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by models such that $\Phi $ and $\Psi $ have no interpolant in ${\mathbf {I}}^{+}$ .

Proof Let $\mathcal {E}$ be the family of all interpolants $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ . For each $\Theta \in \mathcal {E}$ , let ${\mathbf {I}}^{\Theta }$ be an extension of ${\mathbf {I}}$ by models such that $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{\Theta }$ . Without loss of generality we may assume that the new models added in ${\mathbf {I}}^{\Theta }$ are distinct for $\Theta \in \mathcal {E}$ , i.e., model classes ${\mathbf {Mod}}^{\Theta }(\Sigma )\setminus {\mathbf {Mod}}(\Sigma )$ , for $\Theta \in \mathcal {E}$ , $\Sigma \in |{\mathbf {Sig}}|$ , are mutually disjoint. Define ${\mathbf {I}}^{+}$ to be the extension of ${\mathbf {I}}$ by models such that for $\Sigma \in |{\mathbf {Sig}}|$ , ${\mathbf {Mod}}^{+}(\Sigma )=\bigcup _{\Theta \in \mathcal {E}}{\mathbf {Mod}}^{\Theta }(\Sigma )$ with the satisfaction relation inherited from the appropriate ${\mathbf {I}}^{\Theta }$ , $\Theta\hspace{-1pt} \in\hspace{-1pt} \mathcal {E}$ . Then $\sigma _{{\!pu}}(\Phi )\hspace{-1pt}\models ^{+}\hspace{-1pt}\sigma _{{\!cu}}(\Psi )$ , since this holds in every ${\mathbf {I}}^{\Theta }$ , $\Theta\hspace{-1pt} \in\hspace{-1pt} \mathcal {E}$ . Moreover, none of $\Theta \in \mathcal {E}$ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ , since it is not an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{\Theta }$ . Consequently, there is no interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

Corollary 5.4. If $\Psi \not \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ then there is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by models such that there is no interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}^{+}$ .

Proof Directly by Lemmas 5.2 and 5.3.

Theorem 5.5. There is an interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models if and only if $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ and $\sigma _{{\!ic}}(\Theta ^\ast )\models \Psi $ .

Proof For the “if” part: by definition of $\Theta ^\ast $ , we have $\Phi \models \sigma _{{\!ip}}(\Theta ^\ast )$ , and so if $\sigma _{{\!ic}}(\Theta ^\ast )\models \Psi $ then $\Theta ^\ast $ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ . Moreover, since $\sigma _{{\!ip}}(\Theta ^\ast )\subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ , by Theorem 4.6, if $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ then $\Theta ^\ast $ is an interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models.

For the “only if” part: if there is an interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models then, by contrapositive of Lemma 5.3, there is an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ that is stable under extensions of ${\mathbf {I}}$ by models. Therefore, by Theorem 4.6, $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ and $\sigma _{{\!ip}}(\Theta )\subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ . Together with $\Phi \models \sigma _{{\!ip}}(\Theta )$ , the latter implies $\Theta \subseteq \Theta ^\ast $ . Thus $\sigma _{{\!ic}}(\Theta )\subseteq \sigma _{{\!ic}}(\Theta ^\ast )$ , hence $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ , and since $\sigma _{{\!ic}}(\Theta )\models \Psi $ , we also have $\sigma _{{\!ic}}(\Theta ^\ast )\models \Psi $ —which completes the proof.

Example 5.6. Recall Example 4.7. As argued there, every interpolant for $r\wedge p$ and $p\vee q$ in $\mathbf {PL}$ is fragile. Consequently, by Lemma 5.3, there is an extension of $\mathbf {PL}$ by models in which $r\wedge p$ and $p\vee q$ have no interpolant. Let us also check how Theorem 5.5 works here:

As in Example 4.7, $[{r\wedge p}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{p\vee q}](r\wedge p)=\{r\wedge p, p\vee r, p\vee p\}$ . Then, applying the notation $\Theta ^\ast $ as defined above for the case at hand, $\Theta ^\ast =\{p\vee p\}$ . Recalling another argument in Example 4.7, $[{r\wedge p}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{p\vee q}](\Theta ^\ast )=\{p\vee p\}$ , and so ${p\vee q}\not \in [{r\wedge p}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{p\vee q}](\Theta ^\ast )$ . Thus, by Theorem 5.5, it is not the case that in every extension of $\mathbf {PL}$ by models there is an interpolant for $r\wedge p$ and $p\vee q$ .

Looking now at the interpolants for $(p\vee r)\wedge (p\vee {\neg r})$ and $(p\vee q)\wedge (p\vee {\neg q})$ , as in Example 4.7, we have

$$ \begin{align*} [{(p\vee r)\wedge(p\vee{\neg r})}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{ }(p\vee q)\wedge(p\vee{\neg q})] {((p\vee r)\wedge(p\vee{\neg r}))}= \\[-1ex] \{(p\vee r)\wedge(p\vee{\neg r}), (p\vee p)\wedge(p\vee{\neg p})\}. \end{align*} $$

Therefore, again applying the notation $\Theta ^\ast $ for the current case, $\Theta ^\ast =\{(p\vee p)\wedge (p\vee {\neg p})\}$ , and then:

$$ \begin{align*} [{(p\vee r)\wedge(p\vee{\neg r})}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{ }{(p\vee q)\wedge(p\vee{\neg q})]} (\Theta^\ast) = \\[-1ex] \{(p\vee q)\wedge(p\vee{\neg q}), (p\vee p)\wedge(p\vee{\neg p})\}, \end{align*} $$

which contains $(p\vee q)\wedge (p\vee {\neg q})$ . Since ${(p\vee p)\wedge (p\vee {\neg p})}\models {(p\vee q)\wedge (p\vee {\neg q})}$ , by Theorem 5.5, $(p\vee r)\wedge (p\vee {\neg r})$ and $(p\vee q)\wedge (p\vee {\neg q})$ have an interpolant in every extension of $\mathbf {PL}$ by models. Indeed, in Example 4.7 we argued independently that $(p\vee p)\wedge (p\vee {\neg p})$ is such an interpolant.

6. Spoiling interpolation by new sentences

As before, we study interpolation in an institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ over a commutative square of signature morphisms $(\ast )$ .

Changes to a logical system and its properties that may arise when new sentences are introduced are in no sense dual to those resulting from extending the logical system by new models. In particular, new sentences do not modify entailments between the sentences of the original system, so they never spoil existing interpolants for old sentences. However, on the one hand, new sentences (over the premise and conclusion signatures) may lead to new entailments $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ with no interpolant for $\Phi $ and $\Psi $ (when $\Phi $ or $\Psi $ involve new sentences). On the other hand, adding appropriate new sentences (over the interpolant signature) may restore (or establish) the interpolation property (with new interpolants involving new sentences).

The first rough idea (see, for instance, the semantic characterisation of interpolation in [Reference Diaconescu15]) is that to spoil interpolation for the diagram $(\ast )$ , we look for a class $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ that is not definable in ${\mathbf {I}}$ , and then build an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences $\varphi \in {\mathbf {Sen}}^{+}(\Sigma _{{p}})$ and $\psi \in {\mathbf {Sen}}^{+}(\Sigma _{{c}})$ such that and . It follows then that $\sigma _{{\!pu}}(\varphi )\models ^{+}\sigma _{{\!cu}}(\psi )$ , and it may seem that there should be no interpolant for $\varphi $ and $\psi $ (since such an interpolant would have to define $\mathcal {K}$ ). However, the latter need not be true in general.

One technical nuance is that a set $\Theta \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ of sentences may then be an interpolant for $\varphi $ and $\psi $ even if ${Mod}^{+}(\Theta )\neq \mathcal {K}$ , namely when $\mathcal {K}\subseteq {Mod}^{+}(\Theta )$ and no model in ${Mod}^{+}(\Theta )\setminus \mathcal {K}$ has a $\sigma _{{\!ic}}$ -expansion to a model in ${\mathbf {Mod}}(\Sigma _{{c}})$ .

Example 6.1. In the institution $\mathbf {EQ}_\emptyset $ of equational logic (with empty carriers permitted) consider the diagram $(\ast )$ , where $\Sigma _{{i}}$ has two sorts $s,t$ and constants $a,b\colon t$ , $\Sigma _{{p}}$ extends it by a unary operation $f\colon s\to t$ , $\Sigma _{{c}}$ extends $\Sigma _{{i}}$ by a constant $c\colon s$ , $\Sigma _{{u}}={\Sigma _{{p}}\cup \Sigma _{{c}}}$ , and the signature morphisms are inclusions. Let $\Phi =\{\forall x{:}s\mathpunct {.} f(x)=a,\forall x{:}s\mathpunct {.} f(x)=b\}\subseteq {\mathbf {Sen}}_{\mathbf {EQ}_\emptyset }(\Sigma _{{p}})$ and $\Psi =\{a=b\}\subseteq {\mathbf {Sen}}_{\mathbf {EQ}_\emptyset }(\Sigma _{{c}})$ . Then $\Phi \models _{\Sigma _{{u}}}\Psi $ but (since ${Mod}(\Phi )$ contains models with the carrier of sort s empty, while ${Mod}(\Psi )$ does not). However, $\Theta =\{\forall x{:}s\mathpunct {.} a=b\}\subseteq {\mathbf {Sen}}_{\mathbf {EQ}_\emptyset }(\Sigma _{{i}})$ is an interpolant for $\Phi $ and $\Psi $ .

Another technicality is that the strong requirement may be weakened to . Similarly, at the conclusion side, it is enough to assume that all $\sigma _{{\!ic}}$ -expansions of the models in $\mathcal {K}$ are in ${Mod}(\psi )$ , , or equivalently, no model in $\mathcal {K}$ is a $\sigma _{{\!ic}}$ -reduct of a $\Sigma _{{c}}$ -model outside ${Mod}(\psi )$ , . We may also permit a gap between and as long as no definable class separates them.

Most importantly though, new sentences over signatures $\Sigma _{{p}}$ and $\Sigma _{{c}}$ may result in new $\Sigma _{{i}}$ -sentences as well (as translations of the added sentences), and some $\Sigma _{{i}}$ -model classes that are not definable in ${\mathbf {I}}$ may become definable in ${\mathbf {I}}^{+}$ .

The following notion will be used to take care of this: for any signature $\Sigma \in |{\mathbf {Sig}}|$ and collection $\mathcal {F}=\{\langle {\Sigma _j,\mathcal {M}_j}\rangle \mid {\Sigma _j\in |{\mathbf {Sig}}|,\mathcal {M}_j\subseteq {\mathbf {Mod}}(\Sigma _j),j\in \mathcal {J}}\}$ ,Footnote 11 we say that a class $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma )$ of $\Sigma $ -models is definable in ${\mathbf {I}}$ from $\mathcal {F}$ if for a family of signature morphisms $\tau _l\colon \Sigma _{j_l}\to \Sigma $ , where $j_l\in \mathcal {J}$ , $l\in \mathcal {L}$ , and a set $\Phi \subseteq {\mathbf {Sen}}(\Sigma )$ of $\Sigma $ -sentences we have .

Lemma 6.2. If there are classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ such that $:$

  1. 1. and

  2. 2. no class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \},$

then there is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences such that the diagram $(\ast )$ does not admit interpolation.

Proof Let ${\mathbf {I}}^{+}$ extend ${\mathbf {I}}$ by the following new sentences: $\Sigma _{{p}}$ -sentence $\varphi $ (and its translations $\lceil \tau (\varphi )\rceil \in {\mathbf {Sen}}^{+}(\Sigma )$ for $\tau \colon \Sigma _{{p}}\to \Sigma $ ) such that ${Mod}^{+}(\varphi )=\mathcal {M}$ , and $\Sigma _{{c}}$ -sentence $\psi $ (and its translations $\lceil \tau (\psi )\rceil \in {\mathbf {Sen}}^{+}(\Sigma )$ for $\tau \colon \Sigma _{{c}}\to \Sigma $ ) such that ${Mod}^{+}(\psi )=\mathcal {N}$ . Then $\sigma _{{\!pu}}(\varphi )\models ^{+}\sigma _{{\!cu}}(\psi )$ , since .

Suppose that there is an interpolant $\Theta ^{+}\subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ for $\varphi $ and $\psi $ in ${\mathbf {I}}^{+}$ . By the construction of ${\mathbf {I}}^{+}$ , $\Theta ^{+} = \Theta \cup \{\lceil \tau _l(\varphi )\rceil \mid \tau _l\colon \Sigma _{{p}}\to \Sigma _{{i}}, l\in \mathcal {L}_{{p}}\} \cup \{\lceil \tau _l(\psi )\rceil \mid \tau _l\colon \Sigma _{{c}}\to \Sigma _{{i}}, l\in \mathcal {L}_{{c}}\}$ , where $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ (and $\mathcal {L}_{{p}}$ and $\mathcal {L}_{{c}}$ are disjoint). This means that $\mathcal {K}={Mod}^{+}(\Theta ^{+})$ is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ .

However, $\varphi \models ^{+}\sigma _{{\!ip}}(\Theta ^{+})$ , hence and so . Moreover, $\sigma _{{\!ic}}(\Theta ^{+})\models ^{+}\psi $ , and so —which yields a contradiction.

Theorem 6.3. There is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences in which the diagram $(\ast )$ does not admit interpolation if and only if there are classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ such that $:$

  1. 1. and

  2. 2. no class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ .

Proof The “if” part is Lemma 6.2.

For the “only if” part: consider an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences, and let $\Phi ^{+}\subseteq {\mathbf {Sen}}^{+}(\Sigma _{{p}})$ and $\Psi ^{+}\subseteq {\mathbf {Sen}}^{+}(\Sigma _{{c}})$ be such that $\sigma _{{\!pu}}(\Phi ^{+})\models ^{+}\sigma _{{\!cu}}(\Psi ^{+})$ but there is no interpolant for $\Phi ^{+}$ and $\Psi ^{+}$ in ${\mathbf {I}}^{+}$ . Put $\mathcal {M}={Mod}^{+}(\Phi ^{+})$ and $\mathcal {N}={Mod}^{+}(\Psi ^{+})$ . Clearly, .

Suppose there is a class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and that is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ . Then there are $\Sigma _{{i}}$ -sentences $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ and signature morphisms $\tau _l\colon \Sigma _{{p}}\to \Sigma _{{i}}$ , $l\in \mathcal {L}_{{p}}$ , and $\tau _l\colon \Sigma _{{c}}\to \Sigma _{{i}}$ , $l\in \mathcal {L}_{{c}}$ , such that . Put $\Theta ^{+} = {\Theta \cup \bigcup _{l\in \mathcal {L}_{{p}}}\tau _l(\Phi ^{+})\cup \bigcup _{l\in \mathcal {L}_{{c}}}\tau _l(\Psi ^{+})} \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ . Then ${Mod}^{+}(\Theta _{{i}}^{+})=\mathcal {K}$ , and $\Theta ^{+}$ is an interpolant for $\Phi ^{+}$ and $\Psi ^{+}$ in ${\mathbf {I}}^{+}$ —which yields a contradiction.

Example 6.4. Consider an example in the institution $\mathbf {FO}_{\mathbf {EQ}}$ of first-order logic with equality. Let all the signatures in the diagram $(\ast )$ extend $\Sigma _{{i}}$ , which has exactly one sort ${Nat}$ , constant $0\colon {Nat}$ and operation $s\colon {Nat}\to {Nat}$ . In addition, $\Sigma _{{p}}$ has $\mathit{bop}\colon {{Nat}\times {Nat}}\to {Nat}$ and $\Sigma _{{c}}$ has ${{\_\!\!\_}+{\_\!\!\_}}\colon {{Nat}\times {Nat}}\to {Nat}$ . Finally, $\Sigma _{{u}}={\Sigma _{{p}}\cup \Sigma _{{c}}}$ , and all four signature morphisms in $(\ast )$ are inclusions.

Let $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ be the class of all models with the carrier set freely generated by $0$ and s (where each element is the value of exactly one of the terms of the form $s^n(0)$ ). Let then $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ be the class of models that satisfy the following implication:

$$\begin{align*}\psi \equiv (\forall x,y{:}{Nat}\mathpunct{.} x+0=x \wedge x+s(y)=s(x+y))\mathbin{\Rightarrow}\forall x,y{:}{Nat}\mathpunct{.} x+y=y+x. \end{align*}$$

Let $\mathbf {FO}_{\mathbf {EQ}}^{+}$ be the extension of $\mathbf {FO}_{\mathbf {EQ}}$ by a new $\Sigma _{{p}}$ -sentence $\varphi $ (and its formal translations) such that ${Mod}^{+}(\varphi )=\mathcal {M}$ .Footnote 12 No new $\Sigma _{{c}}$ -sentence is added, since $\mathcal {N}$ is already definable in $\mathbf {FO}_{\mathbf {EQ}}$ . Clearly, , and so $\sigma _{{\!pu}}(\varphi )\models ^{+}\sigma _{{\!cu}}(\psi )$ .

However, no class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ that is definable by first-order sentences excludes non-standard models of natural numbers (with “infinitary” elements). Moreover, there is no signature morphism from $\Sigma _{{p}}$ to $\Sigma _{{i}}$ . Therefore, if and $\mathcal {K}$ is definable in $\mathbf {FO}_{\mathbf {EQ}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle \}$ then (addition does not have to commute on “infinitary” arguments). Consequently, $\varphi $ and $\psi $ have no interpolant in $\mathbf {FO}_{\mathbf {EQ}}^{+}$ .

However, if we remove the additional operation $\mathit{bop}$ from the signature $\Sigma _{{p}}$ (and replace it by a unary operation $\mathit{uop}\colon {Nat}\to {Nat}$ ) the situation becomes quite different. We have then a (unique) signature morphism $\tau \colon \Sigma _{{p}}\to \Sigma _{{i}}$ , and the sentence $\lceil \tau (\varphi )\rceil \in {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ defines up to isomorphism the standard model of natural numbers, and therefore is an interpolant for $\varphi $ and $\psi $ .

For institutions like $\mathbf {PL}$ , where all classes of models are definable, it might seem that all commutative squares of signature morphisms admit interpolation, and no extension by sentences may spoil this property. However, this need not be the case, since in general, in an arbitrary institution, for classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ such that the inclusion may fail, and then no class $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ satisfies and .

Example 6.5. In the institution $\mathbf {PL}$ consider the diagram $(\ast )$ where $\Sigma _{{p}}=\{p\}$ , $\Sigma _{{c}}=\{q\}$ , $\Sigma _{{u}}=\{r\}$ , and $\Sigma _{{i}}=\emptyset $ (this determines the four signature morphisms as well). Note that ${\mathbf {Sen}}(\Sigma _{{i}}$ ) is non-empty (it contains for instance $\mathsf {false}$ , $\neg \mathsf {false}$ , etc.) and ${\mathbf {Mod}}(\Sigma _{{i}})=\{\emptyset \}$ , where $\emptyset $ is the empty $\Sigma _{{i}}$ -model. Putting $\mathcal {M}=\{\{p\}\}$ and $\mathcal {N}=\{\{q\}\}$ , we have , but , since . Indeed, there is no interpolant for p and q, even though $\sigma _{{\!pu}}(p)=r=\sigma _{{\!cu}}(q)$ .

The diagram $(\ast )$ admits weak amalgamation if for all models $M\in {\mathbf {Mod}}(\Sigma _{{p}})$ and $N\in {\mathbf {Mod}}(\Sigma _{{c}})$ such that there is a model $K'\in {\mathbf {Mod}}(\Sigma _{{u}})$ such that and . The diagram $(\ast )$ admits amalgamation if such a model $K'\in {\mathbf {Mod}}(\Sigma _{{u}})$ is always unique. This is a standard property used extensively in “institutional” foundations of software specifications [Reference Sannella and Tarlecki39, Reference Sannella and Tarlecki40]. Amalgamation (and hence weak amalgamation) holds for pushouts in all the sample institutions and their variants we defined in Examples 2.12.3; it fails though for some non-pushout diagrams.

Lemma 6.6. Suppose that the diagram $(\ast )$ admits weak amalgamation. Then for all classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ , implies .

Proof Let $M\in \mathcal {M}$ , and let $N\in {\mathbf {Mod}}(\Sigma _{{c}})$ be a $\sigma _{{\!ic}}$ -expansion of , i.e., . By the weak amalgamation property we have $K'\in {\mathbf {Mod}}(\Sigma _{{u}})$ such that and . Then , and so .

Corollary 6.7. If the diagram $(\ast )$ admits weak amalgamation and each class of $\Sigma _{{i}}$ -models is definable then the diagram $(\ast )$ admits interpolation in every extension of the institution ${\mathbf {I}}$ by new sentences.

Proof Directly from Lemma 6.6 and Theorem 6.3.

It turns out that the weak amalgamation property is also a necessary condition in the above corollary, in a strong sense:

Corollary 6.8. If the diagram $(\ast )$ does not admit weak amalgamation then it does not admit interpolation in some extension of the institution by new sentences, nor in its further extensions by new sentences.

Proof Consider $M\in {\mathbf {Mod}}(\Sigma _{{p}})$ and $N\in {\mathbf {Mod}}(\Sigma _{{c}})$ such that , but there is no model $K'\in {\mathbf {Mod}}(\Sigma _{{u}})$ such that and . Then the classes $\mathcal {M}=\{M\}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}={\mathbf {Mod}}(\Sigma _{{c}})\setminus \{N\}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ satisfy the requirements 1 () and 2 (since ) in Lemma 6.2, and so indeed, as in the proof of Lemma 6.2, interpolation over $(\ast )$ fails in the extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences $\varphi \in {\mathbf {Sen}}^{+}(\Sigma _{{p}})$ and $\psi \in {\mathbf {Sen}}^{+}(\Sigma _{{c}})$ with ${Mod}^{+}(\varphi )=\mathcal {M}$ and ${Mod}^{+}(\psi )=\mathcal {N}$ . Moreover, since there is no class $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and , no further extension of ${\mathbf {I}}^{+}$ by new sentences may create an interpolant for $\varphi $ and $\psi $ .

Theorem 6.9. Assume that each class of $\Sigma _{{i}}$ -models is definable. Then the diagram $(\ast )$ admits interpolation in every extension of the institution ${\mathbf {I}}$ by new sentences if and only if it admits weak amalgamation.

Proof The “if” part is Corollary 6.7; the “only if” part follows by Corollary 6.8.

If we disregard foundational issues (see footnote 4) and extend the institution by enough new sentences to make all classes of $\Sigma _{{i}}$ -models definable (in general this may require a proper class of sentences though) then in such an extension of the institution by new sentences the diagram $(\ast )$ admits interpolation provided it admits weak amalgamation.

7. Spoiling interpolation by new models and sentences

As so far, we study interpolation over a commutative diagram of signature morphisms $(\ast )$ in an institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ , in this section addressing the possibilities of spoiling interpolation by extending the institution with new models and sentences.

An extension of an institution ${\mathbf {I}}$ by new models and sentences is an extension ${\mathbf {I}}^{{+}\!\!{+}}$ by new sentences of an extension ${\mathbf {I}}^{+}$ by new models of the institution ${\mathbf {I}}$ .

The order of the extensions used above is irrelevant. For, let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by models $\mathcal {N\!M}=\langle {\mathcal {N\!M}_\Sigma ,{\models ^{\mathcal {N\!M}}_\Sigma }\subseteq {\mathcal {N\!M}_\Sigma \times {\mathbf {Sen}}(\Sigma )}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , and ${\mathbf {I}}^{{+}\!\!{+}}$ be the extension of ${\mathbf {I}}^{+}$ by sentences $\mathcal {N\!S}=\langle {\mathcal {N\!S}_\Sigma ,{\models ^{\mathcal {N\!S}}_\Sigma }\subseteq {{\mathbf {Mod}}^{+}(\Sigma )\times \mathcal {N\!S}_\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ (see Section 2.3 for the definitions and notation). Then define ${\mathbf {I}}'$ as the extension of ${\mathbf {I}}$ by sentences $\mathcal {N\!S}'=\langle {\mathcal {N\!S}_\Sigma ,{\models ^{\mathcal {N\!S}'}_\Sigma }\subseteq {{\mathbf {Mod}}(\Sigma )\times \mathcal {N\!S}_\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , where $M\models ^{\mathcal {N\!S}'}_\Sigma \varphi $ iff $M\models ^{\mathcal {N\!S}}_\Sigma \varphi $ for $\Sigma \in |{\mathbf {Sig}}|$ , $M\in {\mathbf {Mod}}(\Sigma )$ and $\varphi \in \mathcal {N\!S}_\Sigma $ . Then ${\mathbf {I}}^{{+}\!\!{+}}$ coincides with the extension of ${\mathbf {I}}'$ by models $\mathcal {N\!M}'=\langle {\mathcal {N\!M}_\Sigma ,{\models ^{\mathcal {N\!M}'}_\Sigma }\subseteq {\mathcal {N\!M}_\Sigma \times {\mathbf {Sen}}'(\Sigma )}}\rangle _{\Sigma \in |{\mathbf {Sig}}|}$ , where for $\Sigma \in |{\mathbf {Sig}}|$ and $M\in \mathcal {N\!M}_\Sigma $ , $M\models ^{\mathcal {N\!M}'}_\Sigma \varphi $ iff $M\models ^{\mathcal {N\!M}}_\Sigma \varphi $ for $\varphi \in {\mathbf {Sen}}(\Sigma )$ , and for $\tau \colon \Sigma '\to \Sigma $ , $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ , $M\models ^{\mathcal {N\!M}'}_\Sigma \lceil \tau (\varphi ')\rceil $ iff .

Obviously, we have “sinks” and “sources” of institution morphisms that link institution ${\mathbf {I}}$ and its extension ${\mathbf {I}}^{{+}\!\!{+}}$ by models and sentences:

$$\begin{align*}{\mathbf{I}} \xrightarrow{\ \mu_{\mathcal{N\!M}}} {\mathbf{I}}^{+} \xleftarrow{\ \mu_{\mathcal{N\!S}}} {\mathbf{I}}^{{+}\!\!{+}} \qquad\qquad {\mathbf{I}} \xleftarrow{\ \mu_{\mathcal{N\!S}'}} {\mathbf{I}}' \xrightarrow{\ \mu_{\mathcal{N\!M}'}} {\mathbf{I}}^{{+}\!\!{+}} \end{align*}$$

However, in general there is no institution morphism between ${\mathbf {I}}$ and ${\mathbf {I}}^{{+}\!\!{+}}$ . Their relationship can be captured by another kind of mapping between institutions, where sentences and models translate covariantly, called institution encodings [Reference Tarlecki, Gabbay and de Rijke44] or forward institution morphisms [Reference Goguen and Roşu27] (used in an interesting way for instance in [Reference Bidoit and Hennicker5]).

Corollary 3.3 gives a sufficient condition that ensures that the Craig interpolation property over a diagram $(\ast )$ is stable under extensions of the institution by new models and sentences. The key result here is that this is also a necessary condition: if the conditions 1 and 2 stated in Corollary 3.3 fail for the diagram $(\ast )$ then in some extension of the institution by new models and sentences, the diagram $(\ast )$ does not admit interpolation.

Theorem 7.1. The diagram $(\ast )$ admits interpolation in all extensions of ${\mathbf {I}}$ by new models and sentences if and only if at least one of the following conditions holds $:$

  1. 1. $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is a retraction and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is a coretraction, or

  2. 2. $\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}$ is a retraction and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is a coretraction.

Proof The “if” part follows by Corollary 3.3.

For the “only if” part, assume that conditions 1 and 2 do not hold. Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M and a new $\Sigma _{{c}}$ -model N (and their formal reducts) such that M and N do not satisfy any ${\mathbf {I}}$ -sentences. Let then ${\mathbf {I}}^{{+}\!\!{+}}$ be the extension of ${\mathbf {I}}^{+}$ by a new $\Sigma _{{p}}$ -sentence $\varphi $ and a new $\Sigma _{{c}}$ -sentence $\psi $ (and their formal translations) such that:

We have then:

  • , where

  • , where

Clearly, $\mathcal {M}^{\varphi }\subseteq \mathcal {M}^{\psi }$ . Moreover, $\mathcal {N}^{\varphi }\subseteq \mathcal {N}^{\psi }$ when $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is not a retraction (since then $\mathcal {N}^{\varphi }=\emptyset $ ) or $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is not a coretraction (since then all $\rho _{{\!uc}}\colon \Sigma _{{u}}\to \Sigma _{{c}}$ satisfy $\sigma _{{\!cu}}\mathord {;}\rho _{{\!uc}}\neq {id}_{\Sigma _{{c}}}$ ). However, under our assumptions, at least one of these conditions holds (since condition 1 above does not hold), so we have ${Mod}^{{+}\!\!{+}}(\sigma _{{\!pu}}(\varphi ))\subseteq {Mod}^{{+}\!\!{+}}(\sigma _{{\!cu}}(\psi ))$ , that is, $\sigma _{{\!pu}}(\varphi )\models ^{{+}\!\!{+}}\sigma _{{\!cu}}(\psi )$ .

Suppose now that $\Theta \subseteq {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ is an interpolant for $\varphi $ and $\psi $ in ${\mathbf {I}}^{{+}\!\!{+}}$ . In particular, $\varphi \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\Theta )$ and so $M\models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\Theta )$ .

For ${\mathbf {I}}$ -sentences $\theta \in {\mathbf {Sen}}(\Sigma _{{i}})$ , $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\theta )$ , so $\Theta $ must not contain any “old” sentences $\theta \in {\mathbf {Sen}}(\Sigma _{{i}})$ . Hence all sentences in $\Theta $ are formal translations of $\varphi $ or of $\psi $ to the signature $\Sigma _{{i}}$ .

Consider such a translation of $\varphi $ , $\lceil \tau _{{\!pi}}(\varphi )\rceil \in {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ , where $\tau _{{\!pi}}\colon \Sigma _{{p}}\to \Sigma _{{i}}$ . If $\lceil \tau _{{\!pi}}(\varphi )\rceil \in \Theta $ then $M\models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \tau _{{\!pi}}(\varphi )\rceil )$ , and so $\tau _{{\!pi}}\mathord {;}\sigma _{{\!ip}}={id}_{\Sigma _{{p}}}$ . It follows that , and so $N\models ^{{+}\!\!{+}}\sigma _{{\!ic}}(\lceil \tau _{{\!pi}}(\varphi )\rceil )$ .

Consider now a translation of $\psi $ , $\lceil \rho _{{\!ci}}(\psi )\rceil \in {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ , where $\rho _{{\!ci}}\colon \Sigma _{{c}}\to \Sigma _{{i}}$ . If $\lceil \rho _{{\!ci}}(\psi )\rceil \in \Theta $ then $M\models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!ci}}(\psi )\rceil )$ . Therefore $\rho _{{\!ci}}\mathord {;}\sigma _{{\!ip}}=\sigma _{{\!cu}}\mathord {;}\tau _{{\!up}}$ for some $\tau _{{\!up}}\colon \Sigma _{{u}}\to \Sigma _{{c}}$ such that $\sigma _{{\!pu}}\mathord {;}\tau _{{\!up}}={id}_{\Sigma _{{p}}}$ . Then $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is a retraction, and so $\sigma _{{\!ic}}\colon \Sigma _{{i}}\to \Sigma _{{c}}$ is not a coretraction (since condition 2 does not hold). Therefore, $\rho _{{\!ci}}\mathord {;}\sigma _{{\!ic}}\neq {id}_{\Sigma _{{c}}}$ , hence , and so $N\models ^{{+}\!\!{+}}\sigma _{{\!ic}}(\lceil \rho _{{\!ci}}(\psi )\rceil )$ .

Consequently, $N\models ^{{+}\!\!{+}}\sigma _{{\!ic}}(\Theta )$ . But $N\not \models ^{{+}\!\!{+}}\psi $ , hence $\sigma _{{\!ic}}(\Theta )\not \models ^{{+}\!\!{+}}\psi $ .

This shows that no $\Theta \subseteq {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ is an interpolant for $\varphi $ and $\psi $ in ${\mathbf {I}}^{{+}\!\!{+}}$ when conditions 1 and 2 do not hold.

8. Bounded interpolation

It may be argued that in practical applications the relevant sets of sentences considered in the definition of the interpolation property (premises, conclusions and, most crucially, interpolants) should be finite. In this section we show how the characterisation results concerning the fragility of interpolants and interpolation carry over to this case as well. We discuss this in a somewhat more general setting, allowing the “size” of the sets of sentences involved to be bounded by a suitable cardinal (rather than requiring them to be finite).

Let $\kappa $ be a regular cardinalFootnote 13 —the finitary case mentioned above corresponds to $\kappa = \aleph _0$ .

As so far, let ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ be an institution; we consider a commutative diagram $(\ast )$ in the category of signatures ${\mathbf {Sig}}$ .

An interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ is $\kappa $ -bounded if the cardinality of $\Theta $ is smaller than $\kappa $ . A commutative square $(\ast )$ of signature morphisms admits $\kappa $ -bounded interpolation if all sets $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ of cardinalities smaller than $\kappa $ such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ have a $\kappa $ -bounded interpolant.

A diagram $(\ast )$ may admit $\kappa $ -bounded interpolation without admitting Craig interpolation (as defined in Section 3.2), and the opposite implication does not hold either (in compact institutions though, if $(\ast )$ admits Craig interpolation then it admits $\kappa $ -bounded interpolation). Similarly, for $\kappa '<\kappa $ , any $\kappa '$ -bounded interpolant is $\kappa $ -bounded, but a diagram $(\ast )$ may admit $\kappa '$ -bounded interpolation without admitting $\kappa $ -bounded interpolation, and the opposite implication does not hold either.

In Section 4 we discussed when particular interpolants may be spoiled by extending the institution by new models. The arguments and results there apply directly to the special situation when the interpolant is $\kappa $ -bounded. In particular, Theorem 4.6 holds for $\kappa $ -bounded interpolants as it is.

Section 5 culminates with Theorem 5.5, which in a way characterises the set $\Theta ^\ast \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ defined there as the largest possible interpolant for $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ stable under extensions of the institution by new models. For the bounded case we have to be able to choose an appropriate “sufficiently small” subset of $\Theta ^\ast $ , otherwise the result and its proof carries over:

Theorem 8.1. Consider $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ . Put $\Theta ^\ast = \sigma _{{\!ip}}^{-1}([{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )\cap {Th}(\Phi ))$ .

There is a $\kappa $ -bounded interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models if and only if for some $\Theta ^\circ \subseteq \Theta ^\ast $ of cardinality smaller than $\kappa $ , $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\circ ))$ and $\sigma _{{\!ic}}(\Theta ^\circ )\models \Psi $ .

Proof For the “if” part: by definition of $\Theta ^\ast $ , since by the assumption $\Theta ^\circ \subseteq \Theta ^\ast $ , we have $\Phi \models \sigma _{{\!ip}}(\Theta ^\circ )$ . Together with $\sigma _{{\!ic}}(\Theta ^\circ )\models \Psi $ this means that $\Theta ^\circ $ is an interpolant for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ . Moreover, since $\sigma _{{\!ip}}(\Theta ^\circ )\subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ and $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\circ ))$ , Theorem 4.6 implies that $\Theta ^\circ $ is an interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models. Of course, $\Theta ^\circ $ is $\kappa $ -bounded by the assumption.

For the “only if” part, if there is a $\kappa $ -bounded interpolant for $\Phi $ and $\Psi $ in every extension of ${\mathbf {I}}$ by models then there is a $\kappa $ -bounded interpolant $\Theta ^\circ \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ in ${\mathbf {I}}$ that is stable under extensions of ${\mathbf {I}}$ by models—this follows by mimicking the proof of Lemma 5.3 with only $\kappa $ -bounded interpolants considered. Therefore, by Theorem 4.6, $\Psi \subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\circ ))$ and $\sigma _{{\!ip}}(\Theta ^\circ )\subseteq [{\sigma _{{\!pu}}(\Phi )}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ . Together with $\Phi \models \sigma _{{\!ip}}(\Theta ^\circ )$ , the latter implies $\Theta ^\circ \subseteq \Theta ^\ast $ . Since we also have $\sigma _{{\!ic}}(\Theta ^\circ )\models \Psi $ —this completes the proof.

In the context of the $\kappa $ -bounded interpolation property, we may additionally assume that the cardinalities of $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ are smaller than $\kappa $ —this does not change the above result though.

To adapt the results of Section 6 to the $\kappa $ -bounded interpolation, we first have to adjust some basic notions.

For any signature $\Sigma \in |{\mathbf {Sig}}|$ , a class of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma )$ is $\kappa $ -definable in ${\mathbf {I}}$ if for a set $\Phi \subseteq {\mathbf {Sen}}(\Sigma )$ of cardinality smaller than $\kappa $ , $\mathcal {M}={Mod}(\Phi )$ . Then, given a collection $\mathcal {F}=\{\langle {\Sigma _j,\mathcal {M}_j}\rangle \mid {\Sigma _j\in |{\mathbf {Sig}}|,\mathcal {M}_j\subseteq {\mathbf {Mod}}(\Sigma _j),j\in \mathcal {J}}\}$ , $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma )$ is $\kappa $ -definable in ${\mathbf {I}}$ from $\mathcal {F}$ if for a set $\Phi \subseteq {\mathbf {Sen}}(\Sigma )$ of $\Sigma $ -sentences of cardinality smaller than $\kappa $ and a set $\mathcal {L}$ of cardinality smaller than $\kappa $ with signature morphisms $\tau _l\colon \Sigma _{j_l}\to \Sigma $ , $j_l\in \mathcal {J}$ , $l\in \mathcal {L}$ , we have .

The appropriate reformulation of Theorem 6.3 for the bounded interpolation is rather obvious now:

Theorem 8.2. There is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences in which the diagram $(\ast )$ does not admit $\kappa $ -bounded interpolation if and only if there are classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ such that $:$

  1. 1. and

  2. 2. no class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and is $\kappa $ -definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ .

Proof The proofs of Theorem 6.3 and of Lemma 6.2 essentially carry over to the present case (with $\kappa $ -definability and sets of sentences of cardinality smaller than $\kappa $ used in place of definability and arbitrary sets of sentences, respectively).

The links between the weak amalgamation and interpolation properties carry over to the bounded interpolation as well. In particular, Lemma 6.6 remains unaffected, and Corollary 6.8 holds for the $\kappa $ -bounded interpolation. Moreover, Corollary 6.7 and Theorem 6.9 hold for the $\kappa $ -bounded interpolation if we strengthen the requirement of definability of $\Sigma _{{i}}$ -model classes to their $\kappa $ -definability.

Interestingly, the final remark of Section 6 indicating that if the weak amalgamation property is assumed, the interpolation property may be ensured by extending the institution by (a possibly proper class of) new sentences, in the bounded case may be refined in a non-trivial way:

Theorem 8.3. Assume that the category of signatures ${\mathbf {Sig}}$ is locally small. If the diagram $(\ast )$ admits weak interpolation then there is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences such that the diagram $(\ast )$ admits $\kappa $ -bounded interpolation in ${\mathbf {I}}^{+}$ .

Proof Define institutions ${\mathbf {I}}_\alpha =\langle {{\mathbf {Sig}},{\mathbf {Sen}}_\alpha ,{\mathbf {Mod}},\langle {{\models ^\alpha _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ by transfinite induction as follows:

  • ${\mathbf {I}}_0={\mathbf {I}}$ ,

  • for any ordinal $\alpha $ , ${\mathbf {I}}_{\alpha +1}$ is the extension of ${\mathbf {I}}_\alpha $ by new $\Sigma _{{i}}$ -sentences $\theta _\Phi $ , one for each set $\Phi \subseteq {\mathbf {Sen}}_\alpha (\Sigma _{{p}})$ of cardinality smaller than $\kappa $ such that is not $\kappa $ -definable in ${\mathbf {I}}_\alpha $ , with ,

  • for any limit ordinal $\beta $ , ${\mathbf {I}}_\beta =\langle {{\mathbf {Sig}},{\mathbf {Sen}}_\beta ,{\mathbf {Mod}},\langle {{\models ^\beta _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ , where for $\Sigma \in |{\mathbf {Sig}}|$ , ${\mathbf {Sen}}_\beta (\Sigma )=\bigcup _{\alpha <\beta }{{\mathbf {Sen}}_\alpha (\Sigma )}$ and ${\models ^\beta _\Sigma }={\bigcup _{\alpha <\beta }{\models ^\alpha _\Sigma }}$ , and for $\sigma \colon \Sigma \to \Sigma '$ , ${\mathbf {Sen}}_\beta (\sigma )=\bigcup _{\alpha <\beta }{{\mathbf {Sen}}_\alpha (\sigma )}$ .

By the construction, for any ordinal $\alpha $ and set $\Phi \subseteq {\mathbf {Sen}}_\alpha (\Sigma _{{p}})$ of cardinality smaller than $\kappa $ , the class is $\kappa $ -definable in ${\mathbf {I}}_{\alpha +1}$ .

Let $\gamma $ be the initial (least) ordinal of cardinality $\kappa $ . Then in ${\mathbf {I}}_\gamma $ , for any set $\Phi \subseteq {\mathbf {Sen}}_\gamma (\Sigma _{{p}})$ of cardinality smaller than $\kappa $ , is $\kappa $ -definable (which implies that ${\mathbf {I}}_{\gamma +1}={\mathbf {I}}_\gamma $ ), since for any such set $\Phi $ we have that $\Phi \subseteq {\mathbf {Sen}}_\alpha (\Sigma _{{p}})$ for some $\alpha <\gamma $ . This holds for instance for $\alpha =\bigcup {\{{\delta <\gamma } \mid {\Phi \cap {\mathbf {Sen}}_\delta (\Sigma _{{p}})}\neq \emptyset \}}$ , since the cardinality of $\alpha $ , which is the union of a set of cardinality smaller than $\kappa $ of ordinals of cardinality smaller than $\kappa $ , is smaller than $\kappa $ . (Note that this argument would not work if sets $\Phi $ of arbitrary cardinality were to be considered.) Consequently, is $\kappa $ -definable in ${\mathbf {I}}_{\alpha +1}$ , and so in ${\mathbf {I}}_\gamma $ as well.

Now, the thesis follows for ${\mathbf {I}}^{+}={\mathbf {I}}_\gamma $ : for $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ of cardinalities smaller than $\kappa $ , if $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ then by Lemma 6.6. Since is $\kappa $ -definable in ${\mathbf {I}}^{+}$ , there is $\Theta \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ of cardinality smaller than $\kappa $ such that . It follows that $\Theta $ is a $\kappa $ -bounded interpolant for $\Phi $ and $\Psi $ .

The key result of Section 7, Theorem 7.1, applies for the bounded interpolation as it stands. The only adjustment needed is a small refinement in the proof of Lemma 3.2 (which may require an appropriate axiom of choice); the proof of Proposition 3.4 requires a similar adjustment:

Lemma 8.4. Consider the diagram $(\ast )$ of signature morphisms.

  1. 1. If ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is conservative then $(\ast )$ admits $\kappa $ -bounded interpolation.

  2. 2. If ${\mathbf {Sen}}(\sigma _{{\!ic}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{c}})$ is surjective and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is conservative then $(\ast )$ admits $\kappa $ -bounded interpolation.

Proof Adjusting the proof of Lemma 3.2: consider $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ and $\Psi \in {\mathbf {Sen}}(\Sigma _{{c}})$ of cardinalities smaller than $\kappa $ and such that $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!cu}}(\Psi )$ .

  1. 1. Suppose ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is conservative. Choose $\Theta \subseteq \sigma _{{\!ip}}^{-1}(\Phi )\subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ of the same cardinality as $\Phi $ such that $\sigma _{{\!ip}}(\Theta )=\Phi $ . Trivially, $\Phi \models \sigma _{{\!ip}}(\Theta )$ . Then $\sigma _{{\!pu}}(\Phi )=\sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))=\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))$ , and so $\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))\models \sigma _{{\!cu}}(\Psi )$ . Hence $\sigma _{{\!ic}}(\Theta )\models \Psi $ by conservativity of $\sigma _{{\!cu}}$ . Thus $\Theta $ is a $\kappa $ -bounded interpolant for $\Phi $ and $\Psi $ .

  2. 2. Suppose ${\mathbf {Sen}}(\sigma _{{\!ic}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{c}})$ is surjective and $\sigma _{{\!pu}}\colon \Sigma _{{p}}\to \Sigma _{{u}}$ is conservative. Choose $\Theta \subseteq \sigma _{{\!ic}}^{-1}(\Psi )\subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ of the same cardinality as $\Psi $ such that $\sigma _{{\!ic}}(\Theta )=\Psi $ . Trivially, $\sigma _{{\!ic}}(\Theta )\models \Psi $ . Moreover, $\sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))=\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))=\sigma _{{\!cu}}(\Psi )$ , and so $\sigma _{{\!pu}}(\Phi )\models \sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))$ , which implies $\Phi \models \sigma _{{\!ip}}(\Theta )$ by conservativity of $\sigma _{{\!pu}}$ . Thus $\Theta $ is a $\kappa $ -bounded interpolant for $\Phi $ and $\Psi $ .

Now, Corollary 3.3 and Theorem 7.1 hold for $\kappa $ -bounded interpolation: their proofs carry over relying on Lemma 8.4 in place of Lemma 3.2.

9. Craig–Robinson interpolation

In many applications, in particular in the theory of structured specifications and modular software development, the Craig interpolation property turns out a bit too weak if the underlying institution does not enjoy some sufficient closure properties. What is needed is a stronger form of interpolation, where the entailments between the premise and the conclusion, and between the interpolant and the conclusion are to hold only in the context of an additional theory or specification, which may be viewed as an additional “parameter” for the interpolation property. This leads to the following definition, working again in an institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ over a commutative square $(\ast )$ of signature morphisms [Reference Diaconescu15, Reference Dimitrakos and Maibaum20, Reference Sannella and Tarlecki40]:

For any sets of sentences $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Gamma ,\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ such that ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models _{\Sigma _{{u}}}\sigma _{{\!cu}}(\Psi )$ , an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ (over diagram $(\ast )$ ) is a set $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ of $\Sigma _{{i}}$ -sentences such that $\Phi \models _{\Sigma _{{p}}}\sigma _{{\!ip}}(\Theta )$ and ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\models _{\Sigma _{{c}}}\Psi $ .

The diagram $(\ast )$ admits Craig–Robinson (or parameterised) interpolation if for all $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Gamma ,\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ such that ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models \sigma _{{\!cu}}(\Psi )$ , there is an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ .

Clearly, the Craig interpolation property is a special case of the Craig–Robinson interpolation property where only the empty “parameter” set $\Gamma =\emptyset $ is considered—however, in general the latter property is stronger. This is true in spite of the fact that in institutions satisfying certain “closure” properties, the latter is implied by the former. For instance, if ${\mathbf {I}}$ has infinitary implication Footnote 14 then any diagram $(\ast )$ admits Craig interpolation in ${\mathbf {I}}$ if and only if it admits Craig–Robinson interpolation. The same holds if the institution is compact and has the usual binary implication, etc. Consequently, in the institutions $\mathbf {FO}$ of first-order logic and $\mathbf {PL}$ of propositional logic when a commutative square of signature morphisms admits Craig interpolation then it admits Craig–Robinson interpolation as well. This is not the case for equational logic though:

Example 9.1. In the institution $\mathbf {EQ}$ of equational logic, consider the diagram $(\ast )$ where all signatures have a single sort s, and $\Sigma _{{i}}=\Sigma _{{c}}$ have constants $a,b,c,d\colon s$ , while $\Sigma _{{p}}=\Sigma _{{u}}$ extends them by a unary operation $f\colon s\to s$ (and the signature morphisms are inclusions). Put $\Phi =\{f(a)=b,f(c)=d\}$ , $\Gamma =\{a=c\}$ , $\Psi =\{b=d\}$ . Clearly, ${\Phi \cup \Gamma }\models \Psi $ . However, there are no non-trivial consequences of $\Phi $ over the signature $\Sigma _{{i}}$ (conditional equations are not in $\mathbf {EQ}$ ), and so there is no interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ . This shows that in the institution of equational logic even union-intersection squares of signature inclusions need not admit Craig–Robinson interpolation.

Although the results presented in the previous sections do not apply directly to the Craig–Robinson interpolation, the techniques introduced may be used to show pretty much similar facts. For instance:

Theorem 9.2. Let $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Gamma ,\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ be sets of sentences such that ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models \sigma _{{\!cu}}(\Psi )$ . An interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ is stable under extensions of ${\mathbf {I}}$ by models if and only if the following conditions hold $:$

  1. 1. $\sigma _{{\!ip}}(\Theta )\subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ , and

  2. 2. $\Psi \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta )\cup \Gamma )$ .

Proof Following the pattern of the proof of Theorem 4.6 (and lemmas and corollaries it relies on):

For the “if” part, suppose that ${\mathbf {I}}^{+}$ is an extension of ${\mathbf {I}}$ by models such that $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in ${\mathbf {I}}^{+}$ , that is, we have $\sigma _{{\!pu}}(\Phi )\models ^{+}\sigma _{{\!cu}}(\Psi )$ , but $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ or ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\not \models ^{+}\Psi $ .

  1. 1. If $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ then for some model $M\in {\mathbf {Mod}}^{+}(\Sigma _{{p}})$ , $M\models ^{+} \Phi $ and $M\not \models ^{+}\sigma _{{\!ip}}(\Theta )$ . Then $\Phi \subseteq {Th}^{+}(M)$ and $\sigma _{{\!ip}}(\Theta )\not \subseteq {Th}^{+}(M)$ . Moreover, ${Th}^{+}(M)$ never separates $\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )$ from $\sigma _{{\!cu}}(\Psi )$ . It follows that $[{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )\subseteq {Th}^{+}(M)$ , which implies $\sigma _{{\!ip}}(\Theta )\not \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ .

  2. 2. If ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\not \models ^{+}\Psi $ then for some model $N\in {\mathbf {Mod}}^{+}(\Sigma _{{c}})$ , $N\models ^{+}{\sigma _{{\!ic}}(\Theta )\cup \Gamma }$ and $N\not \models ^{+}\Psi $ . Then ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\subseteq {Th}^{+}(N)$ and $\Psi \not \subseteq {Th}^{+}(N)$ , and ${Th}^{+}(N)$ never separates $\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )$ from $\sigma _{{\!cu}}(\Psi )$ . It follows now that $[{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))\subseteq {Th}^{+}(N)$ , which implies $\Psi \not \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ))$ .

For the “only if” part, let ${\mathbf {I}}^{+}$ be an extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M and a new $\Sigma _{{c}}$ -model N (and their formal reducts) with:

  • ${Th}^{+}(M)=[{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ ,

  • ${Th}^{+}(N)= [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta )\cup \Gamma )$ .

In ${\mathbf {I}}^{+}$ , we still have ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models ^{+}\sigma _{{\!cu}}(\Psi )$ . However, if condition 1 fails then $M\not \models ^{+}\sigma _{{\!ip}}(\Theta )$ , and so $\Phi \not \models ^{+}\sigma _{{\!ip}}(\Theta )$ , and if condition 2 fails then $N\not \models ^{+}\Psi $ , and so ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\not \models ^{+}\Psi $ . In either case, $\Theta $ is not an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in ${\mathbf {I}}^{+}$ .

Theorem 9.3. Consider $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{p}})$ and $\Gamma ,\Psi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ that satisfy ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models \sigma _{{\!cu}}(\Psi )$ . Put $\Theta ^\ast = \sigma _{{\!ip}}^{-1}([{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )\cap {Th}(\Phi ))$ .

There is an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in every extension of ${\mathbf {I}}$ by models if and only if $\Psi \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast ))$ and ${\sigma _{{\!ic}}(\Theta ^\ast )\cup \Gamma }\models \Psi $ .

Proof Following the pattern of the proof of Theorem 5.5:

For the “if” part, just notice that under the assumptions, $\Theta ^\ast $ is an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ , and by Theorem 9.2 it is stable under extensions of ${\mathbf {I}}$ by new models.

For the “only if” part, if there is an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in every extension of ${\mathbf {I}}$ by models then, reasoning similarly as in the proof of Lemma 5.3, there must be an interpolant $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in ${\mathbf {I}}$ that is stable under extensions of ${\mathbf {I}}$ by models. Therefore, by Theorem 9.2:

  • $\Psi \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta )\cup \Gamma )$ , and

  • $\sigma _{{\!ip}}(\Theta )\subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{p}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\Phi )$ .

Together with $\Phi \models \sigma _{{\!ip}}(\Theta )$ , the latter implies $\Theta \subseteq \Theta ^\ast $ . Hence $\sigma _{{\!ic}}(\Theta )\subseteq \sigma _{{\!ic}}(\Theta ^\ast )$ , and so $\Psi \subseteq [{(\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma ))}\,{\stackrel [{\Sigma _{{c}}}]{{\Sigma _{{u}}}}{\leadsto }}\,{\sigma _{{\!cu}}(\Psi )}](\sigma _{{\!ic}}(\Theta ^\ast )\cup \Gamma )$ . Since ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\models \Psi $ , we also have ${\sigma _{{\!ic}}(\Theta ^\ast )\cup \Gamma }\models \Psi $ —which completes the proof.

Theorem 9.4. There is an extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences in which the diagram $(\ast )$ does not admit Craig–Robinson interpolation if and only if there are classes of models $\mathcal {M}\subseteq {\mathbf {Mod}}(\Sigma _{{p}})$ and $\mathcal {G},\mathcal {N}\subseteq {\mathbf {Mod}}(\Sigma _{{c}})$ such that $:$

  1. 1. and

  2. 2. no class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {G}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ .

Proof Following the pattern of the proof of Theorem 6.3:

For the “if” part, let ${\mathbf {I}}^{+}$ be an extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -sentence $\varphi $ and new $\Sigma _{{c}}$ -sentences $\gamma $ and $\psi $ (and their formal translations) such that ${Mod}^{+}(\varphi )=\mathcal {M}$ , ${Mod}^{+}(\gamma )=\mathcal {G}$ and ${Mod}^{+}(\psi )=\mathcal {N}$ . Then, by assumption 1, we have ${\{\sigma _{{\!pu}}(\varphi ),\sigma _{{\!cu}}(\gamma )\}}\models \sigma _{{\!cu}}(\psi )$ . However, if there was an interpolant $\Theta ^{+}\subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ for $\varphi $ and $\psi $ w.r.t. $\gamma $ then the class ${Mod}^{+}(\Theta ^{+})\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ would be definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {G}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ and would satisfy and , contradicting assumption 2.

For the “only if” part: consider any extension ${\mathbf {I}}^{+}$ of ${\mathbf {I}}$ by new sentences with $\Phi \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{p}})$ and $\Gamma ,\Psi \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{c}})$ such that ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models ^{+}\sigma _{{\!cu}}(\Psi )$ but there is no interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in ${\mathbf {I}}^{+}$ . Put $\mathcal {M}={Mod}^{+}(\Phi )$ , $\mathcal {G}={Mod}^{+}(\Gamma )$ and $\mathcal {N}={Mod}^{+}(\Psi )$ . Clearly, condition 1 holds.

Suppose there is a class of models $\mathcal {K}\subseteq {\mathbf {Mod}}(\Sigma _{{i}})$ such that and that is definable in ${\mathbf {I}}$ from $\{\langle {\Sigma _{{p}},\mathcal {M}}\rangle ,\langle {\Sigma _{{c}},\mathcal {G}}\rangle ,\langle {\Sigma _{{c}},\mathcal {N}}\rangle \}$ . This means that there are $\Sigma _{{i}}$ -sentences $\Theta \subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ and signature morphisms $\tau _l\colon \Sigma _{{p}}\to \Sigma _{{i}}$ , $l\in \mathcal {L}_{{p}}$ , $\tau _l\colon \Sigma _{{c}}\to \Sigma _{{i}}$ , $l\in \mathcal {L}_{{c}}'$ , and $\tau _l\colon \Sigma _{{c}}\to \Sigma _{{i}}$ , $l\in \mathcal {L}_{{c}}$ , such that .

Put $\Theta ^{+} = {\Theta \cup \bigcup _{l\in \mathcal {L}_{{p}}}\tau _l(\Phi )\cup \bigcup _{l\in \mathcal {L}_{{c}}'}\tau _l(\Gamma )\cup \bigcup _{l\in \mathcal {L}_{{c}}}\tau _l(\Psi )} \subseteq {\mathbf {Sen}}^{+}(\Sigma _{{i}})$ . Then ${Mod}^{+}(\Theta ^{+})=\mathcal {K}$ , and $\Theta ^{+}$ is an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ in ${\mathbf {I}}^{+}$ —which yields a contradiction, proving condition 2.

Perhaps surprisingly, Theorem 7.1, Lemma 3.2, and Corollary 3.3 do not quite carry over. These results hint at a nice symmetry between the role of the premise and conclusion signatures the classical Craig interpolation in fact bears, in spite of its apparently asymmetrical formulation (this is also visible in the classical model theory through the equivalence between the Craig interpolation and Robinson consistency theorems, with the explicit symmetry in the formulation of the latter). This is lost for the Craig–Robinson interpolation: Example 9.1 shows that condition 2 in Lemma 3.2 does not entail Craig–Robinson interpolation property, and similarly in Corollary 3.3. However:

Lemma 9.5. If $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is such that ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is conservative then $(\ast )$ admits Craig–Robinson interpolation.

Proof Let $\Phi \subseteq {\mathbf {Sen}}(\Sigma _{{c}})$ and $\Gamma ,\Psi \in {\mathbf {Sen}}(\Sigma _{{c}})$ be such that ${\sigma _{{\!pu}}(\Phi )\cup \sigma _{{\!cu}}(\Gamma )}\models \sigma _{{\!cu}}(\Psi )$ .

Consider $\Theta =\sigma _{{\!ip}}^{-1}(\Phi )\subseteq {\mathbf {Sen}}(\Sigma _{{i}})$ . First, since ${\mathbf {Sen}}(\sigma _{{\!ip}})\colon {\mathbf {Sen}}(\Sigma _{{i}})\to {\mathbf {Sen}}(\Sigma _{{p}})$ is surjective, $\Phi =\sigma _{{\!ip}}(\Theta )$ , and so $\Phi \models _{\Sigma _{{p}}}\sigma _{{\!ip}}(\Theta )$ . Then, since $(\ast )$ commutes, $\sigma _{{\!pu}}(\Phi )=\sigma _{{\!pu}}(\sigma _{{\!ip}}(\Theta ))=\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))$ , and so ${\sigma _{{\!cu}}(\sigma _{{\!ic}}(\Theta ))\cup \sigma _{{\!cu}}(\Gamma )}\models \sigma _{{\!cu}}(\Psi )$ . Hence ${\sigma _{{\!ic}}(\Theta )\cup \Gamma }\models \Psi $ by conservativity of $\sigma _{{\!cu}}$ . Thus $\Theta $ is an interpolant for $\Phi $ and $\Psi $ w.r.t. $\Gamma $ .

Corollary 9.6. If $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is a retraction and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is a coretraction then $(\ast )$ admits Craig–Robinson interpolation.

Proof Follows by Lemma 9.5, as in the proof of Corollary 3.3.

Let’s have a look at the opposite implication:

Lemma 9.7. If the diagram $(\ast )$ admits Craig–Robinson interpolation in all extensions of ${\mathbf {I}}$ by new sentences and models then $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is a retraction.

Proof Suppose that $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is not a retraction, that is, there is no $\tau _{{\!pi}}\colon \Sigma _{{p}}\to \Sigma _{{i}}$ such that $\tau _{{\!pi}}\mathord {;}\sigma _{{\!ip}}={id}_{\Sigma _{{p}}}$ .

Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M and a new $\Sigma _{{c}}$ -model N (and their formal reducts) such that M and N do not satisfy any ${\mathbf {I}}$ -sentences. Let then ${\mathbf {I}}^{{+}\!\!{+}}$ be the extension of ${\mathbf {I}}^{+}$ by a new $\Sigma _{{p}}$ -sentence $\varphi $ and new $\Sigma _{{c}}$ -sentences $\gamma $ and $\psi $ (and their formal translations) such that ${Mod}^{{+}\!\!{+}}(\varphi ) = {\{M\}}$ , ${Mod}^{{+}\!\!{+}}(\gamma ) = {\{N\}}$ , ${Mod}^{{+}\!\!{+}}(\psi ) = \emptyset $ .

Since ${Mod}^{{+}\!\!{+}}(\{\sigma _{{\!pu}}(\varphi ),\sigma _{{\!cu}}(\gamma )\})=\emptyset $ , we have $\{\sigma _{{\!pu}}(\varphi ,\sigma _{{\!cu}}(\gamma )\}\models ^{{+}\!\!{+}}\sigma _{{\!cu}}(\psi )$ .

Suppose there is an interpolant $\Theta \subseteq {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ for $\varphi $ and $\psi $ w.r.t. $\gamma $ . Then $\varphi \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\Theta )$ , hence $M\models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\Theta )$ , and so:

  • no ${\mathbf {I}}$ -sentences are in $\Theta $ ;

  • for $\rho _{{\!pi}}\colon \Sigma _{{p}}\to \Sigma _{{i}}$ , $\lceil \rho _{{\!pi}}(\varphi )\rceil \not \in \Theta $ since $\rho _{{\!pi}}\mathord {;}\sigma _{{\!ip}}\neq {id}_{\Sigma _{{p}}}$ , hence , and so $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!pi}}(\varphi )\rceil )$ ;

  • for $\rho _{{\!ci}}\colon \Sigma _{{c}}\to \Sigma _{{i}}$ , $\lceil \rho _{{\!ci}}(\gamma )\rceil \not \in \Theta $ and $\lceil \rho _{{\!ci}}(\psi )\rceil \not \in \Theta $ , since and , hence $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!ci}}(\gamma )\rceil )$ and $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!ci}}(\psi )\rceil )$ .

Therefore $\Theta =\emptyset $ . But $\gamma \not \models ^{{+}\!\!{+}}\psi $ —which contradicts the assumption that $\Theta $ is an interpolant for $\varphi $ and $\psi $ w.r.t. $\gamma $ .

Lemma 9.8. If the diagram $(\ast )$ admits Craig–Robinson interpolation in all extensions of ${\mathbf {I}}$ by new sentences and models then $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is a coretraction.

Proof Suppose that $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is not a coretraction, that is, there is no $\tau _{{\!uc}}\colon \Sigma _{{u}}\to \Sigma _{{c}}$ such that $\sigma _{{\!cu}}\mathord {;}\tau _{{\!uc}}={id}_{\Sigma _{{c}}}$ .

Let ${\mathbf {I}}^{+}$ be the extension of ${\mathbf {I}}$ by a new $\Sigma _{{p}}$ -model M and a new $\Sigma _{{c}}$ -model N (and their formal reducts) such that M and N do not satisfy any ${\mathbf {I}}$ -sentences. Let then ${\mathbf {I}}^{{+}\!\!{+}}$ be the extension of ${\mathbf {I}}^{+}$ by a new $\Sigma _{{p}}$ -sentence $\varphi $ and new $\Sigma _{{c}}$ -sentences $\gamma $ and $\psi $ (and their formal translations) such that:

  • ,

  • ${Mod}^{{+}\!\!{+}}(\gamma ) = {\{N\}}$ ,

  • .

We have since $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is not a coretraction. Hence $\{\sigma _{{\!pu}}(\varphi ,\sigma _{{\!cu}}(\gamma )\}\models ^{{+}\!\!{+}}\sigma _{{\!cu}}(\psi )$ .

Suppose there is an interpolant $\Theta \subseteq {\mathbf {Sen}}^{{+}\!\!{+}}(\Sigma _{{i}})$ for $\varphi $ and $\psi $ w.r.t. $\gamma $ . Then $\varphi \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\Theta )$ , hence $M\models ^{{+}\!\!{+}}_{\Sigma _{{p}}}\sigma _{{\!ip}}(\Theta )$ , and so:

  • no ${\mathbf {I}}$ -sentences are in $\Theta $ ;

  • for $\rho _{{\!pi}}\colon \Sigma _{{p}}\to \Sigma _{{i}}$ , if $\lceil \rho _{{\!pi}}(\varphi )\rceil \in \Theta $ then $M\models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!pi}}(\varphi )\rceil )$ , hence $\rho _{{\!pi}}\mathord {;}\sigma _{{\!ip}}={id}_{\Sigma _{{p}}}$ , which implies and thus $N\models ^{{+}\!\!{+}}\sigma _{{\!ic}}(\lceil \rho _{{\!pi}}(\varphi )\rceil )$ ;

  • for $\rho _{{\!ci}}\colon \Sigma _{{c}}\to \Sigma _{{i}}$ , $\lceil \rho _{{\!ci}}(\gamma )\rceil \not \in \Theta $ and $\lceil \rho _{{\!ci}}(\psi )\rceil \not \in \Theta $ , since and , hence $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!ci}}(\gamma )\rceil )$ and $M\not \models ^{{+}\!\!{+}}\sigma _{{\!ip}}(\lceil \rho _{{\!ci}}(\psi )\rceil )$ .

Therefore $N\models ^{{+}\!\!{+}}\sigma _{{\!ic}}(\Theta )$ , but since we also have $N\models ^{{+}\!\!{+}}\gamma $ and $N\not \models ^{{+}\!\!{+}}\psi $ , $\sigma _{{\!ic}}(\Theta )\cup \{\gamma \}\not \models ^{{+}\!\!{+}}\psi $ —which contradicts the assumption that $\Theta $ is an interpolant for $\varphi $ and $\psi $ w.r.t. $\gamma $ .

Summing up:

Theorem 9.9. The diagram $(\ast )$ admits Craig–Robinson interpolation in all extensions of ${\mathbf {I}}$ by new sentences and models if and only if $\sigma _{{\!ip}}\colon \Sigma _{{i}}\to \Sigma _{{p}}$ is a retraction and $\sigma _{{\!cu}}\colon \Sigma _{{c}}\to \Sigma _{{u}}$ is a coretraction.

Proof The “if” part is Corollary 9.6, and the “only if” part follows by Lemmas 9.7 and 9.8.

10. Final remarks

In this paper we deal with a general interpolation property, recalling its formulation for an arbitrary logical system formalised as an institution. We study behaviour of interpolation properties over an arbitrary commutative square of signature morphisms under extensions of the institution by new models and sentences. We give an exact characterisation of the situations when a particular interpolant for a premise and a conclusion remains stable under institution extensions by new models (Theorem 4.6), or looking at this from the other side, when a particular interpolant for a premise and a conclusion is spoiled in some extension of the institution by new models. Another result (Theorem 5.5) gives sufficient and necessary conditions under which no interpolant for a given premise and conclusion may survive all extensions of the institution by new models, or turning to the positive view, when no extension by new models may spoil the interpolation property for a given premise and conclusion. Then we turn to institution extensions by new sentences, and give an exact characterisation of commutative squares of signature morphisms where adding new sentences may lead to the lack of interpolation (Theorem 6.3). Incidentally, we clarify here the role of the weak amalgamation property as a necessary condition without which interpolation fails if adding new sentences is permitted (Corollary 6.8). Finally, we give exact characterisation of commutative squares of signature morphisms where interpolation is ensured for any extension of the institution by new models and sentences (Theorem 7.1).

Then in Section 8 we argue that analogous characterisations hold for the stability under institution extensions by new models, by new sentences, and by new models and sentences, respectively, of bounded interpolation, where the size of the sets of sentences considered is bounded by some appropriate cardinal. We also show here that the weak amalgamation property makes it possible to extend the institution by new sentences so that the bounded interpolation property is ensured (Theorem 8.3). In particular, the results here cover finitary interpolation, where the interpolant sets of sentences are required to be finite (for finite sets of premises and conclusions).

Finally, in Section 9 we turn to the practically important Craig–Robinson (or parameterised) interpolation, where the conclusion is required to follow only when an additional “parameter” set of sentences over the signature of the conclusion is added to the premise and, respectively, to the interpolant. While the results concerning institution extensions by new models and institution extensions by new sentences carry over rather straightforwardly to this case, the final result concerning the stability of interpolation under institution extensions by new models and sentences differs and seems even stronger than the corresponding characterisation result for the standard Craig interpolation.

To avoid repetition, we refrain from studying in any detail a bounded version of Craig–Robinson interpolation—similar remarks and results as spelled out in Section 8 for bounded (Craig) interpolation would carry over.

In many applications, the class of signature morphisms and of their commutative squares for which the interpolation property is required does not cover all the possible morphisms. Typically, signature pushouts are of the utmost importance, with further restrictions on the classes of morphisms used. In fact, this is necessary in many contexts, as many institutions involved (including the many-sorted first-order logic $\mathbf {FO}$ and equational logic $\mathbf {EQ}$ ) simply do not admit interpolation for arbitrary signature pushouts. It would be interesting to check how such extra requirements on the signature morphisms involved interact with our characterisation theorems.

Acknowledgement

This is an essentially revised and extended version of [Reference Tarlecki, Baldan and de Paiva46]. Thanks to the anonymous CALCO’23 and JSL reviewers for a number of useful comments.

Footnotes

1 We disregard here model morphisms, which are crucial in many applications of the notion of institution [Reference Diaconescu15, Reference Sannella and Tarlecki40], but for the purposes of this paper are irrelevant.

2 The terminology varies; some authors use the term “conservative” for signature morphism that induce surjective reducts [Reference Goguen and Roşu27]. The more permissive definition used here seems closer to the standard definition of a conservative theory interpretation [Reference Chang and Jerome Keisler12].

3 The distinction between $\mathbf {FO}$ and $\mathbf {FO}_{\mathbf {EQ}}$ does not matter much, since the (non-)emptiness of the carrier of any sort may be captured by a logical sentence. However, this is in contrast with equational logic, sketched in Example 2.2, where the same distinction is crucial and leads to different properties of the logic (see, for instance, Example 3.1 and [Reference Tarlecki45]).

4 We disregard foundational problems that may arise here: in general the collection $\mathbf {Sen}^{+}(\Sigma )$ defined below may turn out to be a proper class (not a set). One way around this is to work with a more general notion of institution, where classes (rather than sets) of sentences over any signature are allowed. Alternatively, we may assume that $\mathbf {Sig}$ is small, or that it is locally small and $\mathcal {N\!S}_\Sigma \neq \emptyset $ for a set of signatures $\Sigma $ only.

5 $\lceil \tau (\varphi ')\rceil $ is our syntax for the sentence $\varphi '\in \mathcal {N\!S}_{\Sigma '}$ formally “fitted” by $\tau \colon \Sigma '\to \Sigma $ to the signature $\Sigma $ ; we assume that no sentences of the form $\lceil \tau (\varphi ')\rceil $ are present in $\mathbf {I}$ .

6 is our syntax for the model $M'\in \mathcal {N\!M}_{\Sigma '}$ formally “fitted” by $\tau \colon \Sigma \to \Sigma '$ to the signature $\Sigma $ ; we assume that no models of the form are present in $\mathbf {I}$ .

7 Footnote 4 applies here as well if needed.

8 An institution ${\mathbf {I}}=\langle {{\mathbf {Sig}}, {\mathbf {Sen}}, {\mathbf {Mod}}, \langle {{\models _\Sigma }}\rangle _{\Sigma \in |{\mathbf {Sig}}|}}\rangle $ is compact if for any signature $\Sigma \in |{\mathbf {Sig}}|$ , set $\Phi \subseteq {\mathbf {Sen}}(\Sigma )$ of $\Sigma $ -sentences and $\Sigma $ -sentence $\varphi \in {\mathbf {Sen}}(\Sigma )$ , whenever $\Phi \models \varphi $ then $\Phi _0\models \varphi $ for some finite $\Phi _0\subseteq \Phi $ .

9 To help memorising the notation: p for premise, c for conclusion, u for union, and i for intersection (or interpolant).

10 When convenient, we write $\varphi $ for $\{\varphi \}$ , relying on the context to impose such identification of a sentence with the one-element set that contains it.

11 $\mathcal {J}$ is a set of indices that “name” the elements of $\mathcal {F}$ ; we introduce such sets of indices whenever convenient.

12 For instance, using Standard ML [Reference Milner, Tofte, Harper and MacQueen30] notation, $\varphi $ might be written as $\texttt {datatype }{Nat} = 0 \mid s\texttt { of }{Nat}$ .

13 An infinite cardinal $\kappa $ is regular if the cardinality of the union of every set of cardinality smaller than $\kappa $ of sets of cardinality smaller than $\kappa $ is smaller than $\kappa $ [33].

14 That is: for any signature $\Sigma \in |{\mathbf {Sig}}|$ , set of sentences $\Gamma \subseteq {\mathbf {Sen}}(\Sigma )$ and sentence $\psi \in {\mathbf {Sen}}(\Sigma )$ , there is a sentence $\lceil \Gamma \mathbin {\Rightarrow }\psi \rceil \in {\mathbf {Sen}}(\Sigma )$ such that for all models $M\in {\mathbf {Mod}}(\Sigma )$ , $M\models {\lceil \Gamma \mathbin {\Rightarrow }\psi \rceil }$ iff $M\not \models \Gamma $ or $M\models \psi $ .

References

REFERENCES

Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Brückner, B., Mosses, P. D., Sannella, D., and Tarlecki, A., CASL: The common algebraic specification language . Theoretical Computer Science, vol. 286 (2002), no. 2, pp. 153196.Google Scholar
Barwise, J., Axioms for abstract model theory . Annals of Mathematical Logic, vol. 7 (1974), pp. 221265.Google Scholar
Bergstra, J. A., Heering, J., and Klint, P., Module algebra . Journal of the Association for Computing Machinery, vol. 37 (1990), no. 2, pp. 335372.Google Scholar
Beth, E. W., On Padoa’s method in the theory of definition . Indagationes Mathematicae (Proceedings), vol. 56 (1953), pp. 330339.Google Scholar
Bidoit, M. and Hennicker, R., Constructor-based observational logic . Journal of Logic and Algebraic Programming, vol. 67 (2006), nos. 1–2, pp. 351.Google Scholar
Borzyszkowski, T., Logical systems for structured specifications . Theoretical Computer Science, vol. 286 (2002), no. 2, pp. 197245.Google Scholar
Borzyszkowski, T., Generalized interpolation in first-order logic . Fundamenta Informaticae, vol. 66 (2005), no. 3, pp. 199219.Google Scholar
Caleiro, C., Gouveia, P., and Ramos, J., Completeness results for fibred parchments: Beyond the propositional base , Recent Trends in Algebraic Development Techniques. Selected Papers from the 16th International Workshop on Algebraic Development Techniques (Wirsing, M., Pattinson, D., and Hennicker, R., editors), Lecture Notes in Computer Science, 2755, Springer, Cham, 2003, pp. 185200.Google Scholar
Caleiro, C., Mateus, P., Ramos, J., and Sernadas, A., Combining logics: Parchments revisited , Recent Trends in Algebraic Development Techniques. Selected Papers from the 15th Workshop on Algebraic Development Techniques Joint with the CoFI WG Meeting (Cerioli, M. and Reggio, G., editors), Lecture Notes in Computer Science, 2267, Springer, Cham, 2001, pp. 4870.Google Scholar
Caleiro, C., Sernadas, A., and Sernadas, C., Fibring logics: Past, present and future , We Will Show Them! Essays in Honour of Dov Gabbay, Volume One (Artëmov, S. N., Barringer, H., d’Avila Garcez, A. S., Lamb, L. C., and Woods, J., editors), College Publications, 2005, pp. 363388.Google Scholar
Cengarle, M. V., Formal specifications with higher-order parameterization, Ph.D. thesis, Ludwig-Maximilians-Universität München, Institut für Informatik, 1994.Google Scholar
Chang, C.-C. and Jerome Keisler, H., Model Theory, third ed., North-Holland, Amsterdam, 1990.Google Scholar
Craig, W., Linear reasoning. A new form of the Herbrand–Gentzen theorem, this Journal, vol. 22 (1957), no. 3, pp. 250–268.Google Scholar
Diaconescu, R., An institution-independent proof of Craig interpolation theorem . Studia Logica, vol. 77 (2004), no. 1, pp. 5979.Google Scholar
Diaconescu, R., Institution-Independent Model Theory, Birkhäuser, Basel, 2008.Google Scholar
Diaconescu, R., Borrowing interpolation . Journal of Logic and Computation, vol. 22 (2011), no. 3, pp. 561586.Google Scholar
Diaconescu, R., Interpolation for predefined types . Mathematical Structures in Computer Science, vol. 22 (2012), no. 1, pp. 124.Google Scholar
Diaconescu, R., Three decades of institution theory , Universal Logic: An Anthology (Béziau, J.-Y., editor), Birkhäuser, Basel, 2012, pp. 309322.Google Scholar
Diaconescu, R., Generalised graded interpolation . International Journal of Approximate Reasoning, vol. 152 (2023), pp. 236261 (English).Google Scholar
Dimitrakos, T. and Maibaum, T. S. E., On a generalised modularization theorem . Information Processing Letters, vol. 74 (2000), nos. 1–2, pp. 6571.Google Scholar
Ehrig, H., Kreowski, H.-J., Thatcher, J. W., Wagner, E. G., and Wright, J. B., Parameter passing in algebraic specification languages . Theoretical Computer Science, vol. 28 (1984), no. 1–2, pp. 4581.Google Scholar
Gabbay, D. M. and Maksimova, L., Interpolation and Definability: Modal and Intuitionistic Logics, Oxford University Press, Oxford, 2005.Google Scholar
Găină, D., Interpolation in logics with constructors . Theoretical Computer Science, vol. 474 (2013), pp. 4659.Google Scholar
Găină, D., Downward Löwenheim–Skolem theorem and interpolation in logics with constructors . Journal of Logic and Computation, vol. 27 (2015), no. 6, pp. 17171752.Google Scholar
Găină, D. and Popescu, A., An institution-independent proof of the Robinson consistency theorem . Studia Logica, vol. 85 (2007), pp. 4173.Google Scholar
Goguen, J. A. and Burstall, R. M., Institutions: Abstract model theory for specification and programming . Journal of the ACM, vol. 39 (1992), no. 1, pp. 95146.Google Scholar
Goguen, J. A. and Roşu, G., Institution morphisms . Formal Aspects of Computing, vol. 13 (2002), nos. 3–5, pp. 274307.Google Scholar
Maibaum, T. S. E., Sadler, M. R., and Veloso, P. A. S., Logical specification and implementation , Foundations of Software Technology and Theoretical Computer Science (Joseph, M. and Shyamasundar, R., editors), Springer, Berlin, 1984, pp. 1330.Google Scholar
Meseguer, J., General logics , Logic Colloquium ’87 (Ebbinghaus, H.-D., editor), North-Holland, Amsterdam, 1989, pp. 275329.Google Scholar
Milner, R., Tofte, M., Harper, R., and MacQueen, D., The Definition of Standard ML (Revised), MIT Press, Cambridge, 1997.Google Scholar
Mossakowski, T., Pawłowski, W., Sannella, D., and Tarlecki, A., Parchments for CafeOBJ logics , Specification, Algebra, and Software - Essays Dedicated to Kokichi Futatsugi (Iida, S., Meseguer, J., and Ogata, K., editors), Lecture Notes in Computer Science, 8373, Springer, Berlin, 2014, pp. 6691.Google Scholar
Mossakowski, T., Tarlecki, A., and Pawłowski, W., Combining and representing logical systems using model-theoretic parchments , Recent Trends in Data Type Specification. Selected Papers from the 12th International Workshop on Specification of Abstract Data Types (Parisi-Presicce, F., editor), Lecture Notes in Computer Science, 1376, Springer, Berlin, 1998, pp. 349364.Google Scholar
nLab, Regular cardinal, 2022. Available at https://ncatlab.org/nlab/show/regular+cardinal (accessed 15 August 2023].Google Scholar
Popescu, A., Şerbănuţă, T. F., and Roşu, G., A semantic approach to interpolation . Theoretical Computer Science, vol. 410 (2009), nos. 12–13, pp. 11091128.Google Scholar
Renardel de Lavalette, G. R., Interpolation in computing science: The semantics of modularization . Synthese, vol. 164 (2008), no. 3, pp. 437450.Google Scholar
Robinson, A., A result on consistency and its application to the theory of definition . Indagationes Mathematicae (Proceedings), vol. 59 (1956), pp. 4758.Google Scholar
Rodenburg, P. H., A simple algebraic proof of the equational interpolation theorem . Algebra Universalis, vol. 28 (1991), pp. 4851.Google Scholar
Roşu, G. and Goguen, J. A., On equational Craig interpolation . Journal of Universal Computer Science, vol. 6 (2000), no. 1, pp. 194200.Google Scholar
Sannella, D. and Tarlecki, A., Specifications in an arbitrary institution . Information and Computation, vol. 76 (1988), nos. 2–3, pp. 165210.Google Scholar
Sannella, D. and Tarlecki, A., Foundations of Algebraic Specification and Formal Software Development, Monographs in Theoretical Computer Science, An EATCS Series, Springer, Berlin, 2012.Google Scholar
Sannella, D. and Tarlecki, A., Property-oriented semantics of structured specifications . Mathematical Structures in Computer Science, vol. 24 (2014), no. 2, p. e240205.Google Scholar
Tarlecki, A., Bits and pieces of the theory of institutions , Proceedings of the Tutorial and Workshop on Category Theory and Computer Programming (Pitt, D. H., Abramsky, S., Poigné, A., and Rydeheard, D. E., editors), Lecture Notes in Computer Science, 240, Springer, Berlin, 1986, pp. 334360.Google Scholar
Tarlecki, A., Moving between logical systems , Recent Trends in Data Type Specification. Selected Papers from the 11th Workshop on Specification of Abstract Data Types (Haveraaen, M., Owe, O., and Dahl, O.-J., editors), Lecture Notes in Computer Science, 1130, Springer, Berlin, 1996, pp. 478502.Google Scholar
Tarlecki, A., Towards heterogeneous specifications , Frontiers of Combining Systems 2 (Gabbay, D. and de Rijke, M., editors), Studies in Logic and Computation, 7, Research Studies Press, Taunton, 2000, pp. 337360.Google Scholar
Tarlecki, A., Some nuances of many-sorted universal algebra: A review . Bulletin of the European Association for Theoretical Computer Science, vol. 104 (2011), pp. 89111.Google Scholar
Tarlecki, A., Interpolation is (not always) easy to spoil , 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023) (Dagstuhl, Germany) (Baldan, P. and de Paiva, V., editors), Leibniz International Proceedings in Informatics (LIPIcs), 270, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Wadern, 2023, pp. 8:18:19.Google Scholar
Thatcher, J. W., Wagner, E. G., and Wright, J. B., Data type specification: Parameterization and the power of specification techniques . ACM Transactions on Programming Languages and Systems, vol. 4 (1982), no. 4, pp. 711732.Google Scholar
Väänänen, J., The Craig interpolation theorem in abstract model theory . Synthese, vol. 164 (2008), pp. 401420.Google Scholar
Veloso, P. A. S., On pushout consistency, modularity and interpolation for logical specifications . Information Processing Letters, vol. 60 (1996), no. 2, pp. 5966.Google Scholar
Veloso, P. A. S. and Maibaum, T. S. E., On the modularization theorem for logical specifications . Information Processing Letters, vol. 53 (1995), no. 5, pp. 287293.Google Scholar