Some contributions to presheaf model theory


Abstract

This paper makes contributions to “pure” sheaf model theory, the part of model theory in which the models are sheaves over a complete Heyting algebra. We start by outlining the theory in a way we hope is readable for the non-specialist. We then give a careful treatment of the interpretation of terms and formulae. This allows us to prove various preservation results, including strengthenings of the results of [1]. We give refinements of Miraglia’s work on directed colimits, [2], and an analogue of Tarski’s theorem on the preservation of \(\forall_2\)-sentences under unions of chains. We next show various categories whose objects are (pairs of) presheaves and sheaves with various notions of morphism are accessible in the category theoretic sense. Together these ingredients allow us ultimately to prove that these categories are encompassed in the AECats framework for independence relations developed by Kamsma in [3].

Introduction↩︎

Pure and applied model theory have advanced in consort since (at latest) Hrushovski’s proof of the Manin-Mumford conjecture in the 1990s.1 Classical model theory continues to have a wide range of new, striking applications, so wide that it would be invidious to attempt to survey them here. On the pure side too, inter alia, what has come to be known as neostability theory has thriven.2

However, arguably even more striking has been the spectacular impact this century of continous model theory, where truth values are taken in the real interval \([0,1]\) as opposed to a set of size two, \(\{\hskip 1ptT,F\hskip 1pt\}\), as in classical model theory. At this point of development its applications are, again, too widespread to survey here. As for classical model theory, a ‘pure’ part of the theory, plays an important rôle both intrisically and in applications.3

We assert the rise of continuous model theory is arguably more striking because it proves the key methodological point that one should not be afraid to change one’s set of “truth values” if doing so will help one mathematically in working with particular collections of mathematical structures and in different mathematical areas. Using the terms algebraic and analytic loosely, while classical model theory has proven marvelously useful in areas where one is working with ‘algebraic’ structures, continous model theory has in general turned out to be more appropriate when dealing with more ‘analytic’ structures and areas.

This paper is a contribution to a third type of model theory, variously known as the theory of sheaves of models, the theory of sheaf models, model theory in sheaves or sheaf model theory. The central idea is that one takes the “truth values” as lying in a complete Heyting algebra, \(\Omega\), and thus one is equipped to deal with sheaves over \(\Omega\). (As will be seen in §1, complete Heyting algebras are a common generalization of complete Boolean algebras and the collections of open subsets of topological spaces.) Clearly, sheaves are a more recent invention than algebra or analysis,4 however over the past 80 years they have come to play an central rôle in mathematics and we believe the theory of presheaf and sheaf models can make important contributions.

We want to stress immediately that talk about “truth values” in continous model theory and in sheaf model theory is not supposed to be taken literally. Its aim is to provide an evocative way for readers to key onto the crucial technical change that formulae interpreted in models are no longer simply either true or false, but take values in \([0,1]\) or a complete Heything algebra, respectively.

Continuous model theorists do not advocate for mathematicians to switch from working in classical (first order) logic to Łukasiewicz’s logic, Pavelka’s logic or continuous logic.5 They do not pursue an agenda to reform mathematical argumentation, as perhaps a constructivist might. The point, rather, is to develop tools analogous to those from classical model theory, but more suitable for dealing with parts of mathematics where analysis plays an essential rôle, in order to work in the usual mathematical tradition.

Likewise, our point of view in this paper is to contribute to the development of a theory analogous to classical model theory, but more suitable for dealing with parts of mathematics where sheaves plays an essential rôle, in order to work in the usual mathematical tradition. Two things follow from this. Firstly, this theory is concerned with first order logic and higher order logic is definitively not something about which it is concerned.6 Secondly, we absolutely eschew any interest in molding day to day mathematical practice in, for example, an intuitionistic direction. Our objectives are very different from those working, say, in topos theory.7

Sheaf model theory began in the 1970s with a substantial body of work on sheaves of models over topological spaces or for Boolean valued models, This strand of the area has continued to the present.

An early example is the line of work on model completion, model companions and certain generalizations of the Feferman-Vaught theorem in the restricted case of sheaves over Boolean spaces (i.e., those which are compact, Hausdorff and totally disconnected), initiated by Lipschitz and Saracino, [19], and Carson, [20], and pursued by Macintyre, [21], [22], Comer, [23], [24], Burris and Werner [25], [26] and Pappas, [27], see also Volger, [28], [29], [30], using Boolean valued structures rather than sheaves over Boolean spaces, and Lavendhomme and Lucas, [31], for related results for “mellow” sheaves over Hausdorff spaces without isolated points, and in a slightly different direction by Weispfennig, [32], Chatzadakis, [33] and Sureson, [34], [35]. (Chatzadakis works in the more general context of sheaves over locally compact, zero-dimensional spaces. Recall that locally compact Hausdorff spaces are totally disconnected if and only if they are zero-dimensional.) In a similar setting is Ellerman’s work, [36], on Boolean valued generalizations of ultraproducts, and the work of Pierobon and Viale, [37], on Łos’s theorem for Boolean valued models.

Other examples include the work of the work of Prest, alone and variously with Puninskaya, Ralph, Ranjani and Slávik, on sheaves of modules over (arbitrary) topological spaces, see [38], [39], [40], [41], [42], much of which is surveyed in [43], and the work of Caicedo and others on sheaves of models over (arbitrary) topological spaces, particularly with regard to generic model theorems, see Caicedo, [44], [45], Sette and Caicedo, [46], Forero, [47], Montoya, [48], Benavides, [49], and Ochoa and Villaveces, [50].

However, perhaps unlike in the case of continuous model theory, relatively early on Fourman and Scott ([51]) gave a very appealing framework within which to carry out sheaf model theory over complete Heyting algebras. (This framework was also studied independently by Higgs ([52], [53]), however only limited parts of [52] appeared in the published literature in [53], according to Higgs’s account there.)

We focus on this Fourman-Scott-Higgs framework here. One reason we do so is because of its elegance. Other motivations are more concerned with practicality. At present we believe this framework gives the best combination available of generality and the demonstrability of results analogous to those of classical model theory and continuous model theory. For example, in the framework one has versions of: the downward Löwenheim-Skolem theorem, due to Miraglia, [2], back-and-forth arguments/Fraïsse constructions, due to Brunner, [54], the omitting types theorem, Brunner and Miraglia, [55], the generic model theorem, due to Beerío, [56], Łos’s theorem, due to Miraglia, [57], and Aratake, [58], and Robinson’s method of diagrams, Brunner and Miraglia, [1]. See also the survey [59].

We should note we are not doctrinaire about the superiority of the Fourman-Scott-Higgs framework. In future it may be that similar substantial model theoretic results can be proved for, for example, sheaves over various types of quantales or over lineales. See for example the work of Mariano, with variously Alves, Mendes and Tenório, [60], [61], [62], Reyes-Zambrano, [63], Höhle-Kubiak, [64], Miraglia-Solitro, [65], Coniglio-Miraglia, [66], [67], and Resende, [68], [69], [70], for various analogues of the notion of \(\Omega\)-set for quantales, which would be necessary preliminaries for this type of development, and see [71] for lineales. However, as of yet little has been proved model theoretically in any of these directions. Hence our evaluation that the Fourmann-Scott framework is currently the most productive one in which to work.

In this paper we aim to contribute to the “pure” side of sheaf model theory, with results in analogues of work from the early days of classical model theory, such as various preservation theorems, and with results in some first steps in analogues of neostability theory. The former are needed for the latter.

We briefly summarize the contents of the paper. In §1 and §2 we go over the Fourman-Scott-Higgs framework. §1 discusses presheaves and sheaves over complete Heything algebras. Much of this material is known but we develop it here freshly and explicitly. In §2 we introduce \(L\)-structures in the collection of presheaves over a complete Heyting algebra. We then discuss how terms and the realizations of formulae should be interpreted in \(L\)-structures. We this treat relatively carefully as the detail of the interpretation of terms are needed for our results in following section and were passed over somewhat rapidly in previous presentations. We then define, with examples, what it is for the realization of formulas to be forced by an \(L\)-structure. We next briefly discuss extending the language with unary connectives corresponding to elements of the complete Heyting algebra. Finally, we discuss various notions of morphism between \(L\)-structures. In §3 we discuss various results on the preservation of the realization of formulae being forced under a map between two \(L\)-structures being either an \(L\)-morphism or an \(L\)-monomorphism. These culminate in our being able to improve substantively on some of the results on Robinson’s method of diagram contained in [1]. In §4 we introduce categories of interest to us with regards to neostability. The objects in each are pairs consisting of either a presheaf and a subpresheaf, a sheaf and a subpresheaf, a sheaf and a subsheaf or a sheaf and a subsheaf of density at most that of the sheaf, where in each case the larger structure is a model of a particular theory. For each collection of objects there are various notions of morphism, each leading to a separate category. Ultimately the most interesting ones for this paper are those where the morphism is a morphism of the larger structure which is either an \(L\)-monomorphism or an elementary \(L\)-embedding. We prove various results concerning the existence of directed colimits for these categories, building heavily on Miraglia’s results in [2]. In §5 we discuss the (category-theoretic) accessibility of various of our categories. Finally, in §6 we discuss how the categories dealt with in §5 fit into Kamsma’s framework of AECats, developed in [3], and outline the immediate implications of this in terms of uniqueness for independence relations for these categories.

1 Presheaves and sheaves↩︎

We start with basic definitions of partially ordered sets, complete lattices and complete Heyting algebras.

Definition 1. Let \(P\) be a set and \(\le\) a binary relation on \(P\). The pair \((P,\le)\) is a partially ordered set* (poset) if \[\begin{align} & \forall a \in P \hskip 2pt\hskip 2pta\le a \\ & \forall a, \hskip 2ptb \in P \hskip 2pt( ( a\le b \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptb \le a ) \longrightarrow a = b ) \\ & \forall a, \hskip 2ptb, \hskip 2ptc \in P \hskip 2pt( (a \le b \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptb \le c ) \longrightarrow a \le c ) \end{align}\]*

Definition 2. Let \((P,\le)\) be a partially ordered set and \(A\subseteq P\). \(A\) has a least upper bound* (lub), also called the supremum or the join of \(A\), if there is some \(p\in P\) such that \[\forall a \in A \hskip 2pt\hskip 2pta\le p \hskip 2pt and \hskip 2pt \forall q\in P \hskip 2pt((\forall a\in A \hskip 2pt\hskip 2pta \le q) \longrightarrow p \le q )\] Similarly \(A\) has a greatest lower bound (glb), also called the infimum or the meet of \(A\), if there is some \(p\in P\) such that \[\forall a \in A \hskip 2pt\hskip 2ptp\le a\hskip 2pt and \hskip 2pt \forall q\in P \hskip 2pt((\forall a\in A \hskip 2pt\hskip 2ptq \le p) \longrightarrow q \le p )\] The least upper bound and greatest lower bound are respectively denoted, if they exist, by \(\bigvee A\) and \(\bigwedge A\).*

We have the usual infix notation for dyadic joins and meets.

If \((P,\le)\) is a partially ordered set and \(A = \{\hskip 1ptx, y\hskip 1pt\}\subseteq P\) we write \(x\vee y\) and \(x \wedge y\) for \(\bigvee A\) and \(\bigwedge A\) respectively they exist.

Definition 3. A partially ordered set \((L,\le)\) is a complete lattice* if every \(A\subseteq L\) has both a least upper bound and a greatest lower bound.*

If \((L,\le)\) is a complete lattice we write \(\top\) and \(\bot\) for \(\bigwedge\emptyset\) and \(\bigvee\emptyset\), respectively, its greatest and least elements.

Definition 4. A complete lattice \((\Omega,\le)\) is a complete Heyting algebra, or frame, if \[\forall p\in \Omega \hskip 2pt\hskip 2pt\forall A\subseteq \Omega \hskip 2pt\hskip 2pt\hskip 2pt\hskip 2ptp \wedge \bigvee A = \bigvee\{\hskip 1pt p \wedge a\hskip 2pt:\hskip 2pta \in A\hskip 1pt\} .\]

Definition 5. If \((\Omega,\le)\) is a complete Heyting algebra and \(p\), \(q\in \Omega\) we define \[\begin{align} &p \mathop{\parbox{.5cm}{\rightarrowfill}}q (\in \Omega) as \bigvee\{\hskip 1ptr \in \Omega\hskip 2pt:\hskip 2ptr\wedge p \le q\hskip 1pt\}\hskip 2pt and \hskip 2pt\neg p (\in \Omega) as p\mathop{\parbox{.5cm}{\rightarrowfill}}\bot. \end{align}\]

Lemma 1. (Adjunction) Let \((\Omega,\le)\) be a complete Heyting algebra. If \(p\), \(q\), \(r\in \Omega\) then \(r \le p \mathop{\parbox{.5cm}{\rightarrowfill}}q\) if and only if \(r\land p \le q\).

We make a few simple observations about identities and inequalities in complete Heyting algebras will be useful in the ensuing, particularly in §4.

Lemma 2. (Modus ponens.) Let \(p\) and \(q\in \Omega\). Then \(p\land (p\rightarrow q) = p \land q\).

Proof. As \(p\land q \le q\) always holds, adjunction shows \(q\le p\mathop{\parbox{.5cm}{\rightarrowfill}}q\). Taking the meet (\(\land\)) with \(p\) on both sides gives \(p\land q \le p \land (p\mathop{\parbox{.5cm}{\rightarrowfill}}q)\).

Conversely, as \(p\mathop{\parbox{.5cm}{\rightarrowfill}}q \le p\mathop{\parbox{.5cm}{\rightarrowfill}}q\) holds, adjunction gives \(p\land (p\mathop{\parbox{.5cm}{\rightarrowfill}}q) \le q\). Taking the meet with \(p\) on both sides gives \(p\land (p\mathop{\parbox{.5cm}{\rightarrowfill}}q) \le p\land q\) ◻

Lemma 3. Let \(p\), \(q\) and \(r\in \Omega\). Then \(p = p \land ( q \leftrightarrow r )\) if and only if \(p \land q = p \land r\).

Proof. If \(p = p \land ( q \leftrightarrow r )\) then \(p\le ( q \leftrightarrow r )\) and, by adjunction (Lemma (1), \(p\land q \le r\) and \(p\land r \le q\). Thus \(p\land q \le p\land r\) and \(p\land r \le p \land q\). Conversely, if \(p \land q = p \land r\) then \(p \land q \le r\) and \(p\land r \le q\), and so by adjunction \(p\le q \mathop{\parbox{.5cm}{\rightarrowfill}}r\) and \(p\le r\mathop{\parbox{.5cm}{\rightarrowfill}}q\). ◻

Lemma 4. Let \(p\), \(q\in \Omega\) and let \(d= p\mathop{\parbox{.5cm}{\rightarrowfill}}q\).

  1. The identity \(p = p \land ( q \leftrightarrow d )\) always holds.

  2. The identity \(p = p \land ( p \leftrightarrow d )\) is true if and only if \(p\le q\).

Proof. (1). By Lemma (3), \(p = p \land ( q \leftrightarrow d )\) holds if and only if \(p \land q = p \land d\) does. However, \(p \land d = p \land (p\mathop{\parbox{.5cm}{\rightarrowfill}}q) = p \land q\) by modus ponens. Thus \(p \land q = p \land d\) always holds.

(2). Similarly, by Lemma (3), \(p = p \land ( p \leftrightarrow d )\) holds if and only if \(p = p\land p = p\land d\) does. However, as in the proof of (1), \(p\land d = p \land (p\mathop{\parbox{.5cm}{\rightarrowfill}}q) = p \land q\), so \(p = p \land ( p \leftrightarrow d )\) holds if and only if \(p = p\land q\), that is, if and only if \(p\le q\). ◻

Definition 6. Let \(\Omega\) be a complete Heyting algebra and let \(p\), \(q\in \Omega\). We say \(p\) is dense in* \(q\) if \(p \le q \le \neg\neg p\) and \(p\) is dense if it is dense in \(\top\): \(\neg\neg p = \top\).*

We next introduce presheaves over complete Heyting algebras and the two types of products of them that are used pervasively in the paper.8

Definition 7. Let \(\Omega\) be a complete Heyting algebra. \(M = (|M|,\upharpoonright^M,E^M)\) is a presheaf over* \(\Omega\) if \(|M|\) is a set, \(\upharpoonright^M:|M|\times\Omega \longrightarrow |M|\) and \(E^M:|M|\longrightarrow \Omega\), and for all \(a\in |M|\) and \(p\), \(q\in \Omega\), \[\begin{align} & a\upharpoonright^M (p\wedge q) = (a\upharpoonright^M p)\upharpoonright^M q\\ & a\upharpoonright^M E^Ma = a \\ & E^M(a\upharpoonright^M p) = E^Ma \wedge p. \end{align}\]where, as we will throughout, we write \(E^M a\) for \(E^M(a)\) – the extent of \(a\) – and \(a\upharpoonright^M p\) for \(\upharpoonright^M(a,p)\)the restriction of \(a\) to \(p\).*

When clear from the context – and it almost invariably will be clear – we drop the superscripts and simply write \(E\) and \(\upharpoonright\) for \(E^M\) and \(\upharpoonright^M\), respectively.

Definition 8. If \(\Omega\) is a complete Heyting algebra, a presheaf \(M\) over \(\Omega\) is extensional* or separated if for all \(a\), \(b\in |M|\) and \(D\subseteq\Omega\) \[\big((\forall p \in D\hskip 2pt\hskip 2pta\upharpoonright p=b\upharpoonright p)\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt Ea=Eb=\bigvee D\big) \Longrightarrow a=b .\]*

Remark 1. From the point of view of the model theory of presheafs of first-order structures, which will be our focus here and which are introduced in Definition 37, nothing is lost by considering only extensional presheaves as there is a canonical and well-behaved process of extensionalization of a presheaf of first-order structures, as described in [76], Theorem (23.21).

Consequently we adopt the following convention.

From here on all presheaves (and sheaves) are assumed to be extensional.

We shall make extensive use of the \(\Omega\)-set structure derived from a presheaf.

Definition 9. Let \(\Omega\) be a complete Heyting algebra and \(M\) be a presheaf over \(\Omega\). Define \([.=.]_M:|M|\times |M|\longrightarrow \Omega\) by for \(a\), \(b\in |M|\) setting \[\begin{align} [a=b]_M = & \bigvee \{\hskip 1ptE(a\upharpoonright p) \wedge E(b\upharpoonright p)\hskip 2pt:\hskip 2ptp\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} \\ \big( = & \bigvee \{\hskip 1ptE(a\upharpoonright p) \hskip 2pt:\hskip 2ptp\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} \big).\\ \end{align}\]

::: {#[a=b]_below_Ea_Eb .Lemma} Lemma 5. Let \(\Omega\) be a complete Heyting algebra, \(M\) be a presheaf over \(\Omega\) and \(a\), \(b\in |M|\). Then \([a=b]_M \le Ea\), \(Eb\). :::

Proof. Immediate from the definition of \([a=b]_M\). ◻

::: {#[a=b]_[b_=c]le[a=c] .Lemma} Lemma 6. Let \(\Omega\) be a complete Heyting algebra, \(M\) be a presheaf over \(\Omega\) and \(a\), \(b\) and \(c\in |M|\). Then \([a=b]_M \land [b=c]_M \le [a = c]_M\). :::

Proof. By definition we have \[\begin{align} [a=b]_M \land [b=c]_M & = \bigvee \{\hskip 1ptE(b\upharpoonright p) \hskip 2pt:\hskip 2ptp\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} \\ &\land \bigvee \{\hskip 1ptE(b\upharpoonright q) \hskip 2pt:\hskip 2ptq\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptc\upharpoonright q = b\upharpoonright q\hskip 1pt\}. \end{align}\] By distributivity of \(\land\) over \(\bigvee\) twice this gives \[\begin{align} [a=b]_M \land [b=c]_M = & \bigvee \{\hskip 1ptE(b\upharpoonright p) \land E(b\upharpoonright q)\hskip 2pt:\hskip 2pt p,\hskip 2ptq\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p \\ & \qquad \quad \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptb\upharpoonright q = c\upharpoonright q \hskip 1pt\} \\ = & \bigvee \{\hskip 1ptE(b\upharpoonright p\land q)\hskip 2pt:\hskip 2pt p,\hskip 2ptq\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p\land q = \\ & \qquad \quad b\upharpoonright p\land q \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptb\upharpoonright p\land q = c\upharpoonright p\land q \hskip 1pt\} = [a=c]_M \end{align}\] ◻

Note, we clearly cannot expect equality in Lemma (6), for example, take \(a=c \ne b\).

As a first example we prove an equivalent criteria in terms of this structure for a presheaf to be existential.

Lemma 7. Let \(\Omega\) be a complete Heyting algebra and \(M\) a presheaf over \(\Omega\). \(M\) is extensional if and only if for all \(a, b\in |M|\) \([a=b]_M = Ea = Eb\) implies \(a=b\).

Proof. In one direction, suppose \(M\) is extensional and let \(a\), \(b\in |M|\) be such that \(([a=b]_M = Ea = Eb\). By Definition (9) we have \[\begin{align} [a=b]_M = & \bigvee \{\hskip 1ptE(a\upharpoonright p) \hskip 2pt:\hskip 2ptp\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\}\\ = & \bigvee \{\hskip 1ptp \hskip 2pt:\hskip 2ptp\in \Omega \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2ptp \le Ea \hskip 2pt\hskip 2pt\& \hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} . \end{align}\]

Define \(D= \{\hskip 1ptp\in \Omega\hskip 2pt:\hskip 2ptp \le Ea \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\}\). Then \([a=b]_M = \bigvee D\). By entensionality we thus have \(a=b\).

Conversely, let \(a\), \(b\in |M|\). By Lemma (5), \([a=b]_M \le Ea\), \(b\). Let \(D\subseteq \Omega\) be such that for all \(p\in D\) we have \(a\upharpoonright p = b\upharpoonright p\) and \(Ea=Eb=\bigvee D\). We thus have \[\begin{align} Ea= Eb =\bigvee D & = \bigvee\{\hskip 1ptp \in D\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} \\ & \le \bigvee\{\hskip 1ptp \le \bigvee D\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} = [a=b]_M. \end{align}\] Consequently \([a=b]_M = Ea = Eb\), and so by hypothesis \(a=b\). ◻

Definition 10. If \(\Omega\) is a complete Heyting algebra and \(M_0\), …, \(M_{n-1}\) are presheaves over \(\Omega\) then \(|M_0|\times\dots\times |M_{n-1}|\) is simply the Cartesian product* of the \(M_i\): \(\{\hskip 1pt\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\hskip 2pt:\hskip 2pt\forall i < n \; a_i \in |M_i|\hskip 1pt\}\). If \(M\) is such that for all \(i<n\) we have \(M=M_i\) we write \(|M|^n\) for the \(n\)-fold Cartesian power of \(|M|\).*

Definition 11. If \(\Omega\) is a complete Heyting algebra, \(n\ge 1\) and \(M_0\), …, \(M_{n-1}\) are presheaves over \(\Omega\) then \(M_0 \times \dots\times M_{n-1}\) is the presheaf product* of the \(M_i\), \(M_0 \times \dots\times M_{n-1}= (|M_0\times\dots\times M_{n-1}|, \upharpoonright^{M_0\times\dots\times M_{n-1}} , E^{M_0\times\dots\times M_{n-1} }))\), where \[\begin{align} |M_0\times\dots\times M_{n-1}| = & \\ \{\hskip 1pt\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\hskip 2pt:\hskip 2pt & \forall i < n \; a_i \in |M_i| \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\forall i, \hskip 2ptj <n\; E^{M_i}a_i = E^{M_j}a_j\hskip 1pt\}, \end{align}\]if \(p\in \Omega\) then \(\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\upharpoonright^{M_0\times\dots\times M_{n-1} } p = \langle\hskip 1pta_0\upharpoonright^{M_0} p,\dots,a_{n-1}\upharpoonright^{M_{n-1}} p\hskip 1pt\rangle\) and \(E^{M_0\times\dots\times M_{n-1} }\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle = E^{M_0}a_0\).*

Definition 12. If \(M\) is such that for all \(i<n\) we have \(M=M_i\) we write \(M^n\) for the \(n\)-fold presheaf power of* \(M\) and note that \[|M^n| = \{\hskip 1pt\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle \hskip 2pt:\hskip 2pt\forall i < n \; a_i \in |M| \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\forall i,\hskip 1ptj < n\; E^{M}a_i = E^{M}a_j\hskip 1pt\}.\]*

We now introduce morphisms between presheaves and related notions such as inclusions and monomorphisms.

Definition 13. Let \(\Omega\) be a complete Heyting algebra and \(M\), \(N\) presheaves over \(\Omega\). A presheaf morphism \(M \xlongrightarrow{f} N\) is a function \({f:|M|\longrightarrow |N|}\) such that for all \(a\in |M|\) and \(p\in \Omega\) we have \[E^N f(a) = E^M a \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptf(a\upharpoonright^M p) = f(a)\upharpoonright^N p.\]

Definition 14. If \(\Omega\) is a complete Heyting algebra then \(\mathop{\mathrm{pSh}}({\Omega})\) is the category whose objects are presheaves over \(\Omega\) and whose morphisms are presheaf morphisms.

Proposition 8. If \(\Omega\) is a complete Heyting algebra it is the terminal object in the category \(\mathop{\mathrm{pSh}}({\Omega})\).

Proof. Define \(\upharpoonright^\Omega\) and \(E^\Omega\) by setting \(q \upharpoonright^\Omega p = q \wedge p\) and \(E^\Omega q =q\), for \(p\), \(q\in\Omega\). Then it is immediate to check that \((\Omega,\upharpoonright^\Omega,E^\Omega)\in\mathop{\mathrm{pSh}}({(})\Omega)\) satisfies Definition (7). Furthermore, if \(M \in \mathop{\mathrm{pSh}}({\Omega})\) then, by Definition (7) and Definition (13), \(E^M\) is a presheaf morphism from \(M\) to \((\Omega,\upharpoonright^\Omega,E^\Omega)\). ◻

In view of Proposition (8) we introduce a convention that otherwise perhaps would at first sight be surprising.

Let \(M\) be a presheaf over \(\Omega\). We set \(M^0 = \Omega\).

We comment further on this notation when we discuss the interpretation of terms in \(L\)-structures prior to and in Definition (38) below.

Lemma 9. Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) presheaves over \(\Omega\), \(M \xlongrightarrow{f} N\) a presheaf morphism, and \(a\), \(b\in |M|\). Then \[[a=b]_M \le [f(a) = f(b)]_N.\]

Proof. If \(p\in \Omega\) and \(a\upharpoonright^M p = b\upharpoonright^M p\) then \(f(a) \upharpoonright^N p = f(a\upharpoonright^M p) = f(b\upharpoonright^M p)=f(b)\upharpoonright^N p\) and \(E^N f(a)\upharpoonright^N p = E^N f(a\upharpoonright^M p) = E^M a\upharpoonright^M p\). So the set over which we take the disjunction in the definition of \([a=b]_M\) is a subset of that over which we take the disjunction to evaluate \([f(a)=f(b)]_N\). ◻

We give a converse to this last lemma.

Lemma 10. Let \(\Omega\) be a complete Heyting algebra and \(M\), \(N\) presheaves over \(\Omega\). If \(f:M\longrightarrow N\) is a function such that for all \(a\), \(b\in |M|\) we have \(E^Ma = E^Nf(a)\) and \([a=b]_M \le [f(a)=f(b)]_N\) then \(f\) is a presheaf morphism.

Proof. Suppose \(a \in |M|\) and \(p\in \Omega\). We want to show \(f(a\upharpoonright p)= f(a)\upharpoonright p\). By extensionality, it suffices to show \[[f(a\upharpoonright p)= f(a)\upharpoonright p]_M = E^Nf(a\upharpoonright p) = E^Nf(a)\upharpoonright p.\]

However, \(E^Nf(a)\upharpoonright p = p\land E^Nf(a) = p\land E^Ma = E^Ma\upharpoonright p = E^Nf(a\upharpoonright p)\). Also, \(p\land E^Ma = [a\upharpoonright p = a]_M \le [f(a\upharpoonright p) = f(a)]_N \le E^Nf(a\upharpoonright p) = p\land E^Ma\). ◻

Definition 15. Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) presheaves over \(\Omega\) and \(|M|\subseteq |N|\). Then \(M\) is a subpresheaf* of \(N\) if the identity immersion is a presheaf morphism.*

Any subpresheaf of an extensional presheaf is extensional. (This is immediate from the definitions of extensional and subpresheaf.)

We next define the restriction of a presheaf to an element of \(\Omega\).

Definition 16. Let \(\Omega\) be a complete Heyting algebra, \(M\) is a presheaf over \(\Omega\) and \(p\in \Omega\). Set \(|M\upharpoonright p| = \{\hskip 1pta \in |M|\hskip 2pt:\hskip 2ptEa \le p\hskip 1pt\}\) and for all \(a\in |M\upharpoonright p|\) and \(q\in\Omega\) set \(a\upharpoonright^p q = a\upharpoonright q\) and \(E^p a = Ea\). Then define \({M\upharpoonright p = (|M\upharpoonright p|,\upharpoonright^p, E^p)}\),

It is immediate from the definition of \(M\upharpoonright p\) and the definition of presheaf morphism that if \(\Omega\) is a complete Heyting algebra, \(M\) is a presheaf over \(\Omega\) and \(p\in \Omega\) then \(M\upharpoonright p\) is a subpresheaf of \(M\).

Definition 17. Let \(\Omega\) be a complete Heyting algebra and \(M\), \(N\) presheaves over \(\Omega\). A presheaf morphism \(M \xlongrightarrow{f} N\) is a monomorphism* if \(f:|M|\longrightarrow |N|\) is injective.*

Proposition 11. (cf[76], Lemma 25.21.) Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) presheaves over \(\Omega\) and \(M \xlongrightarrow{f} N\) be a presheaf morphism. Suppose \(A\), \(B\) are subpresheaves of \(M\), \(N\), respectively, and that \(f\upharpoonright|A|:|A|\longrightarrow |B|\) is a presheaf morphism (i.e., \(\mathop{\mathrm{rge}}(f\upharpoonright|A|)\subseteq |B|\)). Then \(f\upharpoonright|A|\) is a presheaf monomorphism if and only if for all \(a\), \(b\in |A|\) we have, in the notation of Definition (9), \([a=b]_A = [f(a)=f(b)]_B\), or, more explicitly, \[\bigvee \{\hskip 1ptp\wedge Ea \wedge Eb\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} = \bigvee \{\hskip 1ptp\wedge Ea \wedge Eb\hskip 2pt:\hskip 2ptf(a\upharpoonright p) = f(b\upharpoonright p)\hskip 1pt\}.\]

Proof. If \(f\upharpoonright|A|\) is a presheaf monomorphism then for all \(a\), \(b\in A\) and \(p\in\Omega\), \(a\upharpoonright p\), \(b\upharpoonright p\in |A|\) and we have \(f(a\upharpoonright p) = f(b\upharpoonright p)\) if and only if \(a\upharpoonright p=b\upharpoonright p\), so the disjunctions in the definitions of \([a=b]_A\) and \([f(a)=f(b)]_B\) are taken over the same set.

Conversely, suppose \(a\), \(b\in |A|\) and \(f(a)=f(b)\). Then for all \(p\in\Omega\) we have \(f(a\upharpoonright p)= f(a)\upharpoonright p = f(b)\upharpoonright p=f(b\upharpoonright p)\), since \(f\) is a presheaf morphism, and so \([f(a)=f(b)]_B = Ef(a)=Ef(b)\), by the definition of \([.=.]_B\). Moreover, \(Ef(a)=Ef(b)= Ea=Eb\), since \(f\) is a presheaf morphism. Thus, if \([a=b]_A=[f(a)=f(b)]_B\) we have \([a=b]_A = Ea=Eb\), and so \(a=b\) by the extensionality of \(M\). ◻

We now discuss compatibility and glueing of sets of elements of a presheaf. This will lead to the definition of a sheaf.

Definition 18. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(C\subseteq |M|\). \(C\) is compatible* if for all \(a\), \(b\in C\) we have \[Ea\land Eb=\bigvee \{\hskip 1ptp\wedge Ea \wedge Eb\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\} \hskip 2pt\hskip 2pt\hskip 2pt( = [a=b]_M).\]*

Definition 19. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(C\subseteq |M|\) is compatible. A glueing of* \(C\) is a element \(b\in |M|\) such that \[Eb = \bigvee_{a\in C} Ea \hskip 2pt\hskip 2pt\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\hskip 2pt\hskip 2pt \forall a\in C \hskip 2pt\hskip 2ptEa = [a=b]_M \hskip 2pt\hskip 2pt\big( = \bigvee \{\hskip 1ptp\wedge Ea\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\}\big) .\]*

Lemma 12. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(C\subseteq |M|\) a compatible set. Then \(b\in |M|\) is a glueing of \(C\) if and only if \(Eb = \bigvee \{\hskip 1ptEa\hskip 2pt:\hskip 2pta\in C\hskip 1pt\}\) and for all \(a\in C\) we have \(b\upharpoonright Ea = a\).

Proof. For left-to-right, suppose \(b\) is a glueing of \(C\) and \(a\in C\). We have \[[b\upharpoonright Ea = a]_M = Ea \land [b=a]_M = Ea \land Ea = Ea .\] However we also have \(E(b\upharpoonright Ea) = Eb\land Ea = Ea\). Thus, by extensionality, \(b\upharpoonright Ea = a\).

For right-to-left, suppose \(a\in C\) and \(b\upharpoonright Ea = a\). Then \[Ea = E(b\upharpoonright a) = Eb\land Ea = [b\upharpoonright Ea = a]_M = Ea\land [b=a]_M,\] so \(Ea\le [ a=b]_M\). By Lemma (5), we also have \([a=b]_M \le Ea\), and thus have \([a=b]_M = Ea\). ◻

We show that no two elements of an extensional presheaf are represented by the same system of pairs.

Lemma 13. Let \(\Omega\) be a complete Heyting algebra, \(M\) an extensional presheaf over \(\Omega\) and \(D\subseteq |M|\). Let \(\{\hskip 1pt(d_i,p_i)\hskip 2pt:\hskip 2pt i\in I\hskip 1pt\}\subseteq D\times \Omega\). If \(a\), \(b\in |M|\), \(Ea=\bigvee_{i\in I} p_i = Eb\) and for all \(i\in I\) we have \(a\upharpoonright p_i = d_i \upharpoonright p_i = b\upharpoonright p_i\) then \(a=b\)

Proof. By the definition of \([.=.]_M\) we have that \([a=b]_M = \bigvee X\) where \(X=\{\hskip 1ptp\le Ea\wedge Eb\hskip 2pt:\hskip 2pta\upharpoonright p = b\upharpoonright p\hskip 1pt\}\). However for each \(i\in I\) we have that \(p_i\le Ea\wedge Eb = Ea = Eb\) and \(a\upharpoonright{p_i}=d_i\upharpoonright p_i = b\upharpoonright p_i\), so \(p_i\in X\). Thus \[Ea=Eb\ge [a=b]_M = \bigvee X \ge \bigvee_{i\in I}p_i = Ea = Eb.\] Hence \(Ea=Eb=[a=b]_M\). By extensionality this gives that \(a=b\) ◻

Definition 20. Let \(\Omega\) be a complete Heyting algebra. A presheaf \(M\) over \(\Omega\) is a sheaf* (or is complete) if every compatible subset of \(|M|\) has a (unique) glueing in \(|M|\).*

Definition 21. Let \(\Omega\) be a complete Heyting algebra. \(\mathop{{\mathrm{Sh}}}({\Omega})\) is the full subcategory of \(\mathop{\mathrm{pSh}}({\Omega})\) whose objects are sheafs over \(\Omega\) (and, by fullness, whose morphisms are the presheaf morphisms between sheafs).

In the ensuing we will need the notions of a subpresheaf and a subsheaf generated by a subset of a presheaf or sheaf. Here we introduce the relevant definitions for presheaves and sheaves as defined in Definition (7) and Definition (20). We first give abstract definitions and then show these are equivalent to a concrete construction.

Lemma 14. ([76], 24.10) Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\), \(I\) a set and suppose for all \(i\in I\) we have that \(M_i\) a subpresheaf of \(M\). Then \(\bigcap\{\hskip 1ptM_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\}\) is a subpresheaf of \(M\). Further, if for each \(i\in I\) we have \(M_i\) is a subsheaf of a sheaf \(M\) then \(\bigcap\{\hskip 1ptM_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\}\) is a subsheaf of \(M\).

Definition 22. ([76], 24.11, 24.13 ) Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(A\subseteq |M|\). Write for \(\lcurvyangle A \rcurvyangle\), the subpresheaf of* \(M\) generated by \(A\): \(\lcurvyangle A \rcurvyangle^M = \bigcap\{\hskip 1ptQ\subseteq M\hskip 2pt:\hskip 2ptQ is a presheaf and A\subseteq |Q|\hskip 1pt\}\). If \(M\) is also a sheaf over \(\Omega\), write \(\lcurvyangle A \rcurvyangle^M_s\) for \(\bigcap\{\hskip 1ptQ\subseteq M\hskip 2pt:\hskip 2ptQ is a sheaf and A\subseteq |Q|\hskip 1pt\}\), the subsheaf of \(M\) generated by \(A\). (Here we use the previous lemma to see that \(\lcurvyangle A \rcurvyangle\) really is a subpresheaf, resp., \(\lcurvyangle A \rcurvyangle_s\) a subsheaf.)*

We show this definition is unambiguous in the sense that going to larger ambient presheaves or sheaves does not change the generated subpresheaf or subsheaf, and thus the superscripts in the definition are superfluous.

Lemma 15. Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) presheaves over \(\Omega\), with \(M\) being a subpresheaf of \(N\) and \(A\subseteq |M|\). Then \(\lcurvyangle A \rcurvyangle^M = \lcurvyangle A \rcurvyangle^N\). If \(M\), \(N\) are sheaves over \(\Omega\), \(M\) is a subsheaf of \(N\) and \(A\subseteq |M|\) then \(\lcurvyangle A \rcurvyangle_s^M = \lcurvyangle A \rcurvyangle_s^N\).

Proof. In each case \(M\) is amongst the ’\(Q\)’s whose intersections are taken in the definition of \(\lcurvyangle A \rcurvyangle^N\) and \(\lcurvyangle A \rcurvyangle_s^N\) respectively in Definition (22). ◻

Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(A\subseteq |M|\). By Lemma (15), we simply write \(\lcurvyangle A \rcurvyangle\) for \(\lcurvyangle A \rcurvyangle^M\), and if \(M\) is a sheaf over \(\Omega\) we write \(\lcurvyangle A \rcurvyangle_S\) for \(\lcurvyangle A \rcurvyangle_s^M\)

Proposition 16. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(A\subseteq |M|\). Then \[|\lcurvyangle A \rcurvyangle| = \{\hskip 1pta\upharpoonright p\hskip 2pt:\hskip 2pta\in A \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp \in \Omega\hskip 1pt\} .\]

If \(M\) is also a sheaf over \(\Omega\), then \[|\lcurvyangle A \rcurvyangle_s| = \{\hskip 1pt b \in M\hskip 2pt:\hskip 2ptbis the glueing of a set of compatible elements of |\lcurvyangle A \rcurvyangle|\hskip 1pt\} .\]

Proof. Clearly if \(A\subseteq |Q|\), where \(Q\) is a subsheaf of \(M\), \(a\in A\) and \(p\in \Omega\), then \(a\upharpoonright p \in Q\) by the closure of \(Q\) under restriction. However, if we equip \(P = \{\hskip 1pta\upharpoonright p\hskip 2pt:\hskip 2pta\in A \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp \in \Omega\hskip 1pt\}\) with the operators \(E^P\) and \(\upharpoonright^P\) given by \(E^Pa\upharpoonright p = E^Ma \land p\) and \((a\upharpoonright p) \upharpoonright^P q= a \upharpoonright p\land q\), then \((P,E^P,\upharpoonright^P)\) is a subpresheaf of \(M\) with \(A\subseteq P\). Thus \(P=\lcurvyangle A \rcurvyangle\).

If \(M\) is a sheaf and \(Q\) is a subsheaf of \(M\) with \(A\subseteq |Q|\) then since \(Q\) is a subpresheaf of \(M\) we have \(|\lcurvyangle A \rcurvyangle|\subseteq |Q|\) and the glueing of every compatible set of elements of \(\lcurvyangle A \rcurvyangle\) is an element of \(Q\). However, clearly the set of glueings of a set of compatible elements of \(|\lcurvyangle A \rcurvyangle|\) is closed under further glueings. ◻

Whilst, as just noted, we do make use of the notion of a sub(pre)sheaf generated by a set of elements of a (pre)sheaf, a separate notion of the closure of a set of elements of a (pre)sheaf will also be crucial.

Definition 23. Let \(\Omega\) be a complete Heyting algebra and \(M\) a presheaf over \(\Omega\). For \(A\subseteq |M|\) define \(cl(A)\) to be the collection of all glueings in \(M\) of the sets of the form \(\{\hskip 1pta_i\upharpoonright p_i\hskip 2pt:\hskip 2pta_i\in A\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp_i\in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pti\in I\hskip 1pt\}\) which are compatible.

Explicitly, \[\begin{align} cl(A) &= \{ \hskip 1ptb\in |M| \hskip 1pt: \hskip 1pt\exists I \hskip 2pt\hskip 2pt\langle\hskip 1pt(a_i,p_i)\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\in {^I(A\times \Omega)} \\ &\qquad (\forall i,\hskip 2ptj\in I \hskip 2pt\hskip 2pt( Ea_i\upharpoonright p_i = Ea_j\upharpoonright p_j = [a_i\upharpoonright p_i = a_j\upharpoonright p_j]_M) ) \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\\ &\qquad Eb = \bigvee Ea_i\upharpoonright p_i \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\forall i\in I\hskip 2pt\hskip 2ptEa_i\upharpoonright p_i = [a_i\upharpoonright p_i = b]_M \hskip 1pt\}. \end{align}\]

Note that if \(M\) is a sheaf we can omit the words “in \(M\)” in the definition of \(cl(A)\) since \(M\) will* contain all the glueings of compatible systems.*

Lemma 17. Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) are sheaves over \(\Omega\), with \(M\) a subsheaf of \(N\) and \(A\subseteq |M|\) then \(cl^M(A)=cl^N(A)\).

Proof. Immediate from the uniqueness of glueings in \(M\). ◻

With this brief discussion of closure in hand we now turn to the notion of a subset of a presheaf being dense in another subset. This consequent notion of the density of a presheaf allows us to bound the cardinality of a presheaf in terms of its density. That this can be done will be important later. (The precise bound is not so crucial.)

Definition 24. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(D\), \(A\subseteq |M|\). Then \(D\) is dense in \(A\) if for every \(a\in A\) there is some \(\{\hskip 1pt(d_i,p_i)\hskip 2pt:\hskip 2ptd_i\in D\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp_i\in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pti\in I\hskip 1pt\}\) such that \(Ea=\bigvee_{i\in I} p_i\) and for all \(i\in I\) we have \(a\upharpoonright p_i = d_i \upharpoonright p_i\).

If \(M\) is a presheaf over \(\Omega\) and \(D\subseteq A \subseteq |M|\) and \(D\) is dense in \(A\) then, the definition of density immediately gives that \(A \subseteq cl(D)\).

Of course, it may well be that \(cl(D)\setminus A\) is non-empty, but that is very much to be expected for any notion of closure of a dense subset of a set (e.g, topologically) unless the set itself has good closure properties.

Lemma 18. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) and \(D\), \(A\subseteq |M|\). Then \(D\) is dense in \(A\) if and only if for all \(a\in A\) we have \(Ea = \bigvee \{\hskip 1pt[a=d]_M\hskip 2pt:\hskip 2ptd\in D\hskip 1pt\}\).

Proof. For the left-to-right direction, suppose \(a\in A\) and \(\{\hskip 1pt(d_i,p_i)\hskip 2pt:\hskip 2ptd_i\in D\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp_i\in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pti\in I\hskip 1pt\}\) is such that \(Ea=\bigvee_{i\in I} p_i\) and for all \(i\in I\) we have \(a\upharpoonright p_i = d_i \upharpoonright p_i\). Since for all \(d\in D\) we have \([a=d]_M\le Ea\) (by Lemma (5) we have \(\bigvee \{\hskip 1pt[a=d]_M\hskip 2pt:\hskip 2ptd \in D\hskip 1pt\}\le Ea\).

However, for \(i\in I\), since \(a\upharpoonright pi = d_i\upharpoonright p_i\) and \(Ea = \bigvee \{\hskip 1ptp_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\}\), we also have \[p_i\land [a = d_i]_M = [a\upharpoonright p_i=d_i\upharpoonright p_i]_M = p_i\land Ea = p_i\land Ed_i = p_i .\] Thus for every \(i\in I\) we have \(p_i\le [a=d_i]_M\) and hence \[Ea = \bigvee\{\hskip 1ptp_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\} \le \bigvee\{\hskip 1pt[a=d_i]_M\hskip 2pt:\hskip 2pti\in I\hskip 1pt\} \le \bigvee \{\hskip 1pt[a=d_i]_M\hskip 2pt:\hskip 2ptd\in D\hskip 1pt\}.\]

Thus we must have \(Ea = \bigvee \{\hskip 1pt[a=d]_M\hskip 2pt:\hskip 2ptd\in D\hskip 1pt\}\) as claimed.

For the right-to-left direction, if \(a\in D\) and \(Ea = \bigvee \{\hskip 1pt[a=d])M\hskip 2pt:\hskip 2ptd\in D\hskip 1pt\}\), then simply enumerate \(D\) as \(\{\hskip 1ptd_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\}\) and for \(i\in I\) set \(p_i\) to be \([a=d_i]_M\). Then the family \(S= \{\hskip 1pt(d_i,p_i)\hskip 2pt:\hskip 2pti \in I\hskip 1pt\}\) is as required. ◻

Corollary 19. Let \(\Omega\) be a complete Heyting algebra and \(M\), \(N\) and \(P\) sheaves over \(\Omega\) with \(|M|\), \(|N|\subset |P|\). Let \(A\subseteq |M|\) and suppose \(D\subseteq A\) is dense in \(A\). If \(D\subseteq |N|\), then \(A\subseteq |N|\).

Proof. Immediate from Lemma (17) and the definition of dense. ◻

Definition 25. Let \(\Omega\) be a complete Heyting algebra, \(M\) a presheaf over \(\Omega\) or a sheaf over \(\mathop{{\mathrm{Sh}}}({\Omega})\) and \(A\subseteq |M|\). We write \(d(A)\) for the density* of \(A\), the size of the smallest dense subset of \(A\). We write \(d(M)\) for \(d(|M|)\).*

Proposition 20. Let \(\Omega\) be a complete Heyting algebra. If \(M\) is a presheaf over \(\Omega\) then \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{|M|}\hfil\crcr}}}\hfil\crcr}} \le \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}^{d(M)}\).

Proof. This is immediate from Lemma (13). For each \(a\in M\) and \(\{\hskip 1pt(d_i,p_i)\hskip 2pt:\hskip 2ptd_i\in D\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp_i\in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pti\in I\hskip 1pt\}\) such that \(Ea=\bigvee_{i\in I} p_i\) and for all \(i\in I\) we have \(a\upharpoonright p_i = d_i \upharpoonright p_i\), let \(D_a=\{\hskip 1ptd_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\}\) and define \(p^a:D\longrightarrow \Omega\) by \(p^a(d) = p_i\) if \(d\in D_a\) and \(d=d_i\) and \(p^a(d)=\bot\) otherwise. Then \(Ea=\bigvee_{d\in D} p^a(d)\) and for all \(d\in D\) we have \(a\upharpoonright p^a(d) = d\upharpoonright p^a(d)\). Lemma (13) shows that \(p^a=p^b\) implies \(a=b\), so the function \(p^{.}:M\longrightarrow {{^D}\Omega}\) is injective. ◻

We now show how to amalgamate two presheaves or two sheaves when they are extensions of a common presheaf or sheaf.

Proposition 21. (Amalgamation for presheaves) Let \(\Omega\) be a complete Heyting algebra, let \(A\), \(M_0\) and \(M_1\) be presheaves over \(\Omega\) and let \(A \xlongrightarrow{f_0} M_0\) and \(A \xlongrightarrow{f_1} M_1\) be presheaf morphisms. Then there is a presheaf \(P\) over \(\Omega\) and presheaf monomorphisms \(M_0 \xlongrightarrow{g_0} P\) and \(M_1 \xlongrightarrow{g_1} P\) such that \(g_0\cdot f_0 = g_1\cdot f_1\). Furthermore, if \(M_0\) and \(M_1\) are sheaves over \(\Omega\) there is a sheaf \(S\) over \(\Omega\) and sheaf monomorphisms \(M_0 \xlongrightarrow{h_0} S\) and \(M_1 \xlongrightarrow{h_1} S\) such that \(h_0\cdot f_0 = h_1\cdot f_1\). then so are the \(h_i\).

Proof. We do the simplest thing possible: take the amalgamation of the underlying sets and impose the obvious restriction and extent functions by carrying over those from \(M_0\) and \(M_1\). We give the easy, but somewhat lengthy, details as we did not see them elsewhere in the literature.

Let \(|P|=\{\hskip 1pt(a,i)_{/{\sim}}\hskip 2pt:\hskip 2pti\in \{\hskip 1pt0,1\hskip 1pt\} \hskip 2pt\hskip 2pt\;\&\hskip 2pt\hskip 2pta \in |M_i|\hskip 1pt\}\) where \((a,i)\sim (b,j)\) if and only if \((a,i)=(b,j)\) or \(i\ne j\) and there is some \(c\in A\) such that \(a=f_i(c)\) and \(b=f_j(c)\).

For \((a,i)_{/{\sim}} \in |P|\) set \(E^P (a,i)_{/{\sim}} =E^{M_i} a\). This is a good definition, since if \(c\in A\) we have, since \(f_0\) and \(f_1\) are morphisms, that \(E^{M_0} f_0(c) = E^A a = E^{M_1} f_1(c)\).

For \((a,i)_{/{\sim}} \in |P|\) and \(p\in \Omega\) set \((a,i)_{/{\sim}} \upharpoonright^P p = (a \upharpoonright^{M_i} p,i)_{/{\sim}}\). If \(a\in |A|\) and \(p\in \Omega\) then since \(A\) is a presheaf we have \(a\upharpoonright^A p\in |A|\). Since \(f_0\) and \(f_1\) are morphisms we have, for each \(i\in \{\hskip 1pt0,1\hskip 1pt\}\), that \(f_i(a)\upharpoonright p =f_i(a\upharpoonright p)\). Consequently,\[\begin{gather} (f_0(a),0)_{/{\sim}} \upharpoonright^{P} p = (f_0(a)\upharpoonright^{M_0} p,0)_{/{\sim}} = (f_0(a\upharpoonright^A p),0)_{/{\sim}} = \\ (f_1(a\upharpoonright^A p),1)_{/{\sim}} = (f_1(a)\upharpoonright^{M_1} p,1)_{/{\sim}} = (f_1(a),1)_{/{\sim}} \upharpoonright^{P} p , \end{gather}\] and we have shown that \(\upharpoonright^P\) is well defined.

We have to check \(E^P\) and \(\upharpoonright^P\) satisfy the three presheaf-defining properties. Let \((a,i)_{/{\sim}} \in |P|\).

First of all, if \(p\in \Omega\) we have \(E^P((a,i)\upharpoonright p) = E^{M_i}(a\upharpoonright p) = E^{M_i} a\wedge p = {E^P (a,i)_{/{\sim}}} \wedge p\), where the second equality holds because \(M_i\) is a presheaf and the third by the definition of \(E^P\).

We also have \((a,i)_{/{\sim}} \upharpoonright E^P (a,i)_{/{\sim}} = (a \upharpoonright^{M_i} E^{M_i} a,i)_{/{\sim}} = (a,i)_{/{\sim}}\), where the first equality holds by the definition of \(E^P\) and the second holds since \(M_i\) is a sheaf and hence \(a \upharpoonright^{M_i} E^{M_i} a = a\).

Thirdly, if \(p\), \(q\in \Omega\) then \[\begin{gather} ((a,i)_{/{\sim}} \upharpoonright^P p)\upharpoonright^P q = ((a \upharpoonright^{M_i} p,i)_{/{\sim}} )\upharpoonright^P q = ((a \upharpoonright^{M_i} p)\upharpoonright^{M_i} q,i)_{/{\sim}} = \\ ((a \upharpoonright^{M_i} p\wedge q,i)_{/{\sim}} = ((a,i)_{/{\sim}}) \upharpoonright^P p\wedge q . \end{gather}\]

For \(i\in \{\hskip 1pt0,1\hskip 1pt\}\) and \(a\in |M_i|\) set \(g_i(a) = (a,i)_{/{\sim}}\).

We also have to check for \(i\in \{\hskip 1pt0,1\hskip 1pt\}\) that \(g_i\) is a monomorphism. However, if \(a\in |M_i|\) and \(p\in \Omega\) then \(E^P g_i(a) = E^P (a,i)_{/{\sim}} = E^{M_i} a\) by the definition of \(E^P\), and \(g_i(a \upharpoonright^{M_i} p)= (a\upharpoonright^{M_i} p,i)_{/{\sim}} = (a,i)_{/{\sim}} \upharpoonright^P p = g_i(a) \upharpoonright^P p\). Furthermore, if \(a\), \(b\in |M_i|\) and \((a,i)\sim (b,i)\) then \(a=b\).

The commuativity property holds since if \(a\in |A|\) then \[g_0\cdot f_0(a) = (f_0(a),0)_{/{\sim}} = (f_1(a),1)_{/{\sim}} = g_1\cdot f_1(a).\]

Finally, if \(M_0\) and \(M_1\) are sheaves one can simply sheafify the resultant presheaf \(P\) to obtain a sheaf \(S\) with a sheafification presheaf morphism \(P\xlongrightarrow{c} S\) and for \(i\in\{\hskip 1pt0,1\hskip 1pt\}\) take \(h_i = c\cdot g_i\). ◻

For the remainder of the paper we fix a complete Heyting algebra \(\Omega\).

2 \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\)↩︎

We begin with Scott’s notion of a characteristic function (cf. [51]).

Definition 26. Let \(M\) be a presheaf over \(\Omega\). \(h:|M|^n\longrightarrow \Omega\) is a if for \(\bar{a}=\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\), \(\bar{b}=\langle\hskip 1ptb_0,\dots,b_{n-1}\hskip 1pt\rangle \in |M|^n\), and writing \(E\bar{a}\) for \(\bigwedge_{j<n} Ea_j\), we have \[h(\bar{a})\le E\bar{a} andh(\bar{a}) \land\bigwedge_{j<n} [a_j=b_j]_M \le h(\bar{b}),\] or equivalently, \[h(\bar{a})\le E\bar{a} andh(\bar{a}) \land\bigwedge_{j<n} [a_j=b_j]_M = h(\bar{b}) \land\bigwedge_{j<n} [a_j=b_j]_M .\] Let \({\mathfrak k}_nM = \{\hskip 1pt h:|M|^n\longrightarrow \Omega\hskip 2pt:\hskip 2pth is a characteristic function\hskip 1pt\}\).

We note for fixed \(n\) elements of \({\mathfrak k}_nM\) can be combined, and indeed form a complete Heyting algebra.

Definition 27. (cf. [76], §37.) Let \(M\) be a presheaf over \(\Omega\) and \(n<\omega\). Let \(h\), \(k\in {\mathfrak k}_nM\).

Set \(h\accentset{\star}\le k\) if for all \(\bar{a}\in |M|^n\) we have \(h(\bar{a}) \le k(\bar{a})\).

For \(\diamondsuit\in \{\hskip 1pt\land,\lor\hskip 1pt\}\) define \(h\accentset{\star}\diamondsuit k\) by for all \(\bar{a}\in |M|^n\) setting \(h\accentset{\star}\diamondsuit k(\bar{a}) = h(\bar{a})\diamondsuit k(\bar{a})\).

Note, for all \(\bar{a}\in |M|^n\) we have \(h\accentset{\star}\diamondsuit k(\bar{a}) \le E\bar{a}\) since \(h(\bar{a})\), \(k(\bar{a})\le E\bar{a}\).

Define \(h\accentset{\star}\mathop{\parbox{.5cm}{\rightarrowfill}}k\) by for all \(\bar{a}\in |M|^n\) setting \((h\mathop{\parbox{.5cm}{\rightarrowfill}}k)(\bar{a}) = E\bar{a}\land ( h(\bar{a})\mathop{\parbox{.5cm}{\rightarrowfill}}k(\bar{a}))\), and define \(\accentset{\star}\neg h\) by for all \(\bar{a}\in |M|^n\) setting \((\neg h)(\bar{a}) = E\bar{a}\land (\neg h(\bar{a}))\).

The least element of \({\mathfrak k}_nM\) is the map \(\bot_{{\mathfrak k}_nM}\), for which for all \(\bar{a}\in |M|^n\) we have \(\bot_{{\mathfrak k}_nM}(\bar{a})=\bot_\Omega\), and whilst the greatest element of \({\mathfrak k}_nM\) is the map \(\top_{{\mathfrak k}_nM}\), for which for all \(\bar{a}\in |M|^n\) we have \(\top_{{\mathfrak k}_nM}(\bar{a})=E\bar{a}\).

Lemma 22. ([2], Lemma 1.2), Suppose \(M\) is a presheaf over \(\Omega\) and \({h:|M|^n\longrightarrow \Omega}\) is a characteristic function. Then \(h(\bar{a}\upharpoonright E\bar{a}) = h(\bar{a})\).

Proof. We have \(h(\bar{a}\upharpoonright E\bar{a}) \land \bigwedge_{j<n} [a_j = a_j\upharpoonright E\bar{a}]_M = h(\bar{a}) \land \bigwedge_{j<n} [a_j = a_j\upharpoonright E\bar{a}]_M\). Recall that for any \(b\in |M|\) and \(p\in \Omega\) we have \([b=(b\upharpoonright p)]_M = p\wedge [b=b]_M = p\land Eb\). Thus \[\begin{align} h(\bar{a}\upharpoonright E\bar{a}) & = h(\bar{a}\upharpoonright E\bar{a}) \land \bigwedge_{j<n} (E (a_j) \wedge E\bar{a}) = h(\bar{a}\upharpoonright E\bar{a}) \land \bigwedge_{j<n} [a_j = a_j\upharpoonright E\bar{a}]_M \\ & = h(\bar{a}) \land \bigwedge_{j<n} [a_j = a_j\upharpoonright E\bar{a}]_M = h(\bar{a}) \land \bigwedge_{j<n} (E (a_j) \wedge E\bar{a}) \\ & = h(\bar{a}) \land E\bar{a} = h(\bar{a}). \end{align}\] ◻

Lemma 23. Let \(n<\omega\), \(M \in pSh(\Omega)\) and \({\bar{a} = \langle\hskip 1pta_0, \ldots, a_{n-1}\hskip 1pt\rangle \in {^n|M|}}\). Let \(\bar{p} = \langle\hskip 1ptp_0, \ldots, p_{n-1}\hskip 1pt\rangle \in {^n\Omega}\) and write \(\bar{a}\upharpoonright\bar{p}\) for \(\langle\hskip 1pta_0\upharpoonright p_0,\dots,a_{n-1}\upharpoonright p_{n-1}\hskip 1pt\rangle\). Let \(h : |M|^n \mathop{\parbox{.5cm}{\rightarrowfill}}\Omega\) be a characteristic function. Then, \[h(\bar{a} \upharpoonright\bar{p}) = \bigwedge_{i <n} p_i \wedge h(\bar{a}) .\]

Proof. It suffices to prove the lemma when \(\langle\hskip 1ptp_1,\dots,p_{n-1}\hskip 1pt\rangle = \langle\hskip 1ptEa_1,\dots,Ea_{n-1}\hskip 1pt\rangle\) and use induction to prove the lemma in the generality stated. Let \(\bar{b} = a_0\upharpoonright p_0 \kern-.25pt\raise 4pt\frown\kern-.25pt\langle\hskip 1pta_1,\dots,a_{n-1}\hskip 1pt\rangle\). Then \[h(\bar{a}) \land \bigwedge_{i<n} [a_i = b_i ]_M \le h(\bar{b})\] by the second defining property of being a characteristic function. \[\begin{align} h(\bar{a}) \land p_0 = h(\bar{a}) \land p_0 \land E\bar{a} = & h(\bar{a}) \land \bigwedge_{i<n} [a_i = b_i ]_M = \\ & h(\bar{b}) \land \bigwedge_{i<n} [a_i = b_i ]_M = h(\bar{b}) \land E\bar{b}= h(\bar{b}). \end{align}\] ◻

Definition 28. A first order language with equality, \(L\), over \(\Omega\)* consists of sets for each \(n\in \omega\setminus\{\hskip 1pt0\hskip 1pt\}\) of (non-equality) \(n\)-ary relations \(\mathop{\mathrm{rel}}(n,L)\) and \(n\)-ary functions \(\mathop{\mathrm{fun}}(m,L)\), constant symbols \(C\) which form a presheaf over \(\Omega\), and variable symbols \(\{\hskip 1ptv_i\hskip 2pt:\hskip 2pti \in \mathbb{N}\hskip 1pt\}\).*

We now build towards defining the notion of an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\), originally given by [51], for \(L\) a first order language with equality over \(\Omega\). (See also [59], [74], [75].)

We start by defining, by simultaneous induction, terms and their extents.

Definition 29. Let \(L\) be a first order language with equality over \(\Omega\). Terms, \(\tau\), in \(L\) are strings of symbols and their extents, \(E\tau\), are elements of \(\Omega\). They are jointly generated, recursively, by the following three rules

  • Every variable is a term of \(L\) and has extent \(\top\).

  • Every constant of \(L\) is a term of \(L\) and as a term has extent equal to its extent as a constant.

  • If \(n > 0\), \(f\) is an \(n\)-ary function symbol of \(L\) and \(\tau_0\),…, \(\tau_{n-1}\) are terms so is \(f(\tau_0,\dots, \tau_{n-1})\), and it has extent \(E\tau_0\wedge \dots \wedge E\tau_{n-1}\).

Definition 30. Let \(L\) be a first order language with equality over \(\Omega\) and \(\tau\) a term in \(L\).

  • \(\mathop{\mathrm{FV}}(\tau)\) is the set of variables occuring (recursively in) \(\tau\).

  • \(v(\tau)\) is \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\mathop{\mathrm{FV}}(\tau)}\hfil\crcr}}}\hfil\crcr}}\)

  • \(k(\tau)\) is the least \(k\) such that \(\mathop{\mathrm{FV}}(\tau)\subseteq \{\hskip 1ptv_i\hskip 2pt:\hskip 2pti<k\hskip 1pt\}\).

Definition 31. Let \(L\) be a first order language with equality over \(\Omega\) and let \(\tau_0,\dots,\tau_{n-1}\) be a collection of terms in \(L\).

  • \(v(\tau_0,\dots,\tau_{n-1})\) is \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\mathop{\mathrm{FV}}(\tau_0)\cup\dots\cup \mathop{\mathrm{FV}}(\tau_{n-1})}\hfil\crcr}}}\hfil\crcr}}\)

  • \(k(\tau_0,\dots,\tau_{n-1})\) is the least \(k\) such that \(\mathop{\mathrm{FV}}(\tau_0)\cup\dots\cup \mathop{\mathrm{FV}}(\tau_{n-1}) \subseteq \{\hskip 1ptv_i\hskip 2pt:\hskip 2pti<k\hskip 1pt\}\).

Definition 32. Let \(L\) be a first order language with equality over \(\Omega\) and \(\tau\) a term in \(L\). If \(v(\tau)=0\) (or, equivalently, \(k(\tau)=0\)) we say \(\tau\) is a closed* term. Clearly, if \(\tau_0,\dots,\tau_{n-1}\) is a collection of terms in \(L\) then \(v(\tau_0,\dots,\tau_{n-1})=0\) if and only if all of the \(\tau_i\) are closed terms for \(i<n\).*

Definition 33. (cf. [77]) Let \(L\) be a first order language with equality over \(\Omega\). Formulae* are strings of symbols built using the relation, function, constant and variable symbols of \(L\), the equality symbol \(=\), the Boolean connectives \(\land\), \(\lor\), \(\longrightarrow\) and \(\neg\), the quantifiers \(\exists\) and \(\forall\), and parentheses \((\) , \()\), as in the classical case. Sentences are formulae with no free variables.*

Definition 34. Let \(L\) be a first order language with equality over \(\Omega\). A theory* (in \(L\)) or an \(L\)-theory is simply a set of \(L\)-sentences.*

Definition 35. (See [59], Definition 1.22.) Let \(L\) be a first order language with equality over \(\Omega\). Let \(\phi\) be a formula of \(L\). Define \[E\phi = \bigwedge \{\hskip 1ptE^C c \hskip 2pt:\hskip 2ptcoccurs in \phi\hskip 1pt\}.\]

Definition 36. Let \(L\) be a first order language with equality over \(\Omega\). For \(p \in \Omega\) and \(\gamma\) a term or a formula of \(L\) define \(\gamma\upharpoonright p\), the restriction of \(\gamma\) to \(p\), as the term or formula obtained by substituting every occurrence of a symbol \(c\in |C|\) by \(c\upharpoonright p\).

Definition 37. (cf[59], Definition 1.20) Let \(L\) be a first order language with equality over \(\Omega\). \(M\) is an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\)* or a presheaf of \(L\)-structures over \(\Omega\) if it is a presheaf over \(\Omega\) and there is \[\begin{align} & a characteristic function [R(.)]_M:|M|^n\longrightarrow \Omega for every R\in \mathop{\mathrm{rel}}(n,L),\\ & a presheaf morphism f^M:M^n \longrightarrow M for every f\in \mathop{\mathrm{fun}}(n,L), and\\ & a presheaf morphism \cdot^M : C\longrightarrow |M|, with \cdot^M:c \longrightarrow {\mathfrak c}^M. \end{align}\] Note that the equality symbol in \(L\) is interpreted by \([.=.]_M\).*

In the interests of conciseness we refer the reader to [51], [78], [59], [74] and [75] for examples of \(L\)-structures and the other concepts introduced in this section.

Proposition 24. Let \(L\) be a first order language with equality over \(\Omega\) and let \(\kappa\) be an infinite cardinal. The collection of isomorphism types of \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) with density \(\kappa\) is a set (and not a proper class). Hence the collection of isomorphism types of subsets of \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) with density \(\kappa\) is also a set (and not a proper class).

Proof. For any \(L\)-structure \(M\) in \(\mathop{\mathrm{pSh}}({\Omega})\) with \(d(M)=\kappa\), by Proposition (20), the size of \(M\) is at most \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}^\kappa\). The possible isomorphism types now depends on the ways of assigning the appropriate structure to the set. This depends on \(L\) and \(\Omega\), but there is some cardinal bound on the number of ways of doing so. ◻

A much more crude, but still useful, result is the following

Proposition 25. Let \(L\) be a first order language with equality over \(\Omega\) and suppose \(\lambda\) is a strongly inaccessible cardinal. The collection of isomorphism types of \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) with density less than \(\lambda\) is a set (rather than a proper class). Hence the collection of isomorphism types of subsets of \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) with density less than \(\lambda\) is also a set (rather than a proper class).

Proof. Immediate, since, by Proposition (20), if \(M\in \mathop{\mathrm{pSh}}({\Omega})\) then \(d(M)<\lambda\) if and only if \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{M}\hfil\crcr}}}\hfil\crcr}}<\lambda\). ◻

We now define the interpretation of terms in \(L\)-structures. Earlier treatments of the details of interpretation were somewhat cavalier and below we need to work closely with the definitions. Consequently, we give here (what we hope is) a rigorous account.

In classical model theory there are a number of ways of defining how terms are interpreted in structures. At the heart of the matter is systematically replacing the free variables by elements of the structure. However, one has to make provision for how a term could later be used in the process of generating another, more complex, term or a formula. So, one has to set up a regime under which variables which are not mentioned in the term can be later interpreted. There are various ways to do this.

One, attractive, way to set up how terms are interpreted in structures is used in [79]. They define the interpretation of a term under an assignment of all of the variables. In one way this is an extremely clean procedure: if one’s structure is \(M\) one simply has one function \(\tau^M:M^{\omega}\longrightarrow M\) for each term \(\tau\), defined by induction on the complexity of \(\tau\). However, there is a small set theoretic price to be paid as one ends up with \(\tau^M\) having domain of size \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{M}\hfil\crcr}}}\hfil\crcr}}^\omega\).

It is possibly because other authors prefer to end up with something with domain of size \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{M}\hfil\crcr}}}\hfil\crcr}}\) that other approaches are more prevelant. However, these too have a cost, this time in terms of keeping track of how a chain of increasing finite assignments of variables to elements of the model cohere with each other. Again there are choices.

A finitary version of the approach in [79] is to define functions for all assignements of the first \(k\) variables where \(k\) is greater than or equal to the largest index of a variable appearing in the term. This is at least relatively simple conceptually. It is this approach we generalize. However, initially one only has a function assigning exactly the variables appearing in a term if these happen to be precisely the variables with indices less than \(k\) for some \(k\in \omega\). So an auxiliary definition is required to allow us to obtain functions of the same arity as the number of variables appearing in the term.

Other approaches allow immediately for assignment of exactly the variables occuring in the term. However, the plethora of all possible finite supersets then has to be taken into account.

Clearly, either way one ends up with countably many functions from a set of size the cardinality of \(M\) into \(M\). Nevertheless, the questions of coherence appear to us to be harder to visualize in the second approach. (Although, the proofs of coherence are not, in fact, so difficult.)

The definitions we give here are similar to one of the classical definitions just outlined, but with the twist that for closed terms we need a function from \(\Omega\) to \(M\) rather than a function from \(\{\hskip 1pt\emptyset\hskip 1pt\}\) to \(M\) – or, equivalently, the choice of a single element of \(M\).

At this point we recall Notation ([defn95M940]), that whenever \(M\) be an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) we set \(M^0 = \Omega\).

The analogous convention in the classical model theoretic set-up is that \(M^0\) is a set of size \(1\) (rather than being the empty set as one might imagine if trying to mechanically apply the definition of \(M^n\) for \(n>0\) to the case \(n=0\)). From a category theoretic point of view, while \(\Omega\), as shown in Proposition (8), is the terminal object in the category \(\mathop{\mathrm{pSh}}({\Omega})\), a set of size \(1\) is terminal in the category of sets.

Definition 38. Let \(L\) be a first order language with equality over \(\Omega\) and \(M\) be an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). For each term \(\tau\) we define for each \(n \ge k(\tau)\) a presheaf morphism \(\tau^M: M^n\upharpoonright E\tau \longrightarrow M\upharpoonright E\tau\). \(\tau^M\) is the interpretation of \(\tau\) in \(M\). The definition is by induction on the complexity of terms.

  • If \(\tau\) is a variable \(v_i\), then \(E\tau = \top\) and for all \(a\in M^n\) we set \(\tau^M(\bar{a})=v_i^M (\bar{a}) = a_i\).

  • If \(\tau\) is some \(c \in |C|\) then for every \(\bar{a}\in M^n\upharpoonright E\tau\) we set \(c^M(\bar{a}) = {\mathfrak c}^M\upharpoonright E\bar{a}\). (In fact we could make this definition for all \(\bar{a} \in M^n\).)

  • If \(\tau_0\), …\(\tau_{m-1}\) are terms in \(L\), \(f \in \mathop{\mathrm{fun}}(m, L)\) and \(\tau = f(\tau_0, \dots , \tau_{m-1})\), then for all \(n \ge k(\tau_0,\dots,\tau_{m-1})\) since \(E\bar{a} \le E\tau = E\tau_0\wedge \dots\wedge E\tau_{m-1}\) we have and thus we can set \[\tau^M (\bar{a}) = f^M(\tau_0^M(\bar{a}), \dots , \tau_{m-1}^M(\bar{a})) .\]

Note that, consequent to Notation ([defn95M940]), in the second clause and in the third clause if \(k(\tau_0,\dots,\tau_{m-1})=0\), when \(n=0\) we have that “\(\bar{a}\)” is an element of \(M^0 = \Omega\) and (so) \(E\bar{a} = \bar{a}\).

In order to see that the third clause of this definition is legitimate we must check, since \(\mathop{\mathrm{dom}}(f^M)=M^n\), that \(E\tau_0^M(\bar{a})= \dots = E\tau_{m-1}^M(\bar{a})\).

In order to show this we prove the following lemma follows by induction from the first two clauses of definition.

Lemma 26. Let \(\tau\) be a term in \(L\) as in the statement of the definition. For all \(\bar{a}\in M^n \upharpoonright E\tau\) we have \(E\tau^M(\bar{a}) = E\bar{a}\).**

**Proof.* If \(\tau\) is a variable \(v_i\) we have \(E\tau^M(\bar{a}) = Ea_i = E\bar{a}\).*

If \(\tau\) is a constant \(c\in |C|\) we have \(E c^M(\bar{a}) = E({\mathfrak c}^M\upharpoonright E\bar{a}) = E{\mathfrak c}^M\wedge E\bar{a} = E^Cc\wedge E\bar{a} = E\tau\wedge E\bar{a} = E\bar{a}\), since \(\cdot:C\longrightarrow M\) is a presheaf morphism.

Finally, if \(\tau_0\), …\(\tau_{m-1}\) are terms in \(L\), \(f \in \mathop{\mathrm{fun}}(m, L)\) and \(\tau = f(\tau_0, \dots , \tau_{m-1})\), and if, by induction, \(E\tau_0^M(\bar{a})= \dots = E\tau_{m-1}^M(\bar{a}) = E\bar{a}\), we have \[E\tau^M (\bar{a}) = Ef^M(\tau_0^M(\bar{a}), \dots , \tau_{m-1}^M(\bar{a})) = E\bar{a} ,\] since \(f^M\) is a presheaf morphism. ◻

Moreoever, by a similar inductive proof, in each case \(\tau^M\) commutes with restrictions.

Lemma 27. Let \(\tau\) be a term in \(L\) as in the statement of the definition, \(\bar{a}\in M^n \upharpoonright E\tau\) and \(p\in \Omega\). Then \(\tau^M(\bar{a})\upharpoonright p = \tau^M(\bar{a}\upharpoonright p)\).**

**Proof.* If \(\tau\) is a variable \(v_i\) we have \[\tau^M(\bar{a})\upharpoonright p = v_i^M(\bar{a})\upharpoonright p = a_i\upharpoonright p = v_i^M(\bar{a}\upharpoonright p)=\tau^M(\bar{a}\upharpoonright p).\]*

If \(\tau\) is a constant \(c\in |C|\) we have \[c^M(\bar{a}) \upharpoonright p =( {\mathfrak c}^M\upharpoonright E\bar{a}) \upharpoonright p = {\mathfrak c}^M\upharpoonright E\bar{a}\land p = ( {\mathfrak c}^M\upharpoonright p) \upharpoonright E\bar{a} = c^M(\bar{a} \upharpoonright p) .\]

Finally, if \(\tau_0\), …\(\tau_{m-1}\) are terms in \(L\), \(f \in \mathop{\mathrm{fun}}(m, L)\) and \(\tau = f(\tau_0, \dots , \tau_{m-1})\), and if, by induction, for each \(i<n\) we have \(\tau_i^M(\bar{a})\upharpoonright p = \tau_i^M(\bar{a}\upharpoonright p)\) \[\begin{align} \tau^M (\bar{a}) \upharpoonright p & = f^M(\tau_0^M(\bar{a}), \dots , \tau_{m-1}^M(\bar{a})) \upharpoonright p = f^M(\tau_0^M(\bar{a})\upharpoonright p, \dots , \tau_{m-1}^M(\bar{a}) \upharpoonright p) \\ & = f^M(\tau_0^M(\bar{a}\upharpoonright p), \dots , \tau_{m-1}^M(\bar{a} \upharpoonright p)) = \tau^M (\bar{a} \upharpoonright p) , \end{align}\] where the second equality holds since \(f^M\) is a presheaf morphism. ◻

So we have shown that each \(\tau^M\) is a presheaf morphism.

Now let \(v(\tau)\le n\le k(\tau)\) and let \(\iota:n \longrightarrow k(\tau)\), \(\iota:j\mapsto i_j\), be any increasing function such that \(\mathop{\mathrm{FV}}(\tau) \subseteq \{\hskip 1ptv_{i_j}\hskip 2pt:\hskip 2ptj<n\hskip 1pt\} \subseteq \{\hskip 1ptv_l\hskip 2pt:\hskip 2ptl<k(\tau)\hskip 1pt\}\). Define a presheaf morphism \(\tau_\iota^M: M^n\upharpoonright E\tau \longrightarrow M\upharpoonright E\tau\) by \(\tau_\iota^M(\bar{a})=\tau^M(\bar{a}) = \tau^M(\bar{b})\) where \(b\in M^{k(\tau)}\upharpoonright E\tau\) is any sequence from \(M\upharpoonright E\tau\) such that for all \(e<n\) we have \(b_{\iota(e)} = a_e\).

Lemma 28. The definition of the \(\tau_{\iota}^M\) is a good one.

Proof. This is immediate from the three clause definition for the presheaf morphism \(\tau^M:M^{k(\tau)}\upharpoonright E\tau\longrightarrow M\upharpoonright E\tau\). ◻

Note that without its penultimate paragraph this definition would only treat \(n \ge k(\tau)\). For comparison we give a analogue of Marker’s definition for classical model theory from [77]. In this definition an auxiliary clause (here given by the paragraph starting “Furthermore” below) is also essential, in this case in order for the definition of the interpretation of a composition of terms under a function to work correctly.

Definition 39. Let \(L\) be a first order language with equality over \(\Omega\) and \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). Let \(\tau\) be a term with \(\mathop{\mathrm{FV}}(\tau)=\{\hskip 1ptv_{i_0},\dots,v_{i_{n-1}}\hskip 1pt\}\). We define a presheaf morphism \(\tau^M_*\), the interpretation of \(\tau\) in \(M\), with \({\tau^M_*: M^{v(\tau)}\upharpoonright E\tau \longrightarrow M\upharpoonright E\tau}\). The definition is again by induction on the complexity of terms. Let \(\bar{a} = \{\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\}\).

  • If \(\tau\) is a variable \(v_{i_j}\), then \(E\tau = \top\) and \(\tau^M_*(\bar{a})=v_{i_j}^M (\bar{a}) = a_j\).

  • If \(\tau\) is some \(c \in |C|\), then for every \(p \in M^0\), \(= \Omega\) with \(p\le Ec\) we set \(c^M_*(p) = {\mathfrak c}^M\upharpoonright p\).

  • If \(\tau_0\), …\(\tau_{m-1}\) are terms in \(L\), \(f \in \mathop{\mathrm{fun}}(m, L)\) and \(\tau = f(\tau_0, \dots , \tau_{m-1})\), then if \(k(\tau)\ne 0\) we set \(\tau^M_* (\bar{a}) = f^M(\tau_{0*}^M(\bar{a}), \dots , \tau^M_{m-1*}(\bar{a}))\), and if the \(\tau_i\) are all closed terms (i.e. \(v(\tau_0,\dots,\tau_{m-1})=0\)) and \(p\in \Omega\) is such that \(p\le E\tau\) then we set \(\tau^M_* (p) = f^M(\tau_{0*}^M(p), \dots , \tau_{m-1*}^M(p))\).

Furthermore, for every \(k>v(\tau)\) and every order-preserving injection \(\iota\) of \(v(\tau)\) into \(k\) we define a presheaf morphism \(\tau_{*\iota}^M = \tau^M_*: M^{k}\upharpoonright E\tau \longrightarrow M\upharpoonright E\tau\) as follows:

  • If \(v(\tau)=0\) then \(\bar{a}\in M^k\upharpoonright E\tau\) we set \(c^M_*(\bar{a}) = {\mathfrak c}^M\upharpoonright E\bar{a}\).

  • If \(v(\tau)\ne 0\) then \(\tau_{*\iota}^M(\bar{a}) = \tau^M_*(\langle\hskip 1pta_j\hskip 2pt:\hskip 2ptj\in rge(\iota)\hskip 1pt\rangle)\upharpoonright E\bar{a}\).

The upshot of this is that (under either approach) we have defined enough presheaf morphisms to allow us to use \(\tau^M\) (or \(\tau^M_*\)) to refer both to an instantiation of \(\tau\) in \(M\) using a minimal set of elements of \(M\) and to instantiations using non-minimal sets of elements of \(M\) giving us flexibility to compose terms.

Our official definition will be to use \(\tau^M\), although everything would work fine using \(\tau^M_*\) instead.

Now we define the interpretation of formulae in \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). Each formula’s interpretation will be a characteristic function.

In order to give this definition it is helpful to have some notation for dealing with instantiations of variables appearing in subformulae of formulae.

Let \(L\) be a first order language with equality over \(\Omega\) and \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). Suppose \(j:m\longrightarrow n\) is an increasing function, \(\bar{a}\in M^n\) and \(\psi(v_{i_{j(0)}},\dots,v_{i_{j(m-1)}})\), \(=\psi(\bar{v}')\), is a subformula of \(\phi(v_{i_0},\dots,v_{i_{n-1}})\), \(=\phi(\bar{v})\). Write \(\bar{a}_{\psi(\bar{v}')}\) for \(\langle\hskip 1pta_{j(l)}\hskip 2pt:\hskip 2ptl<m\hskip 1pt\rangle\), and where there is no confusion abbreviate \(\bar{a}_{\psi(\bar{v}')}\) as \(\bar{a}_\psi\).

Definition 40. Let \(L\) be a first order language with equality over \(\Omega\) and let \(M\) be an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). We associate to each formula \(\phi(\bar{v})\) in \(L\) with \(n\)-many free variables, where \(n\ge 1\) a characteristic function \([\phi(.)]_M : |M|^n \longrightarrow \Omega\), the interpretation of \(\phi\) in \(M\). We at the same time associate to each formula \(\phi\) in \(L\) with no free variables a valuation in \(\Omega\) - in this \(n=0\)-case the reader should simply ignore all mentions of \(\bar{v}\) and \(\bar{a}\). This definition is also by induction on complexity.

  • If \(\tau_0 (\bar{v} )\), \(\tau_{1}(\bar{v})\) are terms in \(L\), and letting \(p= E\tau_0\wedge E\tau_1\), then \[[ (\tau_0 (\bar{v} ) = \tau_{1}(\bar{v}))(\bar{a})]_M = [\tau_0^M(\bar{a}\upharpoonright p ) = \tau_{1}^M(\bar{a}\upharpoonright p)]_M .\]

  • If \(\tau_0 (\bar{v} )\), …, \(\tau_{m-1}(\bar{v})\) are terms in \(L\), \(q= E\tau_0\wedge\dots\wedge E\tau_{m-1}\) and \(R\in \mathop{\mathrm{rel}}(m,L)\) then \[\qquad\qquad [R(\tau_0 (\bar{v}) ,\dots, \tau_{m-1}(\bar{v}))(\bar{a})]_M = [R(\tau_0^M(\bar{a}\upharpoonright q) , \dots, \tau_{m-1}^M(\bar{a}\upharpoonright q))]_M.\]

  • If \(\phi\) is a formula then \[[\neg \phi(\bar{a})]_M = E\phi \wedge E\bar{a} \wedge \neg [\phi(\bar{a}\upharpoonright E\phi )]_M\]

  • If \(\phi\), \(\psi\) are formulae with \(q = E\phi \wedge E\psi\), then for \(\diamondsuit \in \{\hskip 1pt\land, \lor,\longrightarrow\hskip 1pt\}\) \[[(\phi \hskip 2pt\diamondsuit\hskip 1pt\psi)(\bar{a})]_M = q \wedge E\bar{a} \wedge ( [\phi(\bar{a}_\phi\upharpoonright q )]_M \hskip 2pt\hskip 2pt\diamondsuit\hskip 2pt\hskip 2pt[\psi(\bar{a}_\psi\upharpoonright q )]_M ) .\]

  • \([\exists x\phi(x, \bar{a})]_M = \bigvee_{t\in |M|} [\phi(t, \bar{a})]_M\).

  • \([\forall x\phi(x, \bar{a})]_M = E\phi \wedge E\bar{a} \wedge \bigwedge_{t\in |M|}( Et \longrightarrow [\phi(t, \bar{a})]_M)\).

The reader should note the asymmetry between clauses for existential and universal quantification in this (inductive) definition. The definition of interpretation of the universal quantifier combined with the definition of ‘\(\longrightarrow\)’ in \(\Omega\) shows we take \[[\forall x\phi(x, \bar{a})]_M = E\phi \wedge E\bar{a} \wedge \bigwedge_{t\in |M|}( \bigvee\{\hskip 1pt p \in \Omega \hskip 2pt:\hskip 2pt p \land Et \le [\phi(t, \bar{a})]_M \hskip 1pt\} ).\]

When we work with \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) we always have that there is a (unique) section with extent \(\bot\), which can be obtained as \(t\upharpoonright\bot\) for any \(t\in |M|\). Consequently, for any \(\phi(x,\bar{a})\) we have \(\bigwedge_{t\in |M|} [\phi(t, \bar{a})]_M = \bot\). The ‘\(Et\longrightarrow\)’ obviates this and comparable problems.

On the other hand, for any \(\phi(x,\bar{a})\) and \(t\) with \(Et=\top\) we have \[Et \longrightarrow [\phi(t, \bar{a})]_M = \top \longrightarrow [\phi(t, \bar{a})]_M = [\phi(t, \bar{a})]_M .\] Thus, if \(\Omega\) is the two element complete Heyting algebra \(\{\hskip 1pt\bot,\top\hskip 1pt\}\), we recover the usual interpretation of universal quantification in classical model theory, since then \[[\forall x\phi(x, \bar{a})]_M = \bigwedge_{t\in |M| \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptEt\ne \bot} [\phi(t, \bar{a})]_M ,\] and so the definition is an appropriate generalization of the classical one.

Note, also, the contrast with the recent preprint of Chen, [80], where he takes \(\forall x\) as an abbreviation for \(\neg \exists x\neg\). This gives a strikingly different framework.9

Lemma 29. Let \(L\) be a first order language with equality over \(\Omega\), \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) and \(\phi\) a formula in \(L\) with \(n\)-many free variables. If \(n\ge 1\) and \(\bar{a}\in |M|^n\) then \([\phi(\bar{a})]_M \le E\phi \wedge E\bar{a}\). If \(n=0\) then \([\phi]_M \le E\phi\).

Proof. The proof is by induction on the complexity of formulae. We start with atomic formulae. If \(\tau_0\) and \(\tau_1\) are terms and \(\phi\) is the formula \(\tau_0=\tau_1\) and we set \(p=E\tau_0\wedge E\tau_1\) and note that \(p = E(\tau_0 = \tau_1)\) by definition, we have \[\begin{align} & [(\tau_0 = \tau_1)(\bar{a})]_M = [\tau_0^M(\bar{a}\upharpoonright p) = \tau_1^M(\bar{a}\upharpoonright p)]_M = [\tau_0^M(\bar{a})\upharpoonright p = \tau_1^M(\bar{a})\upharpoonright p]_M \\ & \hskip 2pt\hskip 2pt= \bigvee \{\hskip 1ptE(\tau^M_0(\bar{a} \upharpoonright p \wedge q) )\hskip 2pt:\hskip 2ptq\in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt \tau^M_0(\bar{a}) \upharpoonright p \wedge q = \tau^M_1(\bar{a}) \upharpoonright p \wedge q\hskip 1pt\} \\ & \hskip 2pt\hskip 2pt= \bigvee \{\hskip 1ptE\bar{a}\wedge p \wedge q \hskip 2pt:\hskip 2pt \tau^M_0(\bar{a}) \upharpoonright p \wedge q = \tau^M_1(\bar{a}) \upharpoonright p \wedge q\hskip 1pt\} \le E\bar{a},\hskip 2pt\hskip 2ptp \end{align}\]where the final equality holds because the \(\tau_i^M\) are presheaf morphisms.

Similarly, if \(R\) is a relation and \(\tau_0\), …\(\tau_{m-1}\) are terms with \(q = \bigwedge_{i<m} E\tau_i\), \(= E(R(\tau_0,\dots,\tau_{m-1}))\), since \([R(.)]_M\) is a characteristic function we have \[\begin{align} & [R(\tau_0^M(\bar{a}\upharpoonright q),\dots,\tau_{m-1}^M(\bar{a}\upharpoonright q))]_M \le E\bar{a}\upharpoonright q = Ea \wedge q. \end{align}\]

The inductive steps for the binary connectives, negation and universal quantification are all immediate as the required result is explicit in the definition of interpretation of formulae.

Finally, for the inductive step for existential quantification we have \[[\exists x\phi(x, \bar{a})]_M = \bigvee_{t\in |M|} [\phi(t, \bar{a})]_M \le \bigvee_{t\in |M|} Et \wedge E\phi \wedge E\bar{a} \le E\phi \wedge E\bar{a},\] where the first inequality is given by applying the inductive hypothesis to \(\phi\) and \(t\kern-.25pt\raise 4pt\frown\kern-.25pt\bar{a}\). ◻

We make a small, but useful, observation on substitution in the interpretation of equality of terms.

Lemma 30.

Let \(\bar{v} = \langle\hskip 1ptv_0, \ldots, v_{n-1}\hskip 1pt\rangle\) be variables and let \(\tau( \bar {v})\), \(\sigma( \bar {v})\) be \(L\)-terms. Let \(M \in pSh(\Omega, L)\), with \(\bar{a} = \langle\hskip 1pta_0, \ldots, a_{n-1}\hskip 1pt\rangle\), \(\bar{b}=\langle\hskip 1pt b_0, \ldots, b_{n-1}\hskip 1pt\rangle \in {^n|M \upharpoonright E\tau \wedge E\sigma| }\). Then \[[\bar{a} = \bar{b}]_M \wedge [ \sigma^M (\bar{a}) = \tau^M (\bar{a})]_M = [\bar{a} = \bar{b}]_M \wedge [ \sigma^M (\bar{b}) = \tau^M (\bar{b})]_M .\]

Particularly, \([\bar a = \bar b]_M \wedge [ \sigma^M (\bar{a}) = \tau^M (\bar{a})]_M \leq [ \sigma^M (\bar{b}) = \tau^M (\bar{b})]_M\).

Proof. Set \(q= [\bar{a} = \bar{b}]_M\) and \(\bar{a} \upharpoonright q\) for \(\langle\hskip 1pta_0 \upharpoonright q, \ldots, a_{n-1} \upharpoonright q\hskip 1pt\rangle\). For all \(i <n\) we have \(a_i \upharpoonright[a_i = b_i]_M = b_i \upharpoonright[a_i = b_i]_M\), so a fortiori we also have \(a_i \upharpoonright q = b_i \upharpoonright q\). Using this fact in the third equality and Lemma (26) in the second equality in the displayed equations following we have \[\begin{align} [\bar{a} = \bar{b}]_M \wedge [ \sigma^M (\bar{a}) = & \tau^M (\bar{a})]_M = [ \sigma^M (\bar{a}) = \tau^M (\bar{a}) \upharpoonright q]_M = \\ & [ \sigma^M (\bar{a}) = \tau^M (\bar{a} \upharpoonright q) ]_M = [ \sigma^M (\bar{b}) = \tau^M (\bar{b} \upharpoonright q) ]_M = \\ & [\bar{a} = \bar{b}]_M \wedge [ \sigma^M (\bar{b}) = \tau^M (\bar{b})]_M . \end{align}\] ◻

We can now define when a model forces an instantiation of a formula or models a sentence.

Definition 41. Let \(L\) be a first order language with equality over \(\Omega\), \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\), \(\phi(\bar{v})\) an \(L\)-formula and \(\bar{a}\in |M|^n\).

We say \(M\) forces* \(\phi\) at \(\bar{a}\), written \(M\Vdash \phi(\bar{a})\), if \([\phi(\bar{a})]_M = E\phi \wedge E\bar{a}\).*

If \(\phi\) is an \(L\)-sentence we thus have \(M\Vdash\phi\) if \([\phi]_M = E\phi\). In this case we say \(M\) models* \(\phi\), or is a model of \(\phi\).*

If \(\Lambda(\bar{v})\) is a set of \(L\)-formula with free variables in \(v_0,\dots,v_{n-1}\) and \(\bar{a}\in |M|^n\) then \(M\Vdash\Lambda(\bar{a})\) if \(M\Vdash\phi(\bar{a})\) for each \(\phi(\bar{v})\in \Lambda(\bar{v})\).

If \(\Lambda\) has no free variables we say \(M\) is a model of \(\Lambda\).

Trite Observation 1. For any \(L\) the set of all \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) is a model of the emtpy set of sentences (i.e., where we take \(\Lambda= \emptyset\)).

This observation allow us to talk exclusively about collections of models of theories or of sets of sentences, instead of \(L\)-structures more generally, without losing any generality.

That the forcing relation is closed under conjunction and disjunction follows from the definition of forcing.

Proposition 31. Let \(L\) be a first order language with equality over \(\Omega\), and \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). Let \(\phi\), \(\psi\) be \(L\)-formulae and \(\bar{a}\in |M|^n\).

If \(M\Vdash\phi(\bar{a}_\phi)\) and \(M\Vdash\psi(\bar{a}_\psi)\) then \(M\Vdash(\phi \lor \psi)(\bar{a})\) and \(M\Vdash(\phi \land \psi)(\bar{a})\).

Proof. Note, first of all, by Definition (35), we have \(E(\phi\land\psi) = E(\phi\lor \psi) = E\phi \wedge E\psi\). By the definition of interpretation, for \(\diamondsuit \in \{\hskip 1pt\land,\lor\hskip 1pt\}\), and letting \(q = E\phi \wedge E\psi\), we have \[[(\phi \hskip 2pt\diamondsuit\hskip 1pt\psi)(\bar{a})]_M = E\phi\wedge E\psi \wedge E\bar{a} \wedge ( [\phi(\bar{a}_\phi\upharpoonright q )]_M \hskip 2pt\hskip 2pt\diamondsuit\hskip 2pt\hskip 2pt[\psi(\bar{a}_\psi\upharpoonright q )]_M .\] By the definition of forcing we have \([\phi(\bar{a}_\phi)]_M = E\phi\wedge E\bar{a}_\phi\) and \([\psi(\bar{a}_\psi)]_M = E\psi\wedge E\bar{a}_\psi\).

For “\(\lor\)” we have \[\begin{align} [(\phi \hskip 2pt\lor\hskip 1pt\psi)(\bar{a})]_M & = E\phi\wedge E\psi \wedge E\bar{a} \wedge (E\phi\wedge E\bar{a}_\phi \lor E\psi\wedge E\bar{a}_\psi) \\ & = ( E\phi\wedge E\psi \wedge E\bar{a} \wedge (E\phi\wedge E\bar{a}_\phi)) \lor \\ & \qquad\qquad ( E\phi\wedge E\psi \wedge E\bar{a} \wedge (E\psi\wedge E\bar{a}_\psi )) \\ & = ( E\phi\wedge E\psi \wedge E\bar{a} ) \lor ( E\phi\wedge E\psi \wedge E\bar{a} ) \\ & = E\phi\wedge E\psi \wedge E\bar{a} = E(\phi\lor \psi) \wedge E\bar{a} \end{align}\]

Similarly, but more simply, for “\(\land\)” we have \[\begin{align} [(\phi \hskip 2pt\land\hskip 1pt\psi)(\bar{a})]_M & = E\phi\wedge E\psi \wedge E\bar{a} \wedge E\phi\wedge E\bar{a}_\phi \wedge E\psi\wedge E\bar{a}_\psi \\ & = E\phi\wedge E\psi \wedge E\bar{a} = E(\phi\wedge \psi) \wedge E\bar{a} . \end{align}\] ◻

However, while the forcing relation is closed more generally under intuitionistic logic, it not necessarily closed under classical logic.10 Consequently, when discussing which collections of sentences are forced by a model, it is reasonable to introduce classifications of formulae which do not rely on formulae being reducible to prenex normal form.

There are a number of hierarchies of formulae to be found in the literature. For the discussion of preservation theorems in the following sections it is convenient to use the class forming operations defined by Fleischmann ([82]) and we give a variant of one of Fleischmann’s hierarchies. For other approaches to stratification of the collection of first order formulae see, inter alia, [83], [84], [85] and [86].

For the following definitions let \(L\) be a first order language with equality over \(\Omega\).

Definition 42. ([82], Definition 3.2) Let \(\Gamma\) be a set of \(L\)-formulae. Define \({\mathcal{E}}\Gamma\) to be the closure of \(\Gamma\) under \(\land\), \(\lor\) and \(\exists\).

Definition 43. ([82], Definition 3.3) Let \(\Gamma\), \(\Psi\) be a set of \(L\)-formulae. Define \({\mathcal{U}}(\Gamma,\Psi)\) to be the smallest set of formulae containing \(\Gamma\), closed under \(\land\), \(\lor\) and \(\forall\) and such that if \(\psi\in \Psi\) and \(\phi\in {\mathcal{U}}(\Gamma,\Psi)\) then \(\psi\longrightarrow \phi \in {\mathcal{U}}(\Gamma,\Psi)\).

Definition 44. Let \(\Delta_0\) be the set of quantifier free \(L\)-formulae. Set \({\mathcal{E}}_0={\mathcal{U}}_0=\Delta_0\). For \(n<\omega\) let \({\mathcal{E}}_{n+1} = {\mathcal{E}}{\mathcal{U}}_n\) and \({\mathcal{U}}_{n+1} = {\mathcal{U}}({\mathcal{E}}_n,{\mathcal{E}}_n)\).

Definition 45. Let \({\mathcal{E}}^+_{1}\) be \({\mathcal{E}}Atomic\), the positive existential formulae.

Definition 46. Let \(\forall{\mathcal{E}}_{1} = \{\hskip 1pt\forall \bar{x}\hskip 2pt\phi(\bar{x})\hskip 2pt:\hskip 2pt\phi(\bar{x})\in {\mathcal{E}}_{1}\hskip 1pt\}\).

We now unpack the definition of forcing to show what is required for a model to force a \(\forall{\mathcal{E}}_{1}\) sentence. We will later use this example in the course of proving an analogue of Tarski’s classical theorem on the preservation of \(\forall_2\)-sentences under unions of chains (see, e.g., [87], Theorem (2.4.4)).

Proposition 32. Let \(L\) be a first order language with equality over \(\Omega\), \(N\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\), \(\phi(\bar{x},\bar{y})\) a formula in \({\mathcal{E}}_{1}\) with free variables \(\bar{x}\kern-.25pt\raise 4pt\frown\kern-.25pt\bar{y}\) and \(\bar{a}\in |N|^m\). Then \[N\Vdash\forall \bar{x} \hskip 2pt\hskip 2pt\phi(\bar{x},\bar{a}) if and only if\hskip 2pt\hskip 2pt\forall \bar{b}\in |N|^n \hskip 2pt\hskip 2ptE\phi \wedge E\bar{a} \wedge E\bar{b} \hskip 2pt\hskip 2pt\le [\phi(\bar{b},\bar{a})]_N .\]

Proof. \(N\Vdash\forall \bar{x}\hskip 2pt\phi(\bar{x},\bar{a})\) if and only if \([\forall \bar{x}\hskip 2pt\phi(\bar{x},\bar{a})]_N = E\phi \land E\bar{a}\), by the definition of \(\Vdash\), where, \(E\phi = \bigwedge\{\hskip 1ptE^{C}c\hskip 2pt:\hskip 2ptc\in C \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptc appears in \phi\hskip 1pt\}\), by Definition (35).

Applying the inductive definition of interpretation of formulae we have \[[\forall \bar{x}\hskip 2pt\phi(\bar{x},\bar{a})]_N = E\phi \wedge E\bar{a}\wedge \bigwedge_{\bar{b}\in |N|^n} (E\bar{b} \longrightarrow [\phi(\bar{b},\bar{a})]_N) .\] Thus \(N\Vdash\forall \bar{x}\hskip 2pt\phi(\bar{x},\bar{a})\) if and only if \(\hskip 2pt\forall\bar{b}\in |N|^n \hskip 2pt(E\phi \wedge E\bar{a} \le E\bar{b} \longrightarrow [\phi(\bar{b},\bar{a})]_N )\). The latter holds if and only if \(\hskip 2pt\forall\bar{b}\in |N|^n \hskip 2pt(E\phi \wedge E\bar{a} \wedge E\bar{b} \le [\phi(\bar{b},\bar{a})]_N )\), by Lemma (1). ◻

We define six separate notions of morphism of presheafs (and of sheafs), recapitulating the first two from Definitions (13) and (17).

Definition 47. Let \(L\) be a first-order language with equality over \(\Omega\). Let \(M\), \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). Let \(f:|M|\longrightarrow |N|\).

\(f\) is a presheaf morphism* if for all \(a\in |M|\) and \(p\in \Omega\) we have \[E^N f(a) = E^M a \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptf(a\upharpoonright p) = f(a)\upharpoonright p.\]*

If \(f\) is a presheaf morphism it is a presheaf monomorphism* if additionally \(f:|M|\longrightarrow |N|\) is injective. If \(f\) is a presheaf morphism and \(\bar{a}=\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\in |M|^n\) write \(f``\bar{a}\) for \(\langle\hskip 1ptf(a_0),\dots,f(a_{n-1})\hskip 1pt\rangle\).*

\(f\) is a \({L}\)-morphism* if it is a presheaf morphism and for every \(n \geq 1\) and*

  • for all \(n\)-ary relations \(R\) in \(L\) and \(\bar{a} = \langle\hskip 1pta_1,\dots a_n\hskip 1pt\rangle \in |M|^n\) we have \[[R(\bar{a})]_M \leq [R(f``\bar{a})]_N ,\]

  • for all \(n\)-ary functions \(\omega\) in \(L\) and \(\bar{a} = \langle\hskip 1pta_1,\dots a_n\hskip 1pt\rangle \in M^n\) we have \[f ( \omega^{M}(\bar{a})) = \omega^{N}(f``\bar{a}) ,\]

  • for all constants \(c\) in \(L\) we have \(f({\mathfrak c}^M) = {\mathfrak c}^N\).

\(f\) is a weak \(L\)-monomorphism* if it is an \(L\)-morphism and for every \(n \geq 1\), \(n\)-ary relation \(R\) in \(L\) and \(\bar{a} \in |M|^n\) we have \(\neg \neg [R(\bar{a})]_M\;= \neg\neg [R(f``\bar{a})]_N\).*

\(f\) is an \({L}\)-monomorphism* or \(L\)-embedding if it is a presheaf monomorphism, it is an \(L\)-morphism and for every \(n \geq 1\), \(n\)-ary relation \(R\) in \(L\) and \(\bar{a} \in |M|^n\) we have \([R(\bar{a})]_M\;= [R(f(\bar{a}))]_N\).*

\(f\) is an elementary \({L}\)-monomorphism* or elementary \({L}\)-embedding if \(f\) is a \(L\)-morphism and for every \(L\)-formula \(\phi(v_0,\dots,v_{n-1})\) and \(\bar{a} \in |M|^n\) we have \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\).*

We refer to these morphisms as being of type \(x\) where \(x\) is one of ‘psh’, ‘psh-mono’, ‘\(L\)’, ‘wk-\(L\)-mono’, ‘\(L\)-mono’ and ‘elt-\(L\)-emb.’

This is also a convenient place for us to define a generalization of the notions of \(L\)-monomorphism and elementary \(L\)-monomorphism. We start with the more widely applicable process of expanding a language \(L\) by adding names for elements an \(L\)-structure in the context of presheaves of models.

Definition 48. If \(M\) is an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) let \(\{\hskip 1pt\underaccent{\bar}{a}\hskip 2pt:\hskip 2pta\in |M|\hskip 1pt\}\) be a presheaf of new constant symbols, with a distinct symbol for each element of \(|M|\), such that for all \(a\in |M|\) and \(p\in\Omega\) we have \(\underaccent{\bar}{a}\upharpoonright p = \underline{a\upharpoonright p}\). Equivalentely, the map \(a\mapsto \underaccent{\bar}{a}\) is a presheaf isomorphism. Let \(L_M = L \cup\{\hskip 1pt\underaccent{\bar}{a}\hskip 2pt:\hskip 2pta\in |M|\hskip 1pt\}\) and define \(\tilde{M} = (M,a)_{a\in |M|}\), the natural expansion of \(M\) to an \(L_M\)-structure, where for each \(a\in |M|\) we have \(\underaccent{\bar}{a}^{\tilde{M}} =a\).

If \(N\) is another \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) and \(f:M\longrightarrow N\) is a presheaf morphism let \(\tilde{N}= (N,f(a))_{a\in |M|})\), where for each \(a\in |M|\) we have \(\underaccent{\bar}{a}^{\tilde{N}} =f(a)\).

The following lemma gives a converse to the last part of Definition (48).

Lemma 33. If \(M\), \(N\) are \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) and \(\tilde{N} = (N,\underaccent{\bar}{a}^{\tilde{N}})_{a\in |M|}\) is an \(L_M\)-structure, then the map \(f:M\longrightarrow N\) given by \(f(\bar{a}) \mapsto \underaccent{\bar}{a}^{\tilde{N}}\) is a presheaf morphism.

Proof. The map given by \(\underaccent{\bar}{a} \mapsto \underaccent{\bar}{a}^{\tilde{N}}\) is a presheaf morphism by the definition of \(\tilde{N}\) being an \(L_M\)-structure, and the map given by \(\underaccent{\bar}{a}^{\tilde{M}} \mapsto \underaccent{\bar}{a}\) is a presheaf isomorphism by Definition (48). By the same definition, for all \(a\in |M|\) we have \(a = \underaccent{\bar}{a}^{\tilde{M}}\). Thus composing the morphisms gives a presheaf morphism from \(M\) to \(N\). ◻

Definition 49. Let \(M\in\mathop{\mathrm{pSh}}({\Omega})\) and let \(\Gamma\) be a class of \(L_M\) formulae. We say a presheaf morphism \(f:M\longrightarrow N\) is a \(\Gamma\)-\(L\)-monomorphism if for all \(\phi(\underaccent{\bar}{a}_0,\dots,\underaccent{\bar}{a}_{n-1})\in\Gamma\) we have \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\).

Observe, \(\Gamma\) being a set of \(L_M\)-sentences in this definition is simply a concise way of simultaneously specifying a class of \(L\)-formulae and for each element of the class a set of instantiations which we would like to consider.

In Definition (3.19) of [1] (and Definition (4.1) of [59]), the equivalent of \(f``\bar{a}\) is given the meaning \(\langle\hskip 1ptf(a_0)\upharpoonright E\bar{a},\dots,f(a_{n-1})\upharpoonright E\bar{a}\hskip 1pt\rangle\). We believe that usage to be less desirable than the one here, which is the one typical in mathematics more generally. However, in virtue of Lemma (22), none of the proofs of [1] are effected by the choice of either meaning of \(f``\bar{a}\).

Definition 50. Let \(L\) be a first order language with equality over \(\Omega\), and let \(M\), \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). If the inclusion map is an \(L\)-embedding we say \(M\) is an \({L}\)-substructure* of \(N\). If it is an elementary \(L\)-monomorphism we say \(M\) is an elementary \({L}\)-substructure of \(N\).*

In all cases, if \(L\) is clear from the context we may drop it from these names. So, for example, if \(L\) is clear from the context and the inclusion map is an \(L\)-embedding (resp. an elementary \(L\)-monomorphism) we say \(M\) is a substructure* of \(N\) (resp. elementary substructure of \(N\)).*

We have the analogue of the classical model theoretic notion of a substructure generated by a set of elements of a structure. We do use these notions here, but will do so in [88].

Definition 51. Let \(L\) be a first order language with equality over \(\Omega\), let \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) and suppose \(A\subseteq |M|\). Write for \(\lcurvyangle A \rcurvyangle\), the presheaf substructure of* \(M\) generated by \(A\): \(\lcurvyangle A \rcurvyangle^M = \bigcap\{\hskip 1ptQ\subseteq M\hskip 2pt:\hskip 2ptQ is an L-structure in \mathop{\mathrm{pSh}}({\Omega}) and A\subseteq |Q|\hskip 1pt\}\). If \(M\) is also a sheaf over \(\Omega\), write \(\lcurvyangle A \rcurvyangle^M_s\) for \(\bigcap\{\hskip 1ptQ\subseteq M\hskip 2pt:\hskip 2ptQ is a an L-structure in \mathop{{\mathrm{Sh}}}({\Omega}) and A\subseteq |Q|\hskip 1pt\}\), the sheaf substructure of \(M\) generated by \(A\). (Here we use the Lemma (14) to see that \(\lcurvyangle A \rcurvyangle\) really is a subpresheaf, resp., \(\lcurvyangle A \rcurvyangle_s\) a subsheaf.)*

We show this definition is unambiguous in the sense that going to larger ambient structures does not change the generated presheaf substructure or sheaf substructure, and thus the superscripts in the definition are superfluous.

Lemma 34. Let \(\Omega\) be a complete Heyting algebra, \(M\), \(N\) \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) over \(\Omega\), with \(M\) being a substructure of \(N\) and \(A\subseteq |M|\). Then \(\lcurvyangle A \rcurvyangle^M = \lcurvyangle A \rcurvyangle^N\). If \(M\), \(N\) are \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) over \(\Omega\), \(M\) is a subsheaf of \(N\) and \(A\subseteq |M|\) then \(\lcurvyangle A \rcurvyangle_s^M = \lcurvyangle A \rcurvyangle_s^N\).

Proof. In each case \(M\) is amongst the ’\(Q\)’s whose intersections are taken in the definition of \(\lcurvyangle A \rcurvyangle^N\) and \(\lcurvyangle A \rcurvyangle_s^N\) respectively in Definition (51). ◻

Let \(\Omega\) be a complete Heyting algebra, \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) over \(\Omega\) and \(A\subseteq |M|\). By Lemma (34), we simply write \(\lcurvyangle A \rcurvyangle\) for \(\lcurvyangle A \rcurvyangle^M\), and if \(M\) is an \(L\)-structures in \(\mathop{{\mathrm{Sh}}}({\Omega})\) over \(\Omega\) we write \(\lcurvyangle A \rcurvyangle_S\) for \(\lcurvyangle A \rcurvyangle_s^M\)

Proposition 35. Let \(\Omega\) be a complete Heyting algebra, \(M\) an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\) over \(\Omega\) and \(A\subseteq |M|\). Then \(|\lcurvyangle A \rcurvyangle| = \{\hskip 1pt\tau^M(\bar{a}\upharpoonright p)\hskip 2pt:\hskip 2pta\in {^nA} \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp \in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\tau is a term\hskip 1pt\}\).

If \(M\) is also a sheaf over \(\Omega\), then \[|\lcurvyangle A \rcurvyangle_s| = \{\hskip 1pt b \in M\hskip 2pt:\hskip 2ptbis the glueing of a set of compatible elements of |\lcurvyangle A \rcurvyangle|\hskip 1pt\} .\]

Proof. Clearly if \(A\subseteq |Q|\), where \(Q\) is an \(L\)-substructure in \(\mathop{\mathrm{pSh}}({\Omega})\) of \(M\), then \(P = \{\hskip 1pt\tau^M(\bar{a}\upharpoonright p)\hskip 2pt:\hskip 2pta\in {^nA} \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptp \in \Omega \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\tau is a term\hskip 1pt\} \subseteq |Q|\). Since the \(\tau^M\) are presheaf morphisms for each \(\bar{a}\in {^nA}\), \(p\), \(q\in \Omega\) and term \(\tau\) we have \(\tau^M(\bar{a}\upharpoonright p)\upharpoonright q = \tau^M(\bar{a}\upharpoonright p\land q)\in P\). Moreover, \(P\) is the underlying set of an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). Thus \(P=\lcurvyangle A \rcurvyangle\).

If \(M\) is a sheaf and \(Q\) is a subsheaf of \(M\) with \(A\subseteq |Q|\) then since \(Q\) is a subpresheaf of \(M\) we have \(|\lcurvyangle A \rcurvyangle|\subseteq |Q|\) and the glueing of every compatible set of elements of \(\lcurvyangle A \rcurvyangle\) is an element of \(Q\). However, clearly the set of glueings of a set of compatible elements of \(|\lcurvyangle A \rcurvyangle|\) is closed under further glueings.

We check that this set is closed under instantiation of terms.

Let \(\tau\) be a term. Suppose for each \(i<n\) that \({b_i}\) is the glueing of a compatible set \(C_i\) of elements of \(|\lcurvyangle A \rcurvyangle|\) and for all \(i<j<n\) we have \(Eb_i=Eb_j\), \(=p\), say, with \(p\le E\tau\). Since \(\bigvee_{a\in C_i} Ea = Eb_i = Eb_j = \bigvee_{a\in C_i} Eb_j\land Ea\) we may assume that for all \(i<j< n\) we have \(C_i=C_j\), \(=C\), say. Write \(\bar{b}\) for \(\langle\hskip 1ptb_0,\dots,b_{n-1}\hskip 1pt\rangle\). Now for \(a\) \(a'\in C\) we have \(E\tau^M(\bar{b})\upharpoonright Ea \land E\tau^M(\bar{b})\upharpoonright Ea' = p\land Ea \land p \land Ea' = Ea\land Ea'\). Moreover \[\begin{align} [\tau^M(\bar{b})\upharpoonright Ea = E\tau^M(\bar{b})\upharpoonright Ea'] = & Ea\land Ea'\land [\tau^M(\bar{b}) = E\tau^M(\bar{b})] \\ = & Ea\land Ea'\land p = Ea\land Ea'. \end{align}\] Thus \(\tau^M(\bar{b})\in \lcurvyangle A \rcurvyangle_s\). ◻

In Definition (22) we gave a definition of the presheaf generated by a set of element of a presheaf and of the sheaf genereated by a set of elements of a sheaf. These definitions can be thought of as the instance of Definition (51) in the case of \(L\) being the empty language with equality.

We now state and prove a result that will be important for our goals in §5.

Proposition 36. Let \(L\) be a first order language with equality over \(\Omega\). Suppose that \(M\), \(N\) and \(P\in \mathop{\mathrm{pSh}}({\Omega,L})\) (resp. \(\mathop{{\mathrm{Sh}}}({\Omega,L})\)), that \(|M| \subseteq |N| \subseteq |P|\). Then the following hold:

  1. If the inclusions \(N\hookrightarrow P\) and \(M\hookrightarrow P\) are presheaf morphisms then so is the inclusion \(M\hookrightarrow N\).

  2. If the inclusion \(N\hookrightarrow P\) is an \(L\)-monomorphism and the inclusion \(M\hookrightarrow P\) is an \(L\)-morphism, a weak \(L\)-monomorphism or an \(L\)-monomorphism then the inclusion \(M\hookrightarrow N\) is also, respectively, an \(L\)-morphism, a weak \(L\)-monomorphism or a \(L\)-monomorphism.

  3. If \(\Gamma\) is a class of \(L_M\)-formulae and the inclusions \(M\hookrightarrow P\) and \(N\hookrightarrow P\) are \(\Gamma\)-\(L\)-monomorpisms then the inclusion \(M\hookrightarrow N\) is also a \(\Gamma\)-\(L\)-monomorpism. In particular, if the inclusions \(M\hookrightarrow P\) and \(N\hookrightarrow P\) are elementary \(L\)-embeddings then the inclusion \(M\hookrightarrow N\) is also an elementary \(L\)-embedding.

Proof. First of all, suppose the inclusions \(M\hookrightarrow P\) and \(N\hookrightarrow P\) are a presheaf morphisms. Let \(a\in |M|\) and \(p\in \Omega\). By the former hypothesis we have \(E^Ma=E^Pa\) and \(a\upharpoonright^M p = a\upharpoonright^P p\); by the latter, since \(|N|\subseteq |P|\), \(E^Pa=E^Na\) and \(a\upharpoonright^P p = a\upharpoonright^N p\). Hence \(E^Ma=E^Na\) and \(a\upharpoonright^M p = a\upharpoonright^N p\), and thus the inclusion \(M\hookrightarrow N\) is also a presheaf morphism.

Now suppose \(N\hookrightarrow P\) is an \(L\)-monomorphism and \(M\hookrightarrow P\) is an \(L\)-morphism, a weak \(L\)-monomorphism or an \(L\)-monomorphism.

For the interpretation of constants and function symbols there is little to be proved. If \(c\) is a constant symbol in \(L\) then, since both inclusions into \(P\) are \(L\)-morphisms, we have \({\mathfrak c}^M = {\mathfrak c}^P = {\mathfrak c}^N\). If \(f\) is an \(n\)-ary function symbol in \(L\) and \(\bar{a}\in |M|^n\) then, again since both inclusions into \(P\) are \(L\)-morphisms, \(f^M(\bar{a}\upharpoonright E\bar{a}) = f^P(\bar{a}\upharpoonright E\bar{a}) = f^N(\bar{a}\upharpoonright E\bar{a})\).

Now suppose \(R\) is an \(n\)-ary relation symbol in \(L\) and \(\bar{a}\in |M|^n\). Since \(|M|^n\subseteq |N|^n\), we have \(\bar{a}\in |N|^n\) and so, since the inclusion of \(N\) into \(P\) is an \(L\)-monomorphism, \([R(\bar{a})]_N = [R(\bar{a}\upharpoonright E\bar{a})]_P\). Moreover, \([R(\bar{a})]_N = {[R(\bar{a}\upharpoonright E\bar{a})]_N}\), and \([R(\bar{a})]_P = [R(\bar{a}\upharpoonright E\bar{a})]_P\), by Lemma (22).

However, we also have \([R(\bar{a})]_M \le [R(\bar{a}\upharpoonright E\bar{a})]_P\), hence \([R(\bar{a})]_M \le [R(\bar{a})]_N = [R(\bar{a}\upharpoonright E\bar{a})]_N\). So \(M\hookrightarrow N\) is an \(L\)-morphism.

If \(\bar{a}\in |M|^n\), we may also have either \(\neg\neg [R(\bar{a})]_M = \neg\neg [R(\bar{a}\upharpoonright E\bar{a})]_P\) or \([R(\bar{a})]_M = [R(\bar{a}\upharpoonright E\bar{a})]_P\), depending on the case. In the first case we have \(\neg\neg [R(\bar{a})]_M = \neg\neg [R(\bar{a})]_N = \neg\neg [R(\bar{a}\upharpoonright E\bar{a})]_N\), and in the second \([R(\bar{a})]_M = [R(\bar{a})]_N = [R(\bar{a}\upharpoonright E\bar{a})]_N\). Hence, \(M\hookrightarrow N\) is a weak \(L\)-monomorphism or an \(L\)-monomorphism if \(M\hookrightarrow P\), respectively, is.

Lastly, suppose \(\Gamma\) is a class of \(L_M\)-formulae and \(M\hookrightarrow P\), \(N\hookrightarrow P\) are \(\Gamma\)-\(L\)-embeddings. Let \(\phi(\underaccent{\bar}{a}_0,\dots,\underaccent{\bar}{a}_{n-1})\in \Gamma\).

Since \(|M|\subseteq |N|\) and \(N\hookrightarrow P\) is an elementary, we have \([\phi(\bar{a})]_N = [\phi(\bar{a})]_P\).

By the hypotheses on \(M\hookrightarrow P\) we have \([\phi(\bar{a})]_M = [\phi(\bar{a})]_P\). Hence \([\phi(\bar{a})]_M = [\phi(\bar{a})]_N\), and we have \(M\hookrightarrow N\) is a \(\Gamma\)-\(L\)-monomorphism. ◻

For the remainder of the paper we fix \(L\) a first order language with equality over \(\Omega\),

3 Preservation phenomenon↩︎

We will be concerned below with the various types of morphisms between models of theories defined in the previous section. In particular, we will be concerned with situations in which we have a morphism \(f:M\longrightarrow N\) of presheaves and know \(M\Vdash T\) for some set of sentences \(T\) and want to know whether the further properties of \(f\), for example, being an \(L\)-morphism, an \(L\)-monomorphism and so on, ensure that \(N\Vdash T\) as well. We refer to a positive answer, generically, as a preservation phenomenon. In general a positive answer will depend on the properties of \(T\) as well as of the morphisms.

As a step to understanding preservation phenomena, we summarize some information from [1] about the preservation of sentences being forced under various types of morphisms. We restrict attention here initially to the case of sentences in the language \(L\) for which \(M\), \(N\in \mathop{\mathrm{pSh}}({\Omega})\) are \(L\)-structures. However, analogously to Theorems (54), (55) and (52) and Proposition (51) below, the full strength results of [1] treat the extended language \(L\cup\{\hskip 1pt\underaccent{\bar}{a}\hskip 2pt:\hskip 2pta\in |M|\hskip 1pt\}\) with additional constant symbols for each element of \(|M|\) and moreover give biconditional equivalents of various types of morphism.

Proposition 37. (See [1],§§4,5.) Suppose \(f:M\longrightarrow N\) is a presheaf morphism. Let \(\phi\) be a sentence in \(L\) and suppose \(M\Vdash\phi\). Let \(D\) be a dense set of elements of \(\Omega\). The following conditions are sufficient for us to conclude that \(N\Vdash\phi\) also.

condition on morphism \(f\) form of formula \(\phi\)
\(L\)-morphism (see Lemma (39)) atomic
weak \(L\)-monomorphism atomic or negation of atomic
\(L\)-monomorphism atomic or negation of atomic
elementary \(L\)-embedding arbitrary \(L\)-sentence

We next prove some lemmas concerning the preservation of interpretations of formulae under \(L\)-morphisms. The lemmas lead us ultimately to two results on \(L\)-monomorphisms which extend those of [1], Corollary (46) and Corollary (50). However, they will also be useful below in their own right.

Lemma 38. Suppose \(f:M\longrightarrow N\) is an \(L\)-morphism, \(\tau\) is a term and \(\tau^M\), \(\tau^N\) are interpretations of \(\tau\) in \(M\) and \(N\), respectively. If \(\bar{a}\in \mathop{\mathrm{dom}}( \tau^M)\) then \(f(\tau^M(\bar{a})) = \tau^N(f``\bar{a})\). If \(p\in \Omega\) is such that \(p\in \mathop{\mathrm{dom}}(\tau^M)\) then \(f(\tau^M(p)) = \tau^N(p)\).

Proof. We work by induction on the structure of \(\tau\) and so there are five cases to consider.

First of all, suppose \(\tau = v_i\) for some \(i\). Then we have \(\tau^N(f``\bar{a}) =f(a_i) = f(\tau^M(\bar{a}))\).

Secondly, suppose \(c\in |C|\). We have \(c^M(\bar{a}) = {\mathfrak c}^M\upharpoonright E\bar{a}\), \(c^N(\bar{a}) = {\mathfrak c}^N\upharpoonright E\bar{a}\) and by definition, since \(f\) is an \(L\)-morphism, \({\mathfrak c}^N = f({\mathfrak c}^M)\) and \(Ef``\bar{a}=E\bar{a}\). Hence \({\mathfrak c}^N\upharpoonright Ef``\bar{a} = f({\mathfrak c}^M)\upharpoonright Ef``\bar{a} = f({\mathfrak c}^M\upharpoonright E\bar{a})\).

Furthermore, if \(p\le Ec\) we have \(c^M(p) = {\mathfrak c}^M \upharpoonright p\), \(c^N(p) = {\mathfrak c}^N\upharpoonright p\) and \({\mathfrak c}^N\upharpoonright p = f({\mathfrak c}^M)\upharpoonright p = f({\mathfrak c}^M\upharpoonright p)\).

Fourthly, if \(\tau = g(\tau_0,\dots, \tau_{m-1})\) then, since \(f\) is an \(L\)-morphism, we have \[f(\tau^M(\bar{a})) = f( g^M(\tau_0^M(\bar{a}), \dots , \tau_{m-1}^M(\bar{a}) )) = g^N(f(\tau_0^M(\bar{a})), \dots, f(\tau_{m-1}^M(\bar{a}))).\] However, inductively, we have for each \(j<m\) that \(f(\tau_j^M(\bar{a})) = \tau_j^N(f``\bar{a})\), and hence we have that \(f(\tau^M(\bar{a})) = g^N(\tau_0^N(f``\bar{a}), \dots, \tau_{m-1}^M(f``\bar{a})) = \tau^N(f``\bar{a})\).

Finally, if the \(\tau_i\) are all closed terms then for \(p\le E\tau\) we have \(\tau^N (p) = g^N(\tau_0^N(p), \dots , \tau_{m-1}^N(p))\). Yet, for each \(j<m\) we have \(\tau^N_j(p) = f(\tau_j^M(p))\). So we have \[\begin{align} \tau^N (p)& = g^N(\tau_0^N(p), \dots , \tau_{m-1}^N(p)) = g^N(f(\tau_0^M(p),\dots,f(\tau_{m-1}^M(p))\\ & = f(g^M(\tau_0^M(p),\dots,\tau_{m-1}^M(p))) = f(\tau^M(p). \end{align}\] ◻

Lemma 39. Suppose \(f:M\longrightarrow N\) is an \(L\)-morphism, \(\phi(\bar{v})\) is atomic and \(\bar{a}\in |M|^n\). Then \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\).

Proof. First of all we deal with the atomic formulae of the form \(\tau_0 = \tau_1\) where \(\tau_0\), \(\tau_1\) are terms over \(L\). There are six separate cases. In each case the property of \(f\) used in the proof is that it is a presheaf morphism and hence Lemma (9) can be applied.

Case 1. \(\tau_0 = v_i\), \(\tau_1 = v_j\) for some \(i\), \(j\), with \(i\) and \(j\) not necessarily different.

We have \[\begin{align} [\phi(\bar{a})]_M = [(v_i = v_j)(\bar{a})]_M & = [v_i^M(\bar{a}\upharpoonright Ev_i \wedge Ev_j) = v_j^M(\bar{a}\upharpoonright Ev_i \wedge Ev_j) ]_M \\ & = [v_i^M(\bar{a}) = v_j^M(\bar{a})]_M = [a_i = a_j]_M. \end{align}\]Similarly, \([\phi(f``\bar{a})]_N = [f(a_i) = f(a_j)]_N\). Finally, \[[a_i = a_j]_M \le [f(a_i) = f(a_j)]_N , since f is an presheaf morphism.\]

Case 2. \(\tau_0 = v_i\), \(\tau_1 = c\) for some \(i\) and some \(c\in |C|\).

We have \[\begin{align} [\phi(\bar{a})]_M & = [(v_i = c)(\bar{a})]_M = [v_i^M(\bar{a}\upharpoonright Ev_i \wedge Ec) = c^M(\bar{a}\upharpoonright Ev_i \wedge Ec) ]_M \\ & = [v_i^M(\bar{a}\upharpoonright Ec) = {\mathfrak c}^M\upharpoonright E\bar{a}]_M = [a_i\upharpoonright Ec = {\mathfrak c}^M\upharpoonright E\bar{a}]_M. \end{align}\]Similarly, since \(Ef``\bar{a} = E\bar{a}\), we have \[[\phi(f``\bar{a})]_N = [f(a_i)\upharpoonright Ec = {\mathfrak c}^N\upharpoonright E\bar{a}]_N = [f(a_i\upharpoonright Ec) = f({\mathfrak c}^M\upharpoonright E\bar{a})]_N,\] since \(f\) is a presheaf morphism and an \(L\)-morphism. Finally, since \(f\) is an presheaf morphism, by Lemma (9) we have \[[a_i\upharpoonright Ec = {\mathfrak c}^M\upharpoonright E\bar{a}]_M \le [f(a_i\upharpoonright Ec) = f({\mathfrak c}^M\upharpoonright E\bar{a})]_N\]

Case 3. \(\tau_0 = d\), \(\tau_1 = c\) for some \(c\), \(d \in |C|\). Let \(p = Ec\wedge Ed\).

We have \[\begin{align} [\phi]_M & = [c=d]_M = [{\mathfrak c}^M \upharpoonright p = {\mathfrak d}^M \upharpoonright p]_M \\ & \le [f({\mathfrak c}^M \upharpoonright p) = f({\mathfrak d}^M \upharpoonright p)]_M ,by Lemma (\ref{psh95morphism95push95up95equality}),\\ & = [{\mathfrak c}^N\upharpoonright p = {\mathfrak d}^N\upharpoonright p]_N = [c=d]_N = [\phi]_N. \end{align}\]

Case 4. \(\tau_0 = v_i\) and there are \(\sigma_0\), …, \(\sigma_{m-1}\) and a function \(g\) such that \(\tau_1 = g(\sigma_0,\dots,\sigma_{m-1})\). Note \(E\tau_1 = E\sigma_0\wedge\dots\wedge E\sigma_{n-1}\).

We have \[\begin{align} [\phi(\bar{a})]_M & = [(v_i = g(\sigma_0,\dots,\sigma_{m-1}))(\bar{a})]_M \\ & = [a_i\upharpoonright E\tau_1 = g^M(\sigma_0^M(\bar{a}\upharpoonright E\tau_1),\dots,\sigma_{m-1}^M(\bar{a}\upharpoonright E\tau_1))]_M \\ & \le [f(a_i \upharpoonright E\tau_1) = f( g^M(\sigma_0^M(\bar{a}\upharpoonright E\tau_1),\dots,\sigma_{m-1}^M(\bar{a}\upharpoonright E\tau_1)) )]_N \\ & = [f(a_i) \upharpoonright E\tau_1 = g^N ( f(\sigma_0^M(\bar{a}\upharpoonright E\tau_1)),\dots,f(\sigma_{m-1}^M(\bar{a}\upharpoonright E\tau_1))) ]_N \\ & = [f(a_i) \upharpoonright E\tau_1 = g^N ( \sigma_0^N(f``\bar{a}\upharpoonright E\tau_1),\dots,\sigma_{m-1}^N(f``\bar{a})\upharpoonright E\tau_1) ]_N \\ & \qquad \qquad \qquad\qquad \qquad\qquad \qquad \qquad\qquad \qquad (by Lemma (\ref{pres95interp95of95terms})) \\ & = [v_i = g(\sigma_0,\dots,\sigma_{m-1}))(f``\bar{a})]_N = [\phi(f``\bar{a})]_N \end{align}\]

Case 5. \(\tau_0 = c\in |C|\) and there are \(\sigma_0\), …, \(\sigma_{m-1}\) and a function \(g\) such that \(\tau_1 = g(\sigma_0,\dots,\sigma_{m-1})\). Let \(p = E\tau_0\wedge E\tau_1\), \(= Ec\wedge E\sigma_0\wedge\dots\wedge E\sigma_{n-1}\).

We have \[\begin{align} [\phi(\bar{a})]_M & = [(c = g(\sigma_0,\dots,\sigma_{m-1}))(\bar{a})]_M \\ & = [{\mathfrak c}^M \upharpoonright p = g^M(\sigma_0^M(\bar{a}\upharpoonright p),\dots,\sigma_{m-1}^M(\bar{a}\upharpoonright p))]_M \\ & \le [f({\mathfrak c}^M \upharpoonright p) = f( g^M(\sigma_0^M(\bar{a}\upharpoonright p),\dots,\sigma_{m-1}^M(\bar{a}\upharpoonright p))))]_N \\ & = [f({\mathfrak c}^M ) \upharpoonright p = g^N ( f(\sigma_0^M(\bar{a}\upharpoonright p)),\dots,f(\sigma_{m-1}^M(\bar{a}\upharpoonright p))) ]_N \\ & = [{\mathfrak c}^N \upharpoonright p) = g^N ( \sigma_0^N(f``\bar{a}\upharpoonright p),\dots,\sigma_{m-1}^N(f``\bar{a}\upharpoonright p))]_N \\ & \qquad \qquad \qquad\qquad \qquad\qquad \qquad (by Lemma (\ref{pres95interp95of95terms}))\\ & = [(c = g(\sigma_0,\dots,\sigma_{m-1}))(f``\bar{a})]_N = [\phi(f``\bar{a})]_N \end{align}\]

Similarly, if all the \(\sigma_j\) for \(j<m\) are closed terms and then we have \[\begin{align} [\phi]_M & = [c = g(\sigma_0,\dots,\sigma_{m-1})]_M \\ & = [{\mathfrak c}^M \upharpoonright p = g^M(\sigma_0^M ,\dots,\sigma_{m-1}^M) \upharpoonright p ]_M \\ & \le [f({\mathfrak c}^M \upharpoonright p) = f( g^M(\sigma_0^M(p),\dots,\sigma_{m-1}^M(p)))]_N \\ & = [f({\mathfrak c}^M ) \upharpoonright p = g^N ( f(\sigma_0^M(p)),\dots,f(\sigma_{m-1}^M(p))) ]_N \\ & = [{\mathfrak c}^N \upharpoonright p = g^N ( \sigma_0^N(p),\dots,\sigma_{m-1}^N(p))]_N \\ & = [(c = g(\sigma_0,\dots,\sigma_{m-1}))]_N = [\phi]_N \end{align}\]

Case 6. \(\tau_0 = \tau_1\) and there are \(\sigma_0\), …, \(\sigma_{m-1}\), \(\rho_0\), …\(\rho_{k-1}\) and functions \(g\) and \(h\) such that \(\tau_0 = h(\rho_0,\dots,\rho_{k-1})\) and \(\tau_1 = g(\sigma_0,\dots,\sigma_{m-1})\). Let \(p = E\tau_0\wedge E\tau_1\), \(= E\rho_0\wedge\dots\wedge E\rho_{k-1}\wedge E\sigma_0\wedge\dots\wedge E\sigma_{m-1}\).

We have \[\begin{align} [\phi(\bar{a})]_M & =[(h(\rho_0,\dots,\rho_{k-1}) = g(\sigma_0,\dots,\sigma_{m-1}))(\bar{a})]_M \\ & = [h^M(\rho_0^M(\bar{a}),\dots,\rho_{k-1}^M(\bar{a})) \upharpoonright p = g^M(\sigma_0^M(\bar{a}),\dots,\sigma_{m-1}^M(\bar{a})) \upharpoonright p ]_M \\ & \le [f( h^M(\rho_0^M(\bar{a}),\dots,\rho_{k-1}^M(\bar{a})) \upharpoonright p ) = \\ & \qquad f( g^M(\sigma_0^M(\bar{a}),\dots,\sigma_{m-1}^M(\bar{a}))\upharpoonright p )]_N \\ & = [h^N ( f(\rho_0^M(\bar{a})),\dots,f(\rho_{k-1}^M(\bar{a}))) \upharpoonright p = \\ & \qquad g^N ( f(\sigma_0^M(\bar{a})),\dots,f(\sigma_{m-1}^M(\bar{a}))) \upharpoonright p)]_N \\ & = [g^N ( \rho_0^N(f``\bar{a}),\dots,\rho_{k-1}^N(f``\bar{a})) \upharpoonright p = \\ & \qquad g^N ( \sigma_0^N(f``\bar{a}),\dots,\sigma_{m-1}^N(f``\bar{a})) \upharpoonright p]_N , by Lemma (\ref{pres95interp95of95terms}), \\ & = [(g(\rho_0,\dots,\rho_{k-1}) = g(\sigma_0,\dots,\sigma_{m-1}))(f``\bar{a})]_N = [\phi(f``\bar{a})]_N . \end{align}\]

Similarly, if all the \(\sigma_j\) for \(j<m\) and all the \(\rho_e\) for \(e<k\) are closed terms, \[\begin{align} [\phi]_M & = [h(\rho_0,\dots,\rho_{k-1}) = g(\sigma_0,\dots,\sigma_{m-1})]_M \\ & = [h^M(\rho_0^M(p),\dots,\rho_{k-1}^M(p)) = \\ & \qquad g^M(\sigma_0^M (p),\dots,\sigma_{m-1}^M(p)) ]_M \\ & \le [f( h^M(\rho_0^M(p),\dots,\rho_{k-1}^M(p)) ) = \\ & \qquad f( g^M(\sigma_0^M(p),\dots,\sigma_{m-1}^M(p)) )]_N \\ & = [h^N ( f(\rho_0^M(p)),\dots,f(\rho_{k-1}^M(p))) = \\ & \qquad g^N ( f(\sigma_0^M(p)),\dots,f(\sigma_{m-1}^M(p))) )]_N \\ & = [h^N ( \rho_0^N(p),\dots,\rho_{k-1}^N(p)) = \\ & \qquad g^N ( \sigma_0^N(p),\dots,\sigma_{m-1}^N(p)) ]_N, by Lemma (\ref{pres95interp95of95terms}), \\ & = [(h(\rho_0,\dots,\rho_{k-1}) = g(\sigma_0,\dots,\sigma_{m-1}))]_N = [\phi]_N . \end{align}\]

This completes the proof for atomic formulae of the form \(\tau_0=\tau_1\).

Now suppose \(R\) is a relation symbol in \(L\). We need to consider atomic formulae of the form \(R(\tau_0,\dots,\tau_{n-1})\) where for \(i<n\) the \(\tau_i\) are terms. Here we also need that \(f\) is an \(L\)-morphism.

By definition we have \[[R(\tau_0,\dots,\tau_{n-1})(\bar{a})]_M = [R(\tau_0^M(\bar{a}\upharpoonright q) , \dots, \tau_{m-1}^M(\bar{a}\upharpoonright q))]_M,\] where \(q= E\tau_0\wedge\dots\wedge E\tau_{m-1}\).

Since \(f\) is an \(L\)-morphism we have that \[\begin{align} & \; [R(\tau_0^M(\bar{a}\upharpoonright q) , \dots, \tau_{m-1}^M(\bar{a}\upharpoonright q))]_M \\ \le & \; [R(f(\tau_0^M(\bar{a}\upharpoonright q)) , \dots, f(\tau_{m-1}^M(\bar{a}\upharpoonright q)) )]_N \\ = & \; [R(f(\tau_0^M(\bar{a})\upharpoonright q) , \dots, f(\tau_{m-1}^M(\bar{a})\upharpoonright q) )]_N \\ = & \; [R(\tau_0^N(f``\bar{a})\upharpoonright q) , \dots, \tau_{m-1}^N(f``\bar{a})\upharpoonright q) )]_N , using Lemma (\ref{pres95interp95of95terms}),\\ = & \; [R(\tau_0,\dots,\tau_{n-1})(f``\bar{a})]_N . \end{align}\] ◻

Lemma 40. Suppose \(f:M\longrightarrow N\) is an \(L\)-monomorphism, \(\phi(\bar{v})\) is atomic and \(\bar{a}\in |M|^n\). Then \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\).

Proof. The proof is almost identical to the proof of the previous lemma (Lemma (39), except that in the six cases concerning equality between terms we use the fact that \(f\) is a presheaf monomorphism and so Proposition (11) is applicable, where previously we applied Lemma (9), and in dealing with relations we use the defining property regarding relations of \(L\)-monomorphism rather than that of \(L\)-morphisms. The result is that we preserve equality throughout. ◻

Lemma 41. Suppose \(f:M\longrightarrow N\) is an presheaf morphism. Let \(\phi(\bar{v})\) be a formula in \(L\) and \(\bar{a}\in |M|^n\). If \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\), then \([\neg\phi(\bar{a})]_M \ge [\neg \phi(f``\bar{a})]_N\).

Proof. By hypothesis \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\), so \(\neg [\phi(\bar{a})]_M \ge \neg [\phi(f``\bar{a})]_N\). Using the two clauses of the definition of presheaf morphism, we also have \(E(f``\bar{a}\upharpoonright E\phi) = E(\bar{a}\upharpoonright E\phi)\). Hence \[\begin{align} [\neg \phi(f``\bar{a})]_N & = E(f``\bar{a}\upharpoonright E\phi) \land \neg [\phi(f``\bar{a}\upharpoonright E\phi)]_N \\ & \le E(\bar{a}\upharpoonright E\phi) \land \neg [\phi(\bar{a})]_M = [\neg \phi(\bar{a})]_M . \end{align}\] ◻

Lemma 42. Suppose \(f:M \longrightarrow N\) is a presheaf morphism. Let \(\phi(\bar{v})\) be a formula in \(L\) and \(\bar{a}\in |M|^n\). If \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\), then \([\neg\phi(\bar{a})]_M = [\neg \phi(f``\bar{a})]_N\).

Proof. The proof is similar to that of the previous lemma, but with inequality replaced by equality. By hypothesis \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\), so \(\neg [\phi(\bar{a})]_M = \neg [\phi(f``\bar{a})]_N\). Using the two clauses of the definition of presheaf morphism, we also have \(E(f``\bar{a}\upharpoonright E\phi) = E(\bar{a}\upharpoonright E\phi)\). Hence \[\begin{align} [\neg \phi(f``\bar{a})]_N & = E(f``\bar{a}\upharpoonright E\phi) \land \neg [\phi(f``\bar{a}\upharpoonright E\phi)]_N \\ & = E(\bar{a}\upharpoonright E\phi) \land \neg [\phi(\bar{a})]_M = [\neg \phi(\bar{a})]_M . \end{align}\] ◻

Lemma 43. Suppose \(f:M \longrightarrow N\) is an presheaf morphism. Let \(\diamond \in\{\hskip 1pt\lor, \land\hskip 1pt\}\). Let \(\phi(\bar{v})\), \(\psi(\bar{v})\) be formulae in \(L\) and \(\bar{a}\in |M|^n\). Suppose \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\) and \([\psi(\bar{a})]_M \le [\psi(f``\bar{a})]_N\). Then \([(\phi \diamond \psi)(\bar{a})]_M \le [(\phi \diamond \psi)(\bar{a})]_N\).

Proof. Let \(q=E\phi \land E\psi\). Then, again using the definition of a presheaf morphism, \(E(f``\bar{a} \upharpoonright q) = E(\bar{a} \upharpoonright q)\), \(=r\), say. Then we have \[\begin{align} [\phi \diamond \psi(f``\bar{a})]_N & = r \land ([\phi(f``\bar{a}\upharpoonright q)]_N \diamond [\psi(f``\bar{a}\upharpoonright q)]_N ) \\ & = (r \land [\phi(f``\bar{a}\upharpoonright q)]_N) \diamond (r\land [\psi(f``\bar{a}\upharpoonright q)]_N) \\ & \ge (r \land [\phi(\bar{a}\upharpoonright q)]_M) \diamond (r \land [\psi(\bar{a}\upharpoonright q)]_M)) \\ & = r \land ([\phi(\bar{a}\upharpoonright q)]_M \diamond [\psi(\bar{a}\upharpoonright q)]_M) = [(\phi \diamond \psi)(\bar{a})]_M . \end{align}\] ◻

Lemma 44. Suppose \(f:M \longrightarrow N\) is an presheaf morphism. Let \(\diamond \in\{\hskip 1pt\lor, \land,\mathop{\parbox{.5cm}{\rightarrowfill}}\hskip 1pt\}\). Let \(\phi(\bar{v})\), \(\psi(\bar{v})\) be formulae in \(L\) and \(\bar{a}\in |M|^n\). Suppose \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\) and \([\psi(\bar{a})]_M = [\psi(f``\bar{a})]_N\). Then \([(\phi \diamond \psi)(\bar{a})]_M = [(\phi \diamond \psi)(\bar{a})]_N\).

Proof. Let \(q=E\phi \land E\psi\). Then, once more using the definition of a presheaf morphism, \[\begin{align} [\phi \diamond \psi(f``\bar{a})]_N & = E(f``\bar{a} \upharpoonright q) \land [\phi(f``\bar{a}\upharpoonright q)]_N \diamond [\psi(f``\bar{a}\upharpoonright q)]_N = \\ & E(\bar{a} \upharpoonright q) \land [\phi(\bar{a}\upharpoonright q)]_M \diamond [\psi(\bar{a}\upharpoonright q)]_M = [(\phi \diamond \psi)(\bar{a})]_M . \end{align}\] ◻

Note that ‘\(\mathop{\parbox{.5cm}{\rightarrowfill}}\)’ is one of the connectives treated in this last lemma, whereas in the previous previous lemma it is not.

Proposition 45. Suppose \(f:M\longrightarrow N\) is an \(L\)-monomorphism, \(\phi(\bar{v})\) is quantifier free and \(\bar{a}\in |M|^n\). Then \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\).

Proof. The proof is by induction on the structure of \(\phi\). Lemma (40) deals with atomic formulae. Since \(f\) is an \(L\)-morphism inductive steps involving the binary connectives (\({\lor, \land,\mathop{\parbox{.5cm}{\rightarrowfill}}}\)) can be handled by Lemma (44) and those involving negation can be handled by Lemma (42). ◻

Corollary 46. Suppose \(f:M\longrightarrow N\) is an \(L\)-monomorphism, \(\phi(\bar{v})\) is quantifier free and \(\bar{a}\in |M|^n\). Then \(M\Vdash\phi(\bar{a})\) if and only if \(N\Vdash \phi(f``\bar{a})\).

Proof. By the proposition, \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\), whilst \(Ef``\bar{a}=E\bar{a}\) since \(f\) is a presheaf morphism. So \([\phi(\bar{a})]_M = E\phi \wedge E\bar{a}\) if and only if \([\phi(f``\bar{a})]_N = E\phi \wedge Ef``\bar{a}\), as required. ◻

We next give preservation results for formulae involving existential quantifiers.

Lemma 47. Suppose \(f:|M| \longrightarrow |N|\) is a function. Let \(\phi\) be a formula in \(L\) with \(n+1\) free variables and \(\bar{a}\in |M|^n\).

  • If for all \(b\in |M|\) we have \([\phi(b,\bar{a})]_M \le [\phi(f(b),f``\bar{a})]_N\), then \([\exists t\hskip 2pt\phi(t,\bar{a})]_M \le [\exists t\hskip 2pt\phi(t,f``\bar{a})]_N\).

  • If \(f\) is a surjection and for all \(b\in |M|\) we have \([\phi(b,\bar{a})]_M = [\phi(f(b),f``\bar{a})]_N\), then \([\exists t\hskip 2pt\phi(t,\bar{a})]_M = [\exists t\hskip 2pt\phi(t,f``\bar{a})]_N\).

Proof. For the first statement, using the hypothesis for the first inequality and that \(f``|M| \subseteq |N|\) for the second, we have \[\begin{align} [\exists t \hskip 2pt\phi(t,\bar{a})]_M & = \bigvee_{b\in |M|} [\phi(b,\bar{a})]_M \le \bigvee_{b\in |M|} [\phi(f(b),f``\bar{a})]_N \\ & \le \bigvee_{d\in |N|} [\phi(d,f``\bar{a})]_N = [\exists t\hskip 2pt\phi(t,f``\bar{a})]_N . \end{align}\] For the second statement, using the hypothesis for the second equality and that \(f``|M| = |N|\) for the third, we have \[\begin{align} [\exists t \hskip 2pt\phi(t,\bar{a})]_M & = \bigvee_{b\in |M|} [\phi(b,\bar{a})]_M = \bigvee_{b\in |M|} [\phi(f(b),f``\bar{a})]_N \\ & = \bigvee_{d\in |N|} [\phi(d,f``\bar{a})]_N = [\exists t\hskip 2pt\phi(t,f``\bar{a})]_N . \end{align}\] ◻

Corollary 48. Suppose \(f:M\longrightarrow N\) is an \(L\)-morphism, \(\phi(\bar{v})\in {\mathcal{E}}^+_1\) is positive existential and \(\bar{a}\in |M|^n\). Then \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\).

Proof. The proof is by induction on the structure of \(\phi\). Lemma (39)) deals with atomic formulae and the previous lemma (Lemma (47)) deals with existential quantification.

Finally, suppose \(\diamond \in\{\hskip 1pt\lor, \land\hskip 1pt\}\). Let \(\chi(\bar{v})\), \(\psi(\bar{v})\) be formulae in \({\mathcal{E}}^+_1\) and \(\bar{a}\in |M|^n\). Suppose, by induction, \([\chi(\bar{a})]_M \le [\chi(f``\bar{a})]_N\) and \([\psi(\bar{a})]_M \le [\psi(f``\bar{a})]_N\). Then by Lemma (43) we have \([\chi \diamond \psi(f``\bar{a})]_N \le [(\chi \diamond \psi)(\bar{a})]_M\). ◻

Proposition 49. Suppose \(f:M\longrightarrow N\) is an \(L\)-monomorphism, \(\phi(\bar{v})\in {\mathcal{E}}_1\) and \(\bar{a}\in |M|^n\). Then \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\).

Proof. This is immediate from Proposition (45), since again existential quantification can again be handled by Lemma (47) and conjunction and disjunction can be handled by Lemma (43). ◻

Corollary 50. Let \(f:M\longrightarrow N\) be an \(L\)-monomorphism, \(\phi(\bar{v}) \in {\mathcal{E}}_1\) and \(\bar{a}\in |M|^n\). Then \(M \Vdash\phi(\bar{a})\) implies \(N\Vdash\phi(f``\bar{a})\).

Proof. By Proposition (49), \([\phi(\bar{a})]_M \le [\phi(f``\bar{a})]_N\). However, by hypothesis \(M\Vdash\phi(\bar{a})\), so we have \([\phi(\bar{a})]_M = E\phi \wedge E\bar{a}\), and hence \(E\phi \wedge E\bar{a} \le [\phi(f``\bar{a})]_N\). However, by Lemma (29), \([\phi(f``\bar{a})]_N \le E\phi \wedge Ef``\bar{a} =E\phi \wedge E\bar{a}\), so we also have \([\phi(f``\bar{a})]_N = E\phi \wedge Ef``\bar{a}\), and thus \(N\Vdash\phi(f``\bar{a})\). ◻

With the results proved so far in hand we can improve on some of the results of [1], cited previously, concerning the method of diagrams, introduced in classical model theory by Robinson.

Definition 52. Let \(M\) be an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). For \(\Gamma\) a set of \({\mathcal{L}}_M\) sentences, the \(\Gamma\)-diagram of \({\mathcal{M}}\) is the function \([.]_{\tilde{M}}:\Gamma\longrightarrow \Omega\). When \(\Gamma\) is the set of all \({\mathcal{L}}_M\) sentences which are either atomic or negations of atomic we call this function the (Robinson) diagram of \(\mathcal{M}\), and when \(\Gamma\) is the set of all \({\mathcal{L}}_M\) sentences we call it the elementary (Robinson) diagram of \(\mathcal{M}\). When \(\Omega\) is the algebra \(\{\hskip 1pt\top,\bot\hskip 1pt\}\) these are characteristic functions of the usual \(\Gamma\)-diagram, Robinson diagram and elementary Robinson diagram, respectively.

Proposition 51. Let \({\mathcal{M}}\) and \({\mathcal{N}}\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). The following are equivalent. \[\begin{align} (1)&\;\; There is a \Gamma-L-monomorphismf:M\longrightarrow N. \\ (2)&\;\; There is an expansion of Nto an L_M-structure \tilde{N} such that \\ &\;\;\;\; [.]_{\tilde{N} } \upharpoonright\Gamma = [.]_{\tilde{M}} \upharpoonright\Gamma . \end{align}\]

Proof. (1) implies (2). Let \(f:M \longrightarrow N\) be a \(\Gamma\)-\(L\)-monomorphism. Thus, if \(\phi(\underaccent{\bar}{a}_0,\dots,\underaccent{\bar}{a}_{n-1})\in\Gamma\) we have \([\phi(\bar{a})]_M = [\phi(f``\bar{a})]_N\). Let \(\tilde{M} = (M,a)_{a\in |M|}\) and \(\tilde{N} = (N,f(a))_{a\in |M|}\). We also have \([\phi(\bar{a})]_M = [\phi(\underaccent{\bar}{\bar{a}}^{\tilde{M}})]_M\) and \([\phi(f``\bar{a})]_N = [\phi(\underaccent{\bar}{\bar{a}}^{\tilde{N}})]_N\). Thus \([\phi(\underaccent{\bar}{\bar{a}}^{\tilde{M}})]_M = [\phi(\underaccent{\bar}{\bar{a}}^{\tilde{N}})]_N\). Hence, \(\tilde{N}\) is an expansion of \(N\) to and \(L_M\)-structure with \([.]_{\tilde{N} } \upharpoonright\Gamma = [.]_{\tilde{M}} \upharpoonright\Gamma\).

(2) implies (1). Define \(f:M \longrightarrow N\) by \(f(a) = \underaccent{\bar}{a}^{\tilde{N}}\). By Lemma (33), \(f\) is a presheaf morphism. If \(\phi(\underaccent{\bar}{a}_0,\dots,\underaccent{\bar}{a}_{n-1}) \in \Gamma\) then \([\phi(\underaccent{\bar}{a}_0^{\tilde{M}},\dots,\underaccent{\bar}{a}_{n-1}^{\tilde{M}})]_{\tilde{M} }= [\phi(\underaccent{\bar}{a}_0^{\tilde{N}},\dots,\underaccent{\bar}{a}_{n-1}^{\tilde{N}})]_{\tilde{N} }\), and so \([\phi({a}_0,\dots,{a}_{n-1})]_{{M} } = [\phi(f({a}_0),\dots,f({a}_{n-1}))]_{{N} }\). Thus \(f\) is a \(\Gamma\)-\(L\)-monomorphism. ◻

Definition 53. Define \(\mathop{\mathrm{Sent}}^{M}_{0} = \{\hskip 1pt\phi\hskip 2pt:\hskip 2pt\phi is a quantifier-free L_M-sentence\hskip 1pt\}\) and \(\mathop{\mathrm{Sent}}^{M} = \{\hskip 1pt\phi\hskip 2pt:\hskip 2pt\phi is a L_M-sentence\hskip 1pt\}\). Define \(\mathop{\mathrm{Rel}}^{M} = \{\hskip 1pt R(\bar{\underaccent{\bar}{a}})\hskip 2pt:\hskip 2ptR is a relation in L,\hskip 2pt\bar{a}\in |M|^n\hskip 1pt\}\).

Theorem 52. Let \(M\) and \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). The following are equivalent. \[\begin{align} 1(a)&\;\;There is an L-monomorphismf:M\longrightarrow N .\\ 1(b)&\;\;There is an expansion of N to an L_M-structure\tilde{N} with\\ &\;\;\;\;\;\; [.]_{\tilde{N}} \upharpoonright\mathop{\mathrm{Sent}}_0^M = [.]_{\tilde{M}} \upharpoonright\mathop{\mathrm{Sent}}_0^M . \\ 1(c)&\;\;There is an expansion of N to an L_M-structure \tilde{N} with\\ &\;\;\;\;\;\; [.]_{\tilde{N}} \upharpoonright\mathop{\mathrm{Rel}}^M = [.]_{\tilde{M}} \upharpoonright\mathop{\mathrm{Rel}}^M . \\[6pt] &\;\;\;\; and \\[6pt] 2(a)&\;\;There is an elementary L-monomorphismf:M\longrightarrow N .\\ 2(b)&\;\;There is an expansion of N to an L_M-structure\tilde{N} with\\ &\;\;\;\; [.]_{\tilde{N}} \upharpoonright\mathop{\mathrm{Sent}}^M = [.]_{\tilde{M}} \upharpoonright\mathop{\mathrm{Sent}}^M . \end{align}\]

Proof. Immediate from Proposition (51), using Proposition (49) to show 1(c) implies 1(b). ◻

Theorem (52) generalizes Robinson’s original results on the method of diagrams as these are exactly what the theorem gives in the case of \(\Omega\) being the 2 element (Boolean) algebra \(\{\hskip 1pt\top,\bot\hskip 1pt\}\). (Cf., for example, [89], Chapter 2, or [90], Chapter 13.1.)

Lemma 53. Let \(M\) and \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\), let \(\tilde{M}\) be the natural expansion of \(M\) to an \(L_M\)-structure (as before) and let \(\tilde{N}\) be an expansion of \(N\) to an \(L_M\)-structure. Let \(\phi(\bar{\underaccent{\bar}{a}})\) be an \(L_M\)-sentence. Let \(q=[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}}\), \(p=[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\) and \(d=p\mathop{\parbox{.5cm}{\rightarrowfill}}q\). \[\begin{align} (1)&\;\; \tilde{M} \Vdash\phi(\bar{\underaccent{\bar}{a}}\upharpoonright q).\\ (2)& \;\; \tilde{N} \Vdash\phi(\bar{\underaccent{\bar}{a}}\upharpoonright q) if and only ifq\le p , \emph{i.e.}[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}.\\ (3)& \;\;If\tilde{N} \Vdash\phi(\bar{\underaccent{\bar}{a}}\upharpoonright q),\hskip 2pt\neg\phi(\bar{\underaccent{\bar}{a}}\upharpoonright q)then\neg\neg [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} = \neg\neg [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}.\\ (4)& \;\; If q\le pthen(E\bar{a}\upharpoonright p) \land d = q = [\phi(\bar{a}\upharpoonright p)]_M. \end{align}\]

Proof. (See also the proof of [1], Theorem (5.8).)

(1). We have \([\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}}\upharpoonright q)]_{\tilde{M}} = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \land [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}}\). However, we also have \([\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le E\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})\), by Lemma (29), while \(E\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}}\upharpoonright q) = E\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}}) \land q\le q = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}}\).

(2). If \(\tilde{N} \Vdash\phi(\bar{\underaccent{\bar}{a}}\upharpoonright q)\) then \(q = E\bar{\underaccent{\bar}{a}}\upharpoonright q \land E\phi = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}}\upharpoonright q)]_{\tilde{N}} = q \land [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\). If \([\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\) then \([\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})\upharpoonright q)] = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}} \land q = q = q\land q = [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}}\upharpoonright q)]_{\tilde{M}} = E\bar{\underaccent{\bar}{a}}^{\tilde{M}}\upharpoonright q \land E\phi = E\bar{\underaccent{\bar}{a}}^{\tilde{N}}\upharpoonright q \land E\phi\), where the penultimate equality holds by (1).

(3). By (2) one immediately has \(\neg\neg [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le \neg\neg [\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\).

Applying (2) for \(\neg\phi\) in place of \(\phi\), one also has \([\neg\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le [\neg\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\), that is \(E\bar{a} \land \neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \le E\bar{a}\land \neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\). Taking the \(\land\) with \(\neg\neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}}\) on both sides give \(E\bar{a} \land \neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}} \land \neg\neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}} =\bot\), and hence one has \(E\bar{a} \land \neg\neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}} \le \neg\neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}}\). However, \([\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}} \le E\bar{a}\), so \(\neg\neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{N}})]_{\tilde{N}} \le \neg \neg[\phi(\bar{\underaccent{\bar}{a}}^{\tilde{M}})]_{\tilde{M}}\).

(4.) Using modus ponens (Lemma 2) for the second equality, the hypothesis that \(q\le p\) for the third and penultimate equalities, and (1) for the fourth equality, we have \[\begin{align} (E\bar{a}\upharpoonright p ) \land d & = E\bar{a}\upharpoonright(p\land d) = E\bar{a}\upharpoonright(p\land q) = E\bar{a} \upharpoonright q = [\phi(\bar{a}\upharpoonright q)]_M\\ & = [\phi(\bar{a})]_M \land q = q \land q = q = q\land p = [\phi(\bar{a}\upharpoonright p)]_M. \end{align}\] ◻

Definition 54. Let \(M\) be an \(L\)-structure in \(\mathop{\mathrm{pSh}}({\Omega})\). Let \[\begin{align} \Delta^+_M = & \hskip 2pt\hskip 2pt\{\hskip 1pt\phi\hskip 2pt:\hskip 2pt\phiis an atomic L_M-sentence and \tilde{M}\Vdash\phi \hskip 1pt\} and \\ \Delta_M= & \hskip 2pt\hskip 2pt\{\hskip 1pt\phi\hskip 2pt:\hskip 2pt\phiis an atomic L_M-sentence or a negation of \\ &\qquad \qquadan atomicL_M-sentence and \tilde{M}\Vdash\phi\hskip 1pt\}. \end{align}\]

Definition 55. Let \({\mathcal{E}}^{M}_1\) be the collection of \(L_M\)-sentences obtained by closing the quantifier-free \(L_M\) formulae under the operator \(\mathcal{E}\) (see Definition (42)).

Theorem 54. (See [1], Lemma (4.6), showing (1) and (3) are equivalent.) Let \(M\) and \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). The following are equivalent. \[\begin{align} (1)&There is an L-morphismf:M\longrightarrow N .\\ (2)&There is an expansion of N to an L_M-structure\tilde{N} with\tilde{N}\Vdash{\mathcal{E}}^+_1. \\ (3)&There is an expansion of N to an L_M-structure \tilde{N} with\tilde{N}\Vdash\Delta^+_M \end{align}\]

Proof. The equivalence of (2) and (3) is follows from Corollary (48). The proof that (3) implies (1) follows immediately from Lemma (53(2)). To see that (1) implies (3) note that if \(\phi(\bar{\underaccent{\bar}{a}}) \in \Delta^+_M\) then \([\phi(\bar{a})] = E\bar{a}\land E\phi\), as \(f\) is an \(L\)-morphism we have \([\phi(\bar{a})]\le [\phi(f``\bar{a})]\), and \(E\bar{a}\land E\phi = Ef``\bar{a}\land E\phi\). ◻

Theorem 55. Let \(M\) and \(N\) be \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\). The following are equivalent. \[\begin{align} (1)&There is a weak L-monomorphismf:M\longrightarrow N .\\ (2)&There is an expansion of N to an L_M-structure\tilde{N} with\tilde{N}\Vdash{\mathcal{E}}\Delta_M. \\ (3)&There is an expansion of N to an L_M-structure \tilde{N} with\tilde{N}\Vdash\Delta_M. \end{align}\]

Proof. This theorem is similarly immediate from the proof of (1) implies (3) in the corresponding result [1], Proposition (4.7), which follows directly from Lemma (53(3)), using Lemma (43) and Lemma (48). ◻

These preservation results could be extended to the infinitary logic \(L_{\infty,\omega}\) where arbitrary (set-sized) conjunctions and disjunctions are allowed (and a class sized collection of variables), and where the inductive definitions of \([\bigwedge_{i\in I} \phi_i]\) and \([\bigvee_{i\in I} \phi_i]\) are simply the infinite versions of the definitions for \(\land\) and \(\lor\).

In [88], §[additional_connectives] we discuss extending the languages \(L\) by adding a unary connectives \(\raise 1.183pt\scalebox{0.915}{\Box_{\hskip 1ptp}}\hskip 1.5pt\) for each \(p\in\Omega\) in the style of [1],§5. At the close of [88], §[additional_connectives] we show how one can re-write results on the method of diagrams from this section in the form of assertions between the equivalence of the existence of a suitable \(L\)-\(\Gamma\)-monomorphism from \(M\) to \(N\) and the existence of an extension \(\tilde{N}\) of \(N\) which forces the relevant \(L^{\scalebox{1.2}{\square}}_M\)-sentences which \(M\) forces.

4 Categories of interest and directed colimits↩︎

Now we define the categories of our principal interest.

Definition 56. (Categories of interest) Let \(L\) be a first order language with equality over \(\Omega\) and \(T\) an \(L\)-theory. Obejcts in our categories of interest are pairs \((A,M)\), taking one of four forms. \[\begin{align} &M\in \mathop{\mathrm{pSh}}({\Omega,L}),\, M\Vdash T,\, A\in \mathop{\mathrm{pSh}}({\Omega}) and A is a subpresheaf of M, or\\ &M\in \mathop{{\mathrm{Sh}}}({\Omega,L}), \, M\Vdash T,\, A\in \mathop{\mathrm{pSh}}({\Omega}) and A is a subpresheaf of M, or\\ &M\in \mathop{{\mathrm{Sh}}}({\Omega,L}),\hskip 1ptM\Vdash T,\hskip 1ptA\in \mathop{{\mathrm{Sh}}}({\Omega}), andA is a subsheaf of M, or\\ &M\in \mathop{{\mathrm{Sh}}}({\Omega,L}),\hskip 1ptM\Vdash T,\hskip 1ptA\in \mathop{{\mathrm{Sh}}}({\Omega}),\hskip 1ptA is a subsheaf of M and d(A)\le d(M). \end{align}\]

We equip each of these collections of objects with the six collections of morphisms given in Definition (47).

That is, \((A,M) \xlongrightarrow{f} (B,N)\) is a morphism if \(f\) is

  • a presheaf morphism from \(M\) to \(N\),

  • presheaf monomorphism,

  • an \(L\)-morphism,

  • a weak \(L\)-monomorphism

  • an \(L\)-monomorphism,

  • an elementary \(L\)-monomorphism.

respectively.

Note, we really do mean to take \(A\in \mathop{\mathrm{pSh}}({\Omega})\) or \(A\in \mathop{{\mathrm{Sh}}}({\Omega})\) rather than \(\mathop{\mathrm{pSh}}({\Omega,L})\) or \(\mathop{{\mathrm{Sh}}}({\Omega,L})\). We could prove versions of the results in §§5-7 for the latter variants, however we would need stronger notions of morphisms, which would also preserve logical properties of \(A\), for example, to take the strongest case, an elementary \(L\)-monomorphism whose restriction to \(A\) is an elementary \(L\)-monomorphism from \(A\) to \(B\).

For fixed \(\Omega\) and \(T\), we give these categories (somewhat ugly) names: \[\begin{align} & (\normalfont \bfseries SubpSh(\Omega),\normalfont \bfseries pShMod(T))_x,\\ & (\normalfont \bfseries SubpSh(\Omega),\normalfont \bfseries ShMod(T))_x ,\\ & (\normalfont \bfseries SubSh(\Omega),\normalfont \bfseries ShMod(T))_x and \\ & (\normalfont \bfseries bdSubSh(\Omega),\normalfont \bfseries ShMod(T))_x, respectively, \end{align}\]depending on the notion of object, where the index \(x\) indicates the type of morphisms: one of psh, psh-mono, \(L\), wk-\(L\)-mono, \(L\)-mono, or elt-\(L\)-emb. For example, \(\kern-2pt (\normalfont \bfseries bdSubSh(\Omega),\normalfont \bfseries ShMod(T))_{\scriptsize elt-L-emb}\) is the category whose objects are pairs \((A,M)\) such that \(M\in \mathop{{\mathrm{Sh}}}({\Omega,L})\), \(M\Vdash T\), \(A\in \mathop{{\mathrm{Sh}}}({\Omega})\) and \(A\) is a subsheaf of \(M\) with \(d(A)\le d(M)\), and whose morphisms are elementary \(L\)-embeddings.

When there is no confusion we will shorten these names by omitting \(\Omega\) and/or \(T\), e.g., the same example will be called \(\kern-2pt (\normalfont \bfseries bdSubSh,\normalfont \bfseries ShMod)_{\scriptsize elt-L-emb}\).

The next proposition discusses directed colimits in the categories of interest in the case that \(T=\emptyset\), that is that the “models” are simply \(L\)-structures. It shows that directed colimits exist under all of the types of morphism we consider.

Proposition 56. ([2]). Let \({\mathfrak C}\) be any of the categories defined in Definition (56) in the case of \(T=\emptyset\). (So the “models” are simply \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\).) Let \(\langle\hskip 1pt\langle\hskip 1pt(A_i, M_i)\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle,\langle\hskip 1ptg_{ij}\hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\hskip 1pt\rangle\hskip 1pt\rangle\) be a directed system in \({\mathfrak C}\), where if \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\) then \((A_i,M_i) \xlongrightarrow{g_{ij}} (A_j,M_j)\) is a morphism in the category. Then the colimit of the system exists in \({\mathfrak C}\).

We will give a proof since Miraglia’s proof leaves out many details and has some unfortunate typos, making it difficult for the reader to flesh out what was skimmed.

Proof. Throughout we write \([. = .]_i\) for \([.=.]_{M_i}\), where the latter is as defined in Definition (9).

We start by defining the underlying set of the colimit and showing this is a good definition. We then show how to equip the set with the structure of a presheaf and show the resulting presheaf is extensional. As a final step in the presheaf part of the construction define morphisms from the \((A_i,M_i)\) into the colimit and show these are presheaf morphisms or presheaf monomorpisms, respectively if the morphisms in directed system have the corresponding property.

Let \(|M^*| = \bigcup (|M_i| \times \{\hskip 1pti\hskip 1pt\})\) be the disjoint union of the underlying sets of the \(M_i\)s. Also, let \(|A^*| = \bigcup (|A_i| \times \{\hskip 1pti\hskip 1pt\})\).

We define an equivalence relation on \(|M^*|\) by \((x,i) \sim (y,j)\) if there is some \(l\in I\) with \(i\), \(j\hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\) and \(g_{il}(x)=g_{jl}(y)\).

It is immediate that \(\sim\) is reflexive and symmetric. The transitivity of \(\sim\) follows rapidly from directedness. If \((x,i) \sim (y,j) \sim (z,k)\) with \(l\), \(m\) such that \(i\), \(j\hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\) and \(j\), \(k\hskip 2pt\mathrel{\triangleleft}\hskip 2ptm\), while \(g_{il}(x)=g_{jl}(y)\) and \(g_{jm}(y)=g_{km}(z)\) we can take \(n\in I\) with \(l\), \(m\hskip 2pt\mathrel{\triangleleft}\hskip 2ptn\). We then have \(i\), \(j\), \(k\hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\) and \[g_{in}(x) = g_{ln}\cdot g_{il}(x) = g_{ln}\cdot g_{jl}(y) = g_{mn}\cdot g_{jm}(y) = g_{mn}\cdot g_{km}(z) = g_{kn}(z),\] and hence \((x,i)\sim (z,k)\).

For \((x,i)\in |M^*|\) write \((x,i)_{\sim}\) for its equivalence class under \(\sim\). We set \(|M| = \{\hskip 1pt (x,i)_{\sim}\hskip 2pt:\hskip 2pt(x,i) \in |M^*|\hskip 1pt\}\), the quotient of \(|M^*|\) under \(\sim\). We set \(|A| = \{\hskip 1pt (x,i)_{\sim}\hskip 2pt:\hskip 2pt(x,i) \in |M^*| \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2ptx\in |A_i|\hskip 1pt\}\).

We will define \(\upharpoonright^M : |M| \times\Omega \longrightarrow |M|\) and \(E^M : |M| \longrightarrow \omega\). For \((x,i)_{\sim} \in |M|\) and \(p\in\Omega\) define \(((x,i)_{\sim} ) \upharpoonright^M p\) to be \((x\upharpoonright^{M_i} p,i)_{\sim}\) and \(E^M ((x,i)_{\sim}) = E^{M_i}x\). We set \(M = (|M|,\upharpoonright^M,E^M)\).

We define \(\upharpoonright^A\) and \(E^A\) similarly: for \((x,i)_{\sim} \in |A|\) and \(p\in\Omega\) define \(((x,i)_{\sim} ) \upharpoonright^A p\) to be \((x\upharpoonright^{A_i} p,i)_{\sim}\) and \(E^A ((x,i)_{\sim}) = E^{A_i}x\). We set \(M = (|A|,\upharpoonright^A,E^A)\).

We need to check these are good definitions. So suppose \((x,i)\sim (y,j)\) and let \(k\in I\) be such that \(i\), \(j\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) and \(g_{ik}(x)=g_{jk}(y)\). Let \(p\in\Omega\).

By the first clause in the definition of presheaf morphisms we have that \(E^{M_i} x = E^{M_k} g_{ik}(x)= E^{M_k} g_{jk}(y) = E^{M_j} y\). Hence, \(E^M\) is well defined.

By the second clause in the definition of presheaf morphism we have that \(g_{ik}(x\upharpoonright p) = g_{ik}(x) \upharpoonright p = g_{jk}(y) \upharpoonright p = g_{jk}(y\upharpoonright p)\). Consequently we have that \((x\upharpoonright p,i)\sim (y\upharpoonright p,i)\). This shows that \(\upharpoonright^M\) is well defined.

The same proofs verbatim with \(M_i\), \(M_j\), \(M_k\) and \(M\) replaced by \(A_i\), \(A_j\), \(A_k\) and \(A\) respectively show that \(E^A\) and \(\upharpoonright^A\) are also well defined.

We next check that \(M=(|M|,\upharpoonright^M,E^M)\) is indeed a presheaf over \(\Omega\). Let \(a = (x,i)_{\sim} \in |M|\) and \(p\), \(q\in \Omega\).

We have \(a\upharpoonright^M (p\wedge q) = (x\upharpoonright^{M_i} (p\wedge q),i)_{\sim} = ( (x\upharpoonright^{M_i} p)\upharpoonright^{M_i} q,i)_{\sim} = {((x\upharpoonright^{M_i} p),i)_{\sim} \upharpoonright^M q} = ((x,i)_{\sim} \upharpoonright^M p) \upharpoonright^M q = (a \upharpoonright^M p)\upharpoonright^M q,\) as required.

We also have that \(a \upharpoonright^M E^Ma = ((x,i)_{\sim}) \upharpoonright^M (E^{M_i} x) = (x\upharpoonright(E^{M_i}x,i)_{\sim} = (x,i)_{\sim}=a\), as required.

We, finally, have \(E^M (a\upharpoonright^M p) = E^M((x\upharpoonright^{M_i} p,i)_{\sim}) = E^{M_i}( x\upharpoonright^{M_i} p) = (E^{M_i}x)\wedge p = (E^M ((x,i)_{\sim})) \wedge p = E^Ma \wedge p\), again, as required.

Again, the same proofs verbatim with \(M_i\) and \(M\) replaced by \(A_i\) and \(A\) show that \(A\) is a presheaf and hence is a subpresheaf of \(M\).

We also show that \(M\) is extensional. So suppose \(a\), \(b\in |M|\) with \(a= (x,i)_{\sim}\) and \(b= (y,i)_{\sim}\) (where we may take the second coordinate of the representative of each equivalence class to be the same by directedness), and suppose that \(D\subseteq \Omega\) is such that for all \(p\in D\) we have \(a\upharpoonright^M p=b\upharpoonright^M p\) and \(E^Ma=E^Mb=\bigvee D\). (The latter is long-hand for \(E^Ma=E^Mb = [a=b]_M\).)

We have \(E^{M_i}x = E^{M_i}y =\bigvee D\) and \(x\upharpoonright^{M_i} p =y\upharpoonright^{M_i} p\). By the extensionality of \(M_i\) this gives that \(x=y\). Hence \(a=b\).

Once more, the same proofs with \(M_i\) and \(M\) replaced by \(A_i\) and \(A\) show that \(A\) is extensional.

Finally, as far as the pure presheaf side of things goes, we define presheaf morphisms from the \(M_i\) to \(M\) and show they are monomorphisms if the maps witnessing the directed system are.

For each \(i\in I\) we define \((A_i,M_i) \xlongrightarrow{g_{i}} (A,M)\) by for each \(x\in M_i\) setting \(g_i(x) = (x,i)_{\sim}\). Note that if \(x\in |A_i|\) then \(g_i(x)\in |A|\).

If \(x\in M_i\) and \(p\in\Omega\) then \(E^{M} g_i(x) = E^{M_i}x\), by the definition of \(E^M\) and, further, \(g_i(x \upharpoonright^{M_i} p) = (x \upharpoonright^{M_i} p,i)_{\sim} = (x,i)_{\sim}\upharpoonright^M p\), by the definition of \(\upharpoonright^M\). Hence for \(i\in I\) we have that \(g_i\) is a presheaf morphism.

Now, suppose \(g_{ij}\) is an presheaf monomorphism for all \(i\), \(j\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\).

Let \(i\in I\). Suppose \(x\), \(y\in M_i\) and \(g_i(x) = g_i(y)\). Thus \((x,i)_{\sim} = (y,i)_{\sim}\). However, by the definition of \((x,i)_{\sim}\), the latter implies there is some \(k\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) and \(g_{ik}(x)=g_{ik}(y)\). Since \(g_{ik}\upharpoonright M_i\) is injective this gives \(x=y\). Hence, we’ve shown \(g_i\upharpoonright M_i\) is also injective and that \(g_i\) is a presheaf monomorphism.

We suppose from here on that for each \(i\in I\) we have \(M_i\in\mathop{\mathrm{pSh}}({\Omega,L})\) and for \(i\), \(j \in I\) such that \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\) we have \(g_{ij}\) is an \(L\)-morphisms. This assumption on the morphisms is necessary in order to equip the whole of \(M\) as an \(L\)-structure.

We will next equip \(M\) with structure so that \(M\in \mathop{\mathrm{pSh}}({\Omega,L})\). We have to define the interpretation of constants, relations and functions and show these definitions are good. (Note “\(=\)” is also one of the relations we need to check is interpreted correctly.) We will then check the morphisms are of the appropriate type if the ones in the directed system are of that type.

We have a presheaf of constants \(C\) and need to define a presheaf morphism \(\cdot^M:C\longrightarrow M\) given by \(c\mapsto {\mathfrak c}^{M}\) for \(c\in |C|\).

We already have the interpretations in the \(M_i\), given by the morphisms \(\cdot^{M_i}\). We also have for all \(i\), \(j\in\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\) and \(c\in C\) that \(g_{ij}({\mathfrak c}^{M_i})={\mathfrak c}^{M_j}\).

So we define \(\cdot^M\) by choosing \(i\in I\) and setting \({\mathfrak c}^{M} = ({\mathfrak c}^{M_i},i)_{\sim}\). The usual argument using directedness shows this definition is independent of the choice of \(i\). For any \(j\in I\) then there is \(k\in I\) such that \(i\), \(j\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) and we have \(g_{ik}({\mathfrak c}^{M_i})={\mathfrak c}^{M_k} = g_{jk}({\mathfrak c}^{M_j})\), thus \(({\mathfrak c}^{M_i},i) \sim ({\mathfrak c}^{M_j},j)\).

Recall from Definition (11) that \[|M^n| = \{\hskip 1pt\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle \hskip 2pt:\hskip 2pt\forall i < n \; a_i \in |M| \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\forall i,\hskip 1ptj < n\; E^{M}a_i = E^{M}a_j\hskip 1pt\}.\]

For every function symbol \(\omega\), we define \(\omega^M : |M^n| \longrightarrow |M|\), a presheaf morphism, given by \(\bar{a} \mapsto \omega^M(\bar{a})\) as follows.

Suppose \(\bar{a} = \langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle = \langle\hskip 1pt(x_0,i_0)_\sim,\dots,(x_{n-1},i_{n-1})_\sim\hskip 1pt\rangle\). Exploiting directedness once more, let \(k\in I\) be such that for all \(j<n\) we have \(i_j \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) and for \(j<n\) write \(y_j\) for \(g_{i_j k}(x_j)\). Then \(\bar{a} = \langle\hskip 1pt(y_0,k)_\sim,\dots,(y_{n-1},k)_\sim)\hskip 1pt\rangle\). We set \[\omega^M(\bar{a}) = (\omega^{M_k}(y_0,\dots,y_{n-1}),k)_\sim.\]

We must check this definition is independent of the choice of representatives of \(a_0\), …, \(a_{n-1}\) and of the choice of \(k\). So, for \(j<n\) let \((x'_j,i'_j)\) be such that \((x_j,i_j) \sim (x'_j,i'_j)\) and let \(k'\in I\) be such that for all \(j<n\) we have \(i'_j \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk'\); for \(j<n\) write \(y'_j\) for \(g_{i_j k'}(x'_j)\).

Let \(l\in I\) be such that \(k\), \(k'\hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\). For all \(j<n\) we have \(g_{kl}(y_j)=g_{k'l}(y'_j)\), \(=z_j\), say, and, since \(g_{kl}\), \(g_{k'l}\) are \(L\)-morphisms, \[\omega^{M_k}(y_0,\dots,y_{n-1}) = \omega^{M_l}(z_0,\dots,z_{n-1}) = \omega^{M_{k'}}(y'_0,\dots,y'_{n-1}),\] as required.

It is clear from the definition of \(g_i\) that if \(\bar{a}=\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\in M_i^n\) then \[\omega^M(\langle\hskip 1ptg_i(a_0),\dots,g_i(a_{n-1})\hskip 1pt\rangle)= g_i(\omega^{M_i}(\bar{a})).\]

Now we define the interpretation of relation symbols (including equality). Let \(R\) be an \(n\)-ary relation symbol in \(L\) and \(\bar{a} = \langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle \in |M|^n\). (Note, here, in contrast to the function symbol case just treated, \(\bar{a}\in |M|^n\), and not \(|M^n|\).)

Set \[\begin{align} [R^M(\bar{a})]_M = & \bigvee \{\hskip 1pt[R^{M_k}(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) ) ]_{M_k} \hskip 1pt: \\ & \hskip 1pt\;\;\; (x_0,i_0)\in a_0 , \dots , (x_{n-1},i_{n-1}) \in a_{n-1} \hskip 2pt\hskip 2pt and \hskip 2pt\hskip 2pt i_0,\dots,i_{n-1}\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk \hskip 1pt\} . \end{align}\] If \((x_0,\dots,x_{n-1})\in |M_i|^n\) it is immediate from the definition of \(R^M\) that \([ R^{M_i}(x_0,\dots,x_{n-1}) ]_{M_i} \le [ R^M(g_i(x_0),\dots,g_i(x_{n-1})) ]_M\).

So once we have shown that each \([R(.)]_M\) is a characteristic function we will have shown that for \(i\in I\) we have that \(g_i\) is an \(L\)-morphism.

We next give an alternative characterization, in the general situation where the \(g_{ij}\) for \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\) are simply \(L\)-morphisms, of the interpretation of relation symbols in \(M\). This simplifies some of the proofs below.

Lemma 57. Let \(R\) be a \(n\)-ary relation in \(L\). Let \(\bar{a}=\langle\hskip 1pta_0,\dots,a_{n-1}\hskip 1pt\rangle\in |M|^n\) and suppose for all \(j<n\) that \((x_j,i_j)\in a_j\). Then \[[R(\bar{a}) ]_{M} = \bigvee\{\hskip 1pt [R(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) )]_{M_k}\hskip 2pt:\hskip 2pti_0,\dots, i_k \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\}.\]

That is, there is no need to take the supremum over all representatives of \(\bar{a}\) in the definition of \([R(\bar{a})]_M\), we can simply fix some representatives and take the appropriate supremum with respect to their upwards images as in the right hand side of the equation of this paragraph.

Proof. Let \(\bar{a}\) and the \((x_j,i_j)\) be as in the statement of the lemma. Let \(P = \{\hskip 1pt p\in I \hskip 2pt:\hskip 2pt i_0,\dots i_{n-1}, i'_0,\dots i'_{n-1} \hskip 2pt\mathrel{\triangleleft}\hskip 2ptl and \forall j<n\; g_{i_jl}(x_j)=g_{i'_jl}(x'_j) \hskip 1pt\}\), \(K = \{\hskip 1pt k \in I \hskip 2pt:\hskip 2pt \forall j< n \; i_j \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk \hskip 1pt\}\) and \(K' = \{\hskip 1ptk' \in I \hskip 2pt:\hskip 2pt\forall j< n\; i'_j \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk' \hskip 1pt\}\).

On the one hand, we clearly have \(P \subseteq K \cap K'\). Thus, \[\begin{align} \bigvee_{p \in P} [ R&(g_{i_0p}(x_0),\dots,g_{i_{n-1}p}(x_{n-1}) ) ]_{M_p} \le \\ & \bigvee_{k \in K} [R(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) ) ]_{M_k} , \\ & \bigvee_{k' \in K'} [R(g_{i'_0k'}(x'_0),\dots,g_{i'_{n-1}k'}(x'_{n-1}) ) ]_{M_{k'}}. \end{align}\]

However, on the other hand, for any \(k \in K\) we have some \(p \in P\) such that \[\begin{align} [R&(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) ) ]_{M_k} \le \\ &[ R(g_{i_0p}(x_0),\dots,g_{i_{n-1}p}(x_{n-1}) ) ]_{M_p} \end{align}\] and, likewise, for any \(k' \in K'\) we have some \(p'\in P\) such that \[\begin{align} [R&(g_{i'_0k'}(x'_0),\dots,g_{i'_{n-1}k'}(x'_{n-1}) ) ]_{M_k} \le \\ & [ R(g_{i'_0p'}(x'_0),\dots,g_{i'_{n-1}p'}(x'_{n-1}) ) ]_{M_{p'}} . \end{align}\]

Hence, \[\begin{align} \bigvee_{k \in K} & [R(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) ) ]_{M_k} , \\ & \bigvee_{k' \in K'} [R(g_{i'_0k'}(x'_0),\dots,g_{i'_{n-1}k'}(x'_{n-1}) ) ]_{M_{k'}} \le \\ & \qquad \bigvee_{p \in P} [ R(g_{i_0p}(x_0),\dots,g_{i_{n-1}p}(x_{n-1}) ) ]_{M_p} . \end{align}\]

Hence, all three disjunctions are equal.

Consequently, we have shown that \[[R(\bar{a}) ]_{M} = \bigvee\{\hskip 1pt [R(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) )]_{M_k}\hskip 2pt:\hskip 2pti_0,\dots, i_k \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\} .\] ◻

We next show that each \([R(.)]_M\) is a characteristic function. So, suppose \(R\) is an \(n\)-ary relation symbol in \(L\). For \(\bar{a}\in |M|^n\) let \[\begin{align} X = \{\hskip 1pt(\langle\hskip 1pt(x_0,i_0)_\sim,\dots,(x_{n-1},i_{n-1})_\sim\hskip 1pt\rangle,k) \hskip 1pt: \hskip 1pt\forall & j < n \; ( x_j\in |M_{i_j}|\hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pt\\ & (x_j,i_j)\in a_j \hskip 2pt\hskip 2pt\&\hskip 2pt\hskip 2pti_0\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk ) \} \end{align}\]

Let \(\tilde{x}=(\langle\hskip 1pt(x_0,i_0)_\sim,\dots,(x_{n-1},i_{n-1})_\sim\hskip 1pt\rangle,k) \in X\). For \(j<n\) set \(z_j=g_{i_jk}(x_j)\). Set \(\bar{z}=\bar{z}_{\tilde{x}} = \langle\hskip 1ptz_0,\dots,z_{n-1}\hskip 1pt\rangle\). Since \([R(.)]_{M_k}\) is a characteristic function, we have \([R(\bar{z})]_{M_k} \le E^{M_k}\bar{z}\). Further, since \(g_k\) is a presheaf morphism we have \(E^M\bar{a} = E^{M_k}\bar{z}\).

Thus, \([R(\bar{a})]_M = \bigvee\{\hskip 1pt[R(\bar{z}_{\tilde{x}})]_{M_k}\hskip 2pt:\hskip 2pt\tilde{x} \in X\hskip 1pt\} \le E^Ma\).

Now suppose \(\bar{a}\), \(\bar{b}\in |M|^n\). By directedness choose \(k\in I\) and \(\bar{x}\), \(\bar{y}\in |M_k|^n\) such that for all \(j<n\) we have \(g_k(x_j)=a_j\) and \(g_k(y_j)=b_j\).

By Lemma (57), for the first equality, the distributivity of \(\wedge\) over \(\bigvee\) twice, for the second equality, the fact that the \([R(.)]_{M_l}\) are characteristic functions for all \(l\in I\) for the inequality and Lemma (57), again, for the final equality, we have \[\begin{align} [\bar{a}=\bar{b}]_M & \wedge [R(\bar{b})]_M \\ & = \bigvee\{\hskip 1pt [g_{kl}``\bar{x} = g_{kl}``\bar{y}]_{M_l}\hskip 2pt:\hskip 2ptk \hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\hskip 1pt\} \wedge \bigvee\{\hskip 1pt [R(g_{kl}``\bar{y})]_{M_l}\hskip 2pt:\hskip 2ptk \hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\hskip 1pt\} \\ & = \bigvee\{\hskip 1pt [g_{kl}``\bar{x} = g_{kl}``\bar{y}]_{M_l} \wedge [R(g_{kl}``\bar{y})]_{M_l}\hskip 2pt:\hskip 2ptk \hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\hskip 1pt\} \\ & \le \bigvee\{\hskip 1pt[R(g_{kl}``\bar{x})]_{M_l}\hskip 2pt:\hskip 2ptk \hskip 2pt\mathrel{\triangleleft}\hskip 2ptl\hskip 1pt\} = [R(\bar{a})]_M . \end{align}\]

Thus we have shown that \([R(.)]_M\) is a characteristic function.

We now need to address the cases where the \(g_{ij}\) have further preservation properties.

First of all, let us suppose that for all \(i\), \(k\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) we have that \(g_{ij}\) is a weak \(L\)-monomorpism. We shall show for each \(i\in I\) that \(g_i\) is also a weak \(L\)-monomorphism.

Suppose \(\bar{x}\in |M_i|^n\) and \(\bar{a}=(x_0,i),\dots,x_{n-1},i)_\sim\).

For each \(k\) such that \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) we have \[[R(g_{ik}``\bar{x})]_{M_k} \le \neg\neg [R(g_{ik}``\bar{x})]_{M_k} = \neg\neg [R(\bar{x})]_{M_i} .\] Thus, by Lemma (57) above, we have \[\begin{align} [R(\bar{a})]_{M} = \bigvee& \{\hskip 1pt[R(g_{ik}``\bar{x})]_{M_k} \hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\} \le \\ & \bigvee\{\hskip 1pt\neg\neg [R(g_{ik}``\bar{x})]_{M_k} \hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\} = \neg\neg [R(\bar{x})]_{M_i} \end{align}\]

However, since, as just shown above \(g_i\) is an \(L\)-morphism, we also have \([R(\bar{x})]_{M_i} \le [R(\bar{a})]_M\), and hence \(\neg\neg [R(\bar{x})]_{M_i} \le \neg \neg [R(\bar{a})]_M\).

Thus we have shown \(\neg\neg [R(\bar{x})]_{M_i} = \neg \neg [R(\bar{a})]_M\), as required.

Now, suppose let us suppose that for all \(i\), \(k\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) we have that \(g_{ij}\) is an \(L\)-monomorpism. We shall show for each \(i\in I\) that \(g_i\) is also an \(L\)-monomorphism.

Let \(i\in I\) and \(\bar{x}\in |M_i|^n\) and \(\bar{a}=g_i``\bar{x}\). By Lemma (57) we have that \([R(g_i``\bar{x})]_M = \bigvee\{\hskip 1pt [R(g_{i_0k}(x_0),\dots,g_{i_{n-1}k}(x_{n-1}) )]_{M_k}\hskip 2pt:\hskip 2pti_0,\dots, i_k \hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\}\).

However, by the hypothesis that for each \(k\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) we have \(g_{ik}\) is an restricted \(L\)-monomorphism, we have for each such \(k\) that \([R(\bar{x})]_{M_i} = [R(g_{ik} ``\bar{x})]_{M_{k}}\).

Hence \([R(g_i``\bar{x})]_M = [R(\bar{x})]_{M_i}\).

We remark that, by Proposition (11), for equality, “\(=\)”, we simply need the \(g_{ik}\) to be presheaf monomorphisms.

Penultimately, suppose for all \(i\), \(k\in I\) with \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\) we have \(g_{ij}\) is an elementary \(L\)-embedding. We will show that for all \(i\in I\) we have \(g_i\) is an elementary \(L\)-embedding. We prove this by induction on the complexity of formulae.

By Lemma (45) we only need to consider the quantifiers.

Suppose \(\phi(t,v_0,\dots,v_n )\) is an \(L\)-formula with free variables shown. Let \(i\in I\) and \(\bar{x}\in |M_i|^n\), and for \(j<n\) let \(a_j = (x_j,i)_{\sim}\). Then \[\begin{align} [ \exists t \;\phi(t,\bar{a})]_M & = \bigvee\{\hskip 1pt[\phi(b,\bar{a})]_M \hskip 2pt:\hskip 2ptb\in |M|\hskip 1pt\}\\ & = \bigvee\{\hskip 1pt [\phi(y,g_{ik}``\bar{x})]_{M_k} \hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk \hskip 1pt\hskip 1pt\&\hskip 1pt\hskip 1pty\in |M_k|\hskip 1pt\}\\ & =\bigvee\{\hskip 1pt[\exists t \; \phi(t,g_{ik}``\bar{x})]_{M_k}\hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\} \\ & = [\exists t \;\phi(t,\bar{x})]_{M_i}. \end{align}\]Here the first and third equality are given by the definition of interpretation of existential quantification in \(M\) and the \(M_k\) respectively, while the second equality is given by the inductive hypothesis and the final equality is given by the elementarity of the \(g_{ik}\).

Sentences with a leading universal quantifier are handled similarly.

\[\begin{align} [ \forall t \;\phi(t,\bar{a})]_M & = E\bar{a} \land E\phi \land \bigwedge \{\hskip 1ptEb \longrightarrow [\phi(b,\bar{a})]_M \hskip 2pt:\hskip 2ptb\in |M|\hskip 1pt\}\\ & = E\bar{x} \land E\phi \land \bigwedge \{\hskip 1ptEy \longrightarrow [\phi(y,g_{ik}``\bar{x})]_M \hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk \hskip 1pt\hskip 1pt\& \hskip 1pt\hskip 1pty\in |M_k|\hskip 1pt\}\\ & = \bigwedge \{\hskip 1pt [ \forall t \;\phi(t,g_{ik}``\bar{x})]_{M_k}\hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptk\hskip 1pt\} \\ & = [\forall t \;\phi(t,\bar{x})]_{M_i}, \end{align}\]

We now address sheafification.

By [1], Theorem 2.15, which summarizes [76], Theorem 27.9, Theorem 37.8 and Corollary 37.9, if we apply the sheafification process to both \(A\) and \(M\) (separately), obtaining \(cA\) and \(cM\) there is a unique morphism \(d\) from \(cA\) to \(cM\) such that we get a commutative square

\[\begin{tikzcd} A \arrow{r}{c^A} \arrow{d}{id} & cA \arrow{d}{d} \\ M \arrow{r}{c^M} & cM \end{tikzcd}\]

By the construction (see [76], Example 27.12) we have that \(g\) is a presheaf monomorphism. Specifically, for \(a\in |A|\) we have that \(c^A(a) \in ^{|A|}\Omega\) is the function taking each \(y\in |A|\) to \([a=y]_A\) and \(c^M(a) \in ^{|M|}\Omega\) is the function taking each \(y\in |M|\) to \([a=y]_M\), and, moreover, for all such \(a\) and \(y\) we have \([a=y]_A = [a=y]_M\). Thus \(c^A(a) = c^M(a) \upharpoonright|A|\), where here ‘\(\upharpoonright\)’ is used in the sense of the restriction of a function between two sets to a subset of its domain. Thus for all \(a\in |A|\) we have \(d(c^A(a)) = c^M(a)\).

It is immediate from what we have already shown that for all \(a\in |M|\) that we have \(Ea = \bigvee_{i\in I} \bigvee_{b\in |M|_i} [g_i(b) = a]_M\).

We thus have that \((d``cA,cM)\) is the directed colimit. ◻

We now consider preservation phenomena of a different type to those of the previous section. Rather than concerning individual morphisms, these phenomenona concern situations where \(T\) is a theory, and there is a directed colimit for which all of the objects in the diagram whose colimit we are taking force \(T\) and all of the morphisms in the diagram satisfy certain properties. The preservation property is that the colimit also forces \(T\).

Proposition (56) allows us to prove the following theorem and corollary which should be considered as showing various instances such phenomena.

Theorem 58. Let \(\langle\hskip 1pt\langle\hskip 1ptM_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle,\langle\hskip 1ptg_{ij}\hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\hskip 1pt\rangle\hskip 1pt\rangle\) be a directed system in the category whose objects are \(L\)-structures in \(\mathop{\mathrm{pSh}}({\Omega})\) and whose morphisms are \(L\)-monomorphisms. Let \(\langle\hskip 1ptM,\langle\hskip 1ptg_{i}\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\hskip 1pt\rangle\) be the directed colimit of the system as given by Proposition (56). Let \(\bar{a} \in |M|^m\). For each \(i\in I\) with \(\bar{a} \subseteq \mathop{\mathrm{rge}}(g_i)\) let \(\bar{a}_i\) be such that \(\bar{a} = g_i``\bar{a}_i\).

Let \(\phi(\bar{x},\bar{y})\) be a \({\mathcal{E}}_{1}\)-formula with free variables shown, where \(\mathop{\mathrm{lh}}(\bar{x})=n\) and \(\mathop{\mathrm{lh}}(\bar{y})=m\). If for all \(i\in I\) with \(\bar{a}\subseteq \mathop{\mathrm{rge}}(g_i)\) we have \(M_i\Vdash\forall \bar{x} \hskip 2pt\hskip 2pt\phi(\bar{x},\bar{a}_i)\), then we also have \(M\Vdash\forall \bar{x} \hskip 2pt\hskip 2pt\phi(\bar{x},\bar{a})\).

Proof. By Proposition (32) it suffices to show that for all \(\bar{b}\in |M|^n\) we have \(E\phi \wedge E\bar{a} \wedge E\bar{b} \hskip 2pt\hskip 2pt\le [\phi(\bar{t},\bar{a})]_M\). So let \(\bar{b}\in |M|^n\) and let \(i\in I\) be such that \(\bar{b}\), \(\bar{a} \subseteq \mathop{\mathrm{rge}}(g_i)\). Let \(\bar{b}_i\) be such that \(g_i``\bar{b}_i = \bar{b}\).

By the hypothesis on \(M_i\) we have \(E\phi \wedge E\bar{a}_i \wedge E\bar{b}_i \hskip 2pt\hskip 2pt\le [\phi(\bar{b}_i,\bar{a}_i)]_{M_i}\) (again using Proposition (32)).

As \(g_i\) is a presheaf morphism \(E\bar{a} = E\bar{a}_i\) and \(E\bar{b}=E\bar{b}_i\). As \(g_i\) is an \(L\)-monomorphism, by Lemma (49) we have \([\phi(\bar{b}_i,\bar{a}_i)]_{M_i} \le [\phi(\bar{b},\bar{a})]_M\). Thus \(E\phi \wedge E\bar{a} \wedge E\bar{b} = E\phi \wedge E\bar{a}_i \wedge E\bar{b}_i \hskip 2pt\hskip 2pt\le [\phi(\bar{b},\bar{a}_i)]_{M_i} \le [\phi(\bar{b},\bar{a})]_M\), as required. ◻

Corollary 59. Let \({\mathfrak C}\) and \(T\) be any of the following pairs:

Let \(\langle\hskip 1pt\langle\hskip 1pt(A_i, M_i)\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle,\langle\hskip 1ptg_{ij}\hskip 2pt:\hskip 2pti\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\hskip 1pt\rangle\hskip 1pt\rangle\) be a directed system in \({\mathfrak C}\), where if \(i\hskip 2pt\mathrel{\triangleleft}\hskip 2ptj\) then \((A_i,M_i) \xlongrightarrow{g_{ij}} (A_j,M_j)\) is a morphism in the category. Then the colimit of the directed system exists in \({\mathfrak C}\).

Proof. Immediate from Proposition (56), the definition of elementary \(L\)-embedding and Theorem (58). ◻

5 Presheaves and sheaves of models and accessibility↩︎

We start by introducing the category theoretic notions of presentability and accessiblity. The reader can consult, for example, [91] and [92] for further information on this area of category theory.

Definition 57. Let \(\lambda\) be a regular cardinal and \({\mathcal{C}}\) a category.

A \({\mathcal{C}}\)-object \(M\) is \(\lambda\)-presentable* if given \(\langle\hskip 1ptN,\langle\hskip 1pt\phi_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\hskip 1pt\rangle\), the colimit in \({\mathcal{C}}\) of a \(\lambda\)-directed system \(\langle\hskip 1pt\langle\hskip 1ptN_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle,\langle\hskip 1pt\phi_{ij}:N_i\longrightarrow N_j\hskip 2pt:\hskip 2pti\le_I j,\hskip 2pt\hskip 2pti,\hskip 2ptj\in I\hskip 1pt\rangle\hskip 1pt\rangle\), and \(f : M \longrightarrow N\), a \({\mathcal{C}}\)-morphism, there is some \(i\in I\) and \({\mathcal{C}}\)-morphism \(g:M\longrightarrow N_i\) such that \(f = \phi_i\cdot g\).*

The presentability rank* of an object \(M\) of \({\mathcal{C}}\) is the smallest regular cardinal \(\kappa\) such that \(M\) is \(\kappa\)-presentable.*

The inaccessible presentability rank* of an object \(M\) of \({\mathcal{C}}\) is the smallest strongly inaccessible cardinal \(\kappa\) such that \(M\) is \(\kappa\)-presentable.*

Definition 58. A category \({\mathcal{C}}\) is \(\lambda\)-accessible if it is closed under \(\lambda\)-directed colimits (i.e., colimits indexed by a \(\lambda\)-directed partially ordered set) and contains, up to isomorphism, a set \(R\) of \(\lambda\)-presentable objects such that each object of \(\mathcal{C}\) is a \(\lambda\)-directed colimit of objects from \(R\).

Definition 59. A category \({\mathcal{C}}\) is accessible* if there is some \(\lambda\) for which it is \(\lambda\)-accessible.*

We now show how certain of the categories discussed in the previous section are accessible. Note for our second theorem that we require the mild set theoretic hypothesis that there is an strongly inacessible cardinal larger than the sizes of \(L\) and \(\Omega\). Clearly to prove the theorem for all possible \(L\) or all possible \(\Omega\) we would need a proper class of strongly inaccessible cardinals.

Theorem 60. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\chi(\Omega)\) be a regular cardinal. Let \({\mathfrak C}\) be any of the categories \((\normalfont \bfseries bdSubShMod(T),\normalfont \bfseries ShMod(T))_x\), where either \(x=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(x=\)elt-\(L\)-emb (and \(T\) is arbitrary). Then \({\mathfrak C}\) is \(\lambda\)-accessible.

Moreover, if \(\kappa\) is a regular cardinal then \((A,M)\in {\mathfrak C}\) has presentability rank \(\kappa^+\) if and only if \(d(M)=\kappa\).

Theorem 61. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}\) be an strongly inaccessible cardinal. Let \({\mathfrak C}\) be any of the categories of the form \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries ShMod(T))_x\), \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries pShMod(T))_y\) or \((\normalfont \bfseries SubShMod(T),\normalfont \bfseries ShMod(T))_z\), for each \(v\in \{\hskip 1ptx,y,z\hskip 1pt\}\) where either \(v=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(v=\)elt-\(L\)-emb (and \(T\) is arbitrary). Then \({\mathfrak C}\) is \(\lambda\)-accessible.

We prove the two theorems together, with the argument bifurcating in a couple of places in ways corresponding to the differing hypotheses. The idea of the proof to use the collection of isomorphism types of models of density less than \(\lambda\) as the presentable objects. This is a candidate collection of representatives as we have see in Proposition (20) that there are only a set many of these isomorphism types, and not a proper class as one might have imagined a priori. It remains to show that every element of \({\mathfrak C}\) can be represented as a \(\lambda\)-directed colimit of such models and that every such model is \(\lambda\)-presentable; it is only in showing the latter that the proof of the statements of the two theorem bifurcates.

In the course of the proof we will need (the general version of) Miraglia’s downward Löwenheim-Skolem theorem for sheaves of structures, and thus we introduce this here.

Definition 60. For any complete Heyting algebra \(\Omega\) the cardinal character* of \(\Omega\), \(\chi(\Omega)\), is the least cardinal \(\kappa\) such that for all \(X\subseteq \Omega\) there are \(Y\), \(Z\in [\Omega]^{\le\kappa}\) such that \(\bigvee X=\bigvee Y\) and \(\bigwedge X = \bigwedge Z\).*

Note that the cardinal character of a complete Heyting algebra is always defined since, at worst, we always have \(\chi(\Omega) \le \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}\).

Definition 61. Let \(\mu(\Omega,L) = \max(\{\hskip 1pt\chi(\Omega),\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\hskip 1pt\})\)

Proposition 62. (Downward Löwenheim-Skolem theorem, [2]) Let \(\Omega\) be a complete Heyting algebra and \(L\) a first order language with equality. Let \(M\in \mathop{\mathrm{pSh}}({\Omega,L})\) (resp. \(\mathop{{\mathrm{Sh}}}({\Omega,L})\)). For all \(\kappa\ge \mu(\Omega,L)\) and all \(X\in [|M|]^\kappa\) there is an elementary substructure \(N\) of \(M\) such that \(X\subseteq |N|\) and \(d(N)\le \kappa\).

Moreover, if \(A\) is a subpresheaf of \(M\) then \({A\cap N}\) is a subpresheaf of \(N\); if \(M\) is a sheaf and \(A\) is a subsheaf of \(M\) then \({A\cap N}_s\) is a subsheaf of \(N\); and if \(M\) is a sheaf and \(Y\subseteq X\) then \(\lcurvyangle Y \rcurvyangle_s\) is a subsheaf of \(N\).

Proof. See [2], Theorem 3.1 and Corollary 3.1. The proof given there is for complete Heyting algebras with countable character, countable languages and countable subsets of the model, but the alterations required for the general case (already envisaged in [2] and stated here) are trivial.

The clauses in the second paragraph of the statement are all immediate from Lemma (14) and Lemma (15). ◻

We now start the proofs of Theorems (60) and (61).

Proof.

Lemma 63. Let \({\mathfrak C}\) be a category as in Theorem (60) and \((A,M) \in \mathop{\mathrm{ob}}({\mathfrak C})\). Then \((A,M)\) is a \(\lambda\)-directed colimit of the set of its elementary substructures \((A',M')\) with \(d(A') \le d(M') < \lambda\).

Proof. Let \({\mathcal{M}}\) be the collection of all substructures \((A',M')\) of \((A,M)\) with \(d(A')\le d(M') < \lambda\) and such that the inclusion map is a morphism. Let \({\mathcal{N}} \in [\mathcal{M}]^{<\lambda}\) and for \((B,N)\in {\mathcal{N}}\) let \(D_B\) be dense in \(B\) and let \(D_N\) be a superset of \(D_B\) dense in \(N\) and such that \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{D_N}\hfil\crcr}}}\hfil\crcr}} <\lambda\).

Let \(S= \bigcup_{(B,N)\in {\mathcal{N}}} D_N\) and let \(T=\bigcup_{(B,N)\in {\mathcal{N}}} D_B\). Note, here \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{S}\hfil\crcr}}}\hfil\crcr}}<\lambda\), as it is the union of fewer than \(\lambda\) many sets of size less than \(\lambda\), and \(d(S) \le \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{S}\hfil\crcr}}}\hfil\crcr}}\).

By the downward Löwenheim-Skolem theorem (Proposition 62) there is some elementary substructure \(P\) of \(M\) with \(d(P)<\lambda\) and \(S\subseteq |P|\). Thus \(P\in {\mathcal{M}}\).

Further, by the second paragraph of the statement of the theorem, \(C=\lcurvyangle T \rcurvyangle_s\) is a subsheaf of \(P\) and \(d(C) \le d(P)\).

Since for every \((B,N)\in {\mathcal{N}}\) we have \(D_N \subseteq S\subseteq P\), by Lemma (17) we have that \(N\subseteq P\).

Hence, by Proposition (36), we have for every \((B,N)\in {\mathcal{N}}\) that \((B,N)\) is a substructure of \((C,P)\) such that the inclusion map is a morphism.

Thus we have shown that \({\mathcal{M}}\) is \(\lambda\)-directed. ◻

Lemma 64. Let \({\mathfrak C}\) be a category as in Theorem (61) and \((A,M) \in \mathop{\mathrm{ob}}({\mathfrak C})\). Then \((A,M)\) is a \(\lambda\)-directed colimit of the collection of its elementary substructures \((A',M')\) with \(d(M') < \lambda\).

Proof. Let \({\mathcal{M}}\) be the collection of all substructures of \((A,M)\) with density less than \(\lambda\), equivalently of size less than \(\lambda\) and such that the inclusion map is a morphism.

By Proposition (20) and elementary cardinal arithmetic \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\bigcup {\mathcal{N}}}\hfil\crcr}}}\hfil\crcr}} < \lambda\). Set \(S= \bigcup {\mathcal{N}}\) and note that \(d(S) \le \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{S}\hfil\crcr}}}\hfil\crcr}}\).

By the downward Löwenheim-Skolem theorem (Proposition 62) there is some elementary substructure \(P\) of \(M\) with \(d(P)<\lambda\) and \(S\subseteq |P|\). Thus \(P\in {\mathcal{M}}\).

It is immediate from the definition of \(S\) that for every \((B,N)\in {\mathcal{N}}\) we have that \(N\subseteq P\).

Hence, by Proposition (36), we have for every \(N\in {\mathcal{N}}\) that \(N\) is an substructure of \(P\) such that the inclusion map is a morphism.

Now set \(C = \langle\hskip 1pt\bigcup \{\hskip 1ptB\subseteq M\hskip 2pt:\hskip 2pt(B,N)\in {\mathcal{N}}\hskip 1pt\}\hskip 1pt\rangle\). Then \(C\) is a subpresheaf of \(P\) and clearly for \((B,N)\in {\mathcal{N}}\) we have \(B\subseteq C\). Consequently \((C,P)\) witnesses \(\lambda\)-directed in the instance of \(\mathcal{N}\).

Thus we have shown that \({\mathcal{M}}\) is \(\lambda\)-directed. ◻

The next lemma is where in the proof of Theorem (60) we have need of the constraint on \({\mathfrak C}\)-objects which are pairs consisting of a sheaf and a subsheaf that the subsheaves are of density no larger than the that of the larger sheaves.

Here we need also that the maps in the diagram, and hence the morphisms in the category, are in fact of the form required for Proposition (36). This is what restricts our results to categories whose morphisms are \(L\)-monomorphisms or elementary \(L\)-embeddings.

Lemma 65. Let \({\mathfrak C}\) be a category as in Theorem (60). Every \((A,M) \in \mathop{\mathrm{ob}}({\mathfrak C})\) with \(d(A) \le d(M)<\lambda\) is \(\lambda\)-presentable.

Proof. Suppose \(d(A)\le d(M)<\lambda\), \((B,N)\in {\mathfrak C}\) is a colimit of the \(\lambda\)-directed system \(\langle\hskip 1pt\phi_{ij}:(B_i,N_i)\longrightarrow (B_j,N_j)\hskip 2pt:\hskip 2pti\le_I j,\hskip 2pt\hskip 2pti,\hskip 2ptj\in I\hskip 1pt\rangle\) and \(f:(A,M)\longrightarrow (B,N)\) is an \(x\)-morphism. By Proposition (56), \(|N| = \bigcup_{i\in I} \phi_i ``N_i\) and \(|B|=\bigcup_{i\in I} \phi_i ``B_i\).

There is some \(i\in I\) such that \(f``M \subseteq \phi``N_i\).

Proof. As \(f\) is a sheaf morphism, we have \(d(f ``M) = d(M)<\lambda\). Let \(D\in [f ``M]^{<\lambda}\) be dense in \(f `` M\). By the \(\lambda\)-directedness of the system there is some \(i\in I\) such that \(D\subseteq \phi_i ``N_i\). By Corollary (17) (with \(f ``M\) for \(A\), \(D\) for \(D\), \(\phi_i `` N_i\) for \(N\) and \(N\) for \(P\)), we have \(f `` M \subseteq \phi_i `` N_i\). ◻

Fix \(N_i\) as in the sublemma. By Proposition (36), we have that \(f``M\) is an submodel of \(\phi_i``N_i\) and the inclusion is a morphism.

Thus \(\phi_i^{-1}\cdot f\) is the desired factorization of \(f\) through \(\phi_i\). Moreover, the factorization is unique: if \(g : M\longrightarrow N_i\) with \(\phi_i \cdot g = f = \phi_i \cdot (\phi_i^{-1}\cdot f)\) then since \(\phi_i\) is a monomorphism we have \(g = \phi_i^{-1}\cdot f\). ◻

Lemma 66. Let \(\lambda\) be strongly inaccessible and \({\mathfrak C}\) a category as in Theorem (61). Every \((A,M) \in \mathop{\mathrm{ob}}({\mathfrak C})\) with \(d(M)<\lambda\) is \(\lambda\)-presentable.

Proof. Suppose \(d(A)\le d(M)<\lambda\), \((B,N)\in {\mathfrak C}\) is a colimit of the \(\lambda\)-directed system \(\langle\hskip 1pt\phi_{ij}:(B_i,N_i)\longrightarrow (B_j,N_j)\hskip 2pt:\hskip 2pti\le_I j,\hskip 2pt\hskip 2pti,\hskip 2ptj\in I\hskip 1pt\rangle\) and \(f:(A,M)\longrightarrow (B,N)\) is an \(x\)-morphism. By Proposition (56), \(|N| = \bigcup_{i\in I} \phi_i ``N_i\) and \(|B|=\bigcup_{i\in I} \phi_i ``B_i\).

There is some \(i\in I\) such that \(f``M \subseteq \phi``N_i\).

Proof. We have \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{f``M}\hfil\crcr}}}\hfil\crcr}} = \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{M}\hfil\crcr}}}\hfil\crcr}} \le \vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}^{d(M)} <\lambda\). Thus, by the \(\lambda\)-directedness of the system, there is some \(i\in I\) such that \(f``M \subseteq \phi``N_i\). ◻

Fix \(N_i\) as in the sublemma. By Proposition (36), we have that \(f``M\) is an submodel of \(\phi_i``N_i\) and the inclusion is a morphism.

Thus \(\phi_i^{-1}\cdot f\) is the desired factorization of \(f\) through \(\phi_i\). Moreover, the factorization is unique: if \(g : M\longrightarrow N_i\) with \(\phi_i \cdot g = f = \phi_i \cdot (\phi_i^{-1}\cdot f)\) then since \(\phi_i\) is a monomorphism we have \(g = \phi_i^{-1}\cdot f\). ◻

This completes the proof of the main two parts of the theorems.

Lemma 67. Let \({\mathfrak C}\) be a category as in Theorem (60) or Theorem (61). Every \((A,M) \in \mathop{\mathrm{ob}}({\mathfrak C})\) which is \(\lambda\)-presentable has \(d(M)<\lambda\). Moroever, if \({\mathfrak C}\) a category as in Theorem (60) then \(d(A)\le d(M)\).

Proof. By Lemma (63) and Lemma (64), respectively, any \((A,M)\in {\mathcal{K}}\) is the \(\lambda\)-directed colimit of the collection, \({\mathcal{M}}\), of its substructures \((B,N)\) with the property that \(d(B)\le d(N)<\lambda\) in the former case and \(d(N)<\lambda\) in the latter.

Consider \(id:M\longrightarrow M\). If \((A,M)\) is \(\lambda\)-presentable this map factors through the identity inclusion of some \(N\in {\mathcal{M}}\) into \(M\). However, the inclusions are monomorphisms, so we have \(M=N\) and thus \(d(M)<\lambda\). ◻

The final paragraph of the theorem is now immediate from Lemma (65), or Lemma (66), and Lemma (67). ◻

Let \({\mathfrak C}\) be a category and \(\lambda\) a strongly inaccessible cardinal as in as Theorem (61). Then Lemma (66) and Lemma (67) show that for any \((A,M)\in {\mathrm ob({\mathfrak C})}\) we have \(d(M)<\lambda\) if and only if \((A,M)\) is \(\lambda\)-presentable. Hence inaccessible presentability rank, a category theoretic notion, matches up with density, a presheaf theoretic notion, albeit at a less finely-grained scale than that at which presentability rank matches up with sheaf theoretic density.

6 Presheaves and sheaves of models and independence relations↩︎

Kamsma ([3]) gives a framework in which he develops a theory of independence relations extending that applicable to NSOP\(_1\) theories in first order model theory.

Definition 62. ([3], Definition 2.2) An AECat* consists of a pair \(({\mathcal{C}},{\mathcal{M}})\) where \(\mathcal{C}\) and \(\mathcal{M}\) are accessible categories, \(\mathcal{M}\) is a full subcategory of \(C\), \(\mathcal{M}\) has directed colimits which the inclusion functor into \(\mathcal{C}\) preserves, and all morphims in \(\mathcal{C}\) (and hence in \(\mathcal{M}\)) are monomorphism.*

Definition 63. We say \((\mathcal{C}, \mathcal{M})\) has the amalgamation property* (AP) if \(\mathcal{M}\) has the amalgamation property.*

We have already seen in Corollary (59) that the categories for which we proved Theorem (60) and Theorem (61) have directed colimits. In these categories the morphisms are all monomorphisms. Hence, the following propositions are immediate.

Proposition 68. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\chi(\Omega)\) be a regular cardinal. Let \({\mathfrak C}\) be any of the categories \((\normalfont \bfseries bdSubShMod(T),\normalfont \bfseries ShMod(T))_x\), where either \(x=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(x=\)elt-\(L\)-emb (and \(T\) is arbitrary). Let \({\mathfrak M}\) be in each case the full subcategory of \({\mathfrak C}\) whose class of objects consists of all pairs of the form \((M,M)\). Then \(({\mathfrak C},{\mathfrak M})\) is an AECat.

Proposition 69. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}\) be an strongly inaccessible cardinal. Let \({\mathfrak C}\) be any of the categories of the form \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries ShMod(T))_x\), \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries pShMod(T))_y\) or \((\normalfont \bfseries SubShMod(T),\normalfont \bfseries ShMod(T))_z\), where for \(v\in \{\hskip 1ptx,y,z\hskip 1pt\}\) either \(v=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(v=\)elt-\(L\)-emb (and \(T\) is arbitrary). Let \({\mathfrak M}\) be in each case the full subcategory of \({\mathfrak C}\) whose class of objects consists of all pairs of the form \((M,M)\). Then \(({\mathfrak C},{\mathfrak M})\) is an AECat.

The main results of [3] are uniqueness theorems for independence relations on Galois types for AECats with the amalgamation property.

The theorems are of the form that an independence relation satisfying certain conditions coincides with non-dividing or non-forking for various notions of dividing and forking for Galois types, in particular so called isi-dividing, isi-forking and long Kim-dividing, where ‘isi’ abbreviates initial segment invariant.

We give the definitions adapted to our categories under the hypotheses that they have the amalgamation property.

Galois types are equivalence classes of pairs \((\langle\hskip 1pta_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M,M))\) where for each \(i\in I\) we have that \(a_i:(A_i,M_i)\longrightarrow (M,M)\) is a morphism.

Definition 64. Let \((\langle\hskip 1pta_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M,M))\), \((\langle\hskip 1pta'_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M',M'))\) be pairs where for each \(i\in I\) we have that \(a_i:(A_i,M_i)\longrightarrow (M,M)\) and \(a'_i:(A'_i,M'_i)\longrightarrow (M',M')\) and are morphisms. We say \((\langle\hskip 1pta_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M,M))\) and \((\langle\hskip 1pta'_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M',M'))\) are of the same Galois type* and write \(\mathop{\mathrm{gtp}}(\langle\hskip 1pta_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M,M))=\mathop{\mathrm{gtp}}(\langle\hskip 1pta'_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle;(M',M'))\) if for all \(i\in I\) we have that \((A_i,M_i=(A'_i,M'_i)\) and there are morphisms \(m:(M,M)\longrightarrow (N,N)\) and \(m':(M',M')\longrightarrow (N,N)\) such that for each \(i\in I\) we have that the following diagram commutes. \[\begin{tikzcd} (A_i,M_i) \arrow{r}{a} \arrow[swap]{d}{a'} & (M,M) \arrow{d}{m} \\ (M',M') \arrow{r}{m'} & (N,N) \end{tikzcd}\]*

Definition 65. Let \(\kappa\) be a cardinal. A sequence \(\langle\hskip 1ptb_i\hskip 2pt:\hskip 2pti\in \kappa\hskip 1pt\rangle\), where for all \(i<\kappa\) we have \(b_i:(B,M)\longrightarrow (N,N)\), and a continuous chain of initial segments \(\langle\hskip 1ptN_i\hskip 2pt:\hskip 2pti\in \kappa\hskip 1pt\rangle\) is an initial segment invariant* (isi-) sequence if for all \(i<j<\kappa\) we have \(\mathop{\mathrm{gtp}}(b_i,n_i;N) = \mathop{\mathrm{gtp}}(b_j,n_i;N)\) and \(a_i\) factors through \(m_{i+1}\). The sequence is an isi-sequence over \(c\) for some \(c:(C,N_C)\longrightarrow N\) if \(c\) factors through \(n_0:(N_0,N_0)\longrightarrow (N,N)\).*

Definition 66. Let \(a:(A,M_A) \longrightarrow (M,M)\), \(b:(B,M_B) \longrightarrow (M,M)\), \(c:(C,M_C) \longrightarrow (M,M)\) be morphisms. Let \(m:(M,M)\longrightarrow (N,N)\) be a morphism and \(\langle\hskip 1ptb_i:(B,M_B)\longrightarrow (N,N)\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\) a sequence of morphisms such that for all \(i\in I\) we have that \(\mathop{\mathrm{gtp}}(b_i,c;N)=\mathop{\mathrm{gtp}}(b,c;M)\). We say \(\mathop{\mathrm{gtp}}|(a,b,c;M)\) is inconsistent with \(\langle\hskip 1ptb_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\) if there is no morphism \(n:(N,N)\longrightarrow (P,P)\) such that there is a morphism \(a':(A,M_A)\longrightarrow (P,P)\) such that for all |\(i\in I\) we have \(\mathop{\mathrm{gtp}}(a',b_i,c;P)=\mathop{\mathrm{gtp}}(a,b,c;M)\)

We say \(\mathop{\mathrm{gtp}}(a,b,c;M)\) long divides* over \(c\) if there is some regular cardinal \(\mu\) such that for all regular \(\lambda>\mu\) there is a morphism \(m:(M,M)\longrightarrow (N,N)\) and a sequence of morphisms \(\langle\hskip 1ptb_i:(B_i,M_i)\longrightarrow (N,N)\hskip 2pt:\hskip 2pti<\lambda\hskip 1pt\rangle\) such that for all \(i\in I\) we have that \(\mathop{\mathrm{gtp}}(b_i,c;N)=\mathop{\mathrm{gtp}}(b,c;M)\) and there is some cardinal \(\kappa<\lambda\) such that for every \(I\in [\lambda]^{\kappa}\) we have that \(\mathop{\mathrm{gtp}}(a,b,c;M)\) is inconsistent with \(\langle\hskip 1ptb_i\hskip 2pt:\hskip 2pti\in I\hskip 1pt\rangle\).*

We say \(\mathop{\mathrm{gtp}}(a,b,c;M)\) isi-divides* over \(c\) if the \(\langle\hskip 1pt-\hskip 1pt\rangle of{b_i}{i<\lambda}\) are required to be isi-sequences over \(c\). We write \((A,M_A) \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-d}}_{(C,M_C)} } (B,M_B)\) if \(\mathop{\mathrm{gtp}}(a,b,c;M)\) does not isi-divide over \(c\).*

Kamsma remarks that isi-forking says \(\mathop{\mathrm{gtp}}(a,b,c;M)\) implies a a collection of Galois types each isi-dividing over \(c\) – we omit the details from [3]. We similarly write \((A,M_A) \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-f}}_{(C,M_C)} } (B,M_B)\) if \(\mathop{\mathrm{gtp}}(a,b,c;M)\) does not isi-fork over \(c\).

Long Kim-dividing is exactly as long dividing, but with the additional requirement that the \(\langle\hskip 1ptb_i\hskip 2pt:\hskip 2pti<\lambda\hskip 1pt\rangle\) are \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-f}}_{c} }\)-independent, that is for all \(i<\lambda\) we have \(b_i \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{N}_{c} } N_i\). This time we write \((A,M_A) \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{lK}}_{(C,M_C)} } (B,M_B)\) if \(\mathop{\mathrm{gtp}}(a,b,c;M)\) does not long Kim-divide over \(c\).

Kamsma’s principle results as applied to our categories are the following. (Again, we eschew the definitions of simple and NSOP\(_1\)-like independence relations and what exactly the \(B\)-existence axiom may be in the following two propositions. The reader should refer to [3] for the details. Our point is to note that isi-dividing and forking and long Kim-dividing play a canonical rôle.)

Proposition 70. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\chi(\Omega)\) be a regular cardinal. Let \({\mathfrak C}\) be any of the categories \((\normalfont \bfseries bdSubShMod(T),\normalfont \bfseries ShMod(T))_x\), where either \(x=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(x=\)elt-\(L\)-emb (and \(T\) is arbitrary) and suppose \(\normalfont \bfseries ShMod(T))_x\) has the amalgamation property.

If \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} }\) is a simple* independence relation, \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-d}}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-f}}_{} }\) over \(\mathrm{base}( \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } )\).*

Suppose \(B\) is some base class* and \((\normalfont \bfseries bdSubShMod(T),\normalfont \bfseries ShMod(T))_x\) satisfies the \(B\)-existence axiom. If \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} }\) is an \(\mathrm{NSOP}_1\)-like independence relation over \(B\), then \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{lK}}_{} }\).*

Proposition 71. Let \(\lambda>\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{L}\hfil\crcr}}}\hfil\crcr}}\), \(\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\vbox{\ialign{##\crcr \cleaders\hrule height.2pt\hfill\crcr\noalign{\kern 1pt\nointerlineskip} \hfil\displaystyle{\Omega}\hfil\crcr}}}\hfil\crcr}}\) be an strongly inaccessible cardinal. Let \({\mathfrak C}\) be any of the categories of the form \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries ShMod(T))_x\), \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries pShMod(T))_y\) or \((\normalfont \bfseries SubShMod(T),\normalfont \bfseries ShMod(T))_z\), where for \(v\in \{\hskip 1ptx,y,z\hskip 1pt\}\) either \(v=L\)-mono and the theory \(T\) is a set of \(\forall{\mathcal{E}}_{1}\) sentences, or \(v=\)elt-\(L\)-emb (and \(T\) is arbitrary), and suppose \(\normalfont \bfseries ShMod(T))_x\) or \(\normalfont \bfseries pShMod(T))_y\), respectively, has the amalgamation property.

If \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} }\) is a simple* independence relation, \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-d}}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{isi-f}}_{} }\) over \(\mathrm{base}( \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } )\).*

Suppose \(B\) is some base class* and suppose \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries ShMod(T))_x\), \((\normalfont \bfseries SubpShMod(T),\normalfont \bfseries pShMod(T))_y\) or \((\normalfont \bfseries SubShMod(T),\normalfont \bfseries ShMod(T))_z\), respectively, satisfies the \(B\)-existence axiom. If \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} }\) is a \(\mathrm{NSOP}_1\)-like independence relation over \(B\), then \(\mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{}_{} } = \mathrel{ \mathop{ \vcenter{ \oalign{\noalign{\kern-.3ex}\hfil\vert\hfil\cr \noalign{\kern-.7ex} \smile\cr\noalign{\kern-.3ex}} } }\displaylimits^{\mathrm{lK}}_{} }\).*

Proof. The propositions are immediate from Corollary (68) and Corollary (69), respectively, by [3], Theorems (1.2) and (1.1). ◻

References↩︎

[1]
Andreas Brunner and Francisco Miraglia, The method of diagrams for presheaves of \(L\)-structures, Séminaire de Structures, Algébriques Ordonnées, Paris, (2014), 1-24.
[2]
Francisco Miraglia, The downward Löwenheim-Skolem theorem for L-structures in \(\Omega\)-sets, in Walter Carnielli and Luź de Alcantara (eds), Methods and Applications of Mathematical Logic, Contemporary Mathematics, 69, American Mathematical Society (1988), 189-208.
[3]
Mark Kamsma, NSOP\(_1\)-like independence in AECats, Journal of Symbolic Logic, 89(2), (2024), 724-757.
[4]
Ehud Hrushovski, The Manin-Mumford conjecture and the model theory of difference fields, Annals of Pure and Applied Logic, 112, (2001), 43–115.
[5]
Alex Kruckman and Nicholas Ramsey, A new Kim’s lemma, Model Theory, 3(3), (2024), 825-860.
[6]
Scott Mutchnik, On NSOP\(_2\) theories, to appear in Journal of the European Mathematical Society, preprint: arXiv:2206.08512, (2023), 21pp.
[7]
Scott Mutchnik, Properties of independence in NSOP\(_3\) theories, preprint: arXiv:2305.09908, (2023), 29pp.
[8]
Scott Mutchnik, Conant-independence and generalized free amalgamation, to appear in Journal of Mathematical Logic, preprint: arxiv:2210.07527, (2024), 29pp.
[9]
Christian D’Elbé, Generic expansions by a reduct, Journal of Mathematical Logic, 21(3), (2021).
[10]
Itaï Ben Yaacov and Alexander Usvyatsov, Continuous first order logic and local stability, Transactions of the American Mathematical Society, 362(10), (2010), 5213-5259.
[11]
Karim Khanaki, Stability, the NIP, and the NSOP: model theoretic properties of formulas via topological properties of function spaces, Mathematical Logic Quarterly, 66(2), (2020), 136-149.
[12]
Alexander Berenstein, Tapani Hyttinen and Andres Villaveces, Hilbert spaces with generic predicates Revista Colombiana de Matemáticas, 52(1), (2018), 107-130.
[13]
Haynes Miller, Leray in Oflag XVIIA: The origins of sheaf theory, sheaf cohomology, and spectral sequences, in Jean Leray (1906-1998), Gazette des Mathematicens, 84 suppl, (2000), 17–34.
[14]
Jiří Pavelka, On fuzzy logic I, II, III, Z. Math. Logik Grundlagen Math., 25, (1979), 45-52, 119-134, 447-464.
[15]
Petr Hájek, Metamathematics of fuzzy logic, Kluwer, 1998.
[16]
Itaï Ben Yaacov and Arthur Pedersen, A proof of completeness for continuous first-order logic Journal of Symbolic Logic, 75(1), (2010) 168-190.
[17]
Jouko Väänänen, Model theory of second order logic in ed. Jose Iovino, Beyond First Order Model Theory, Volume II, Chapman and Hall, (2023), 290-316.
[18]
Peter Johnstone, Sketches of an elephant: a topos theory compendium, Oxford Logic Guides, 43, 44, Oxford University Press, (2002).
[19]
Leonard Lipschitz and Dan Saracino, The model companion of the theory of commutative rings without nilpotent elements, Proceedings of the American Mathematical Society, 38, (1973), 381-387.
[20]
Andrew Carson, The model completion of the theory of commutative regular rings, Journal of Algebra, 27, (1973), 136-146.
[21]
Angus Macintyre, Model-completeness for Sheaves of Structures, Fundamenta Mathematica, 81, (1973), 73-89.
[22]
George Loullis, Sheaves and Boolean valued model theory, Journal of Symbolic Logic, 44(2), (1979).
[23]
Stephen Comer, Elementary properties of structures of sections, Boletin de la Sociedad Matematica Mexicana, 19, (1974), 78-85.
[24]
Stephen Comer, Complete and model complete theories of monadic algebras, Colloquium Mathematicum, 34(2), (1976), 183-190.
[25]
Stanley Burris and Heinrich Werner, Sheaf constructions and their elementary properties, Transactions of the American Mathematical Society, 248, (1979), 269-309.
[26]
Stanley Burris and Heinrich Werner, Remarks on Boolean products Algebra Universalis, 10, (1980), 333-344.
[27]
Peter Pappas The model-theoretic structure of abelian group rings, Annals of Pure and Applied Logic, 28, (1985), 163-201.
[28]
Hugo Volger, The Feferman-Vaught Theorem, revisited, Colloquium Mathematicum, 36, (1976), 1-11.
[29]
Hugo Volger, Preservation Theorems for Limits of Structures and Global Sections of Sheaves of Structures, Mathematische Zeitschrift, 166, (1979), 27-54.
[30]
Hugo Volger, Filtered powers and stable boolean powers are relativized full boolean powers, Algebra Universalis, 19 (1984), 399-402.
[31]
René Lavendhomme and T. E. Lucas, A non-Boolean version of Feferman–Vaught’s theorem, Mathematical Logic Quarterly (Zeitschrift für mathematische Logik und Grundlagen der Mathematik), 31(19–20), (1985), 299–308.
[32]
Volker Weispfenning, Model-completeness and elimination of quantifiers for subdirect products of structures, Journal of Algebra, 36, (1975), 252-277.
[33]
Zoe Chatzdakis, La reprśentation en termes de faisceaux des modèles de la théorie élémentaire de la multiplication des entiers naturels, in eds. Chantal Berline, Kenneth McAloon, Jean-Pierre Ressayre, Model Theory and Arithmetic, Lecture Notes in Mathematics 890, Springer, (1981) 90-110.
[34]
Claude Sureson, A valuation ring analogue of von Neumann regularity, Annals of Pure and Applied Logic, 145, (2007), 204–222.
[35]
Claude Sureson, Model companion and model completion of theories of rings Archive for Mathematical Logic, 48, (2009), 403–420.
[36]
David Ellerman, Sheaves of structures and generalized ultraproducts, Annals of Pure and Applied Logic, 7, (1974), 163-195.
[37]
Moreno Pierobon and Mateo Viale, Boolean valued models, presheaves, and étalé spaces, preprint arxiv.2006.14852, (2023),.
[38]
Mike Prest, Vera Puninskaya and Alexandra Ralph Model theory of sheaves of modules, Journal of Symbolic Logic, 69(4), (2004), 1187-1200.
[39]
Mike Prest and Alexandra Ralph, On sheafification of modules, preprint, University of Manchester, (2001, revised 2004), available at personalpages.manchester.ac.uk/staff/mike.prest/ShvFP09Rev.pdf, 11pp.
[40]
Mike Prest and Alexandra Ralph, Locally finitely presented categories of sheaves of modules, preprint, University of Manchester, (2001, revised 2004 and 2018), available at eprints.maths.manchester.ac.uk/1411/1/ShfifTorsTh.pdf, 15pp.
[41]
Mike Prest and Ravi Rajani, Model-theoretic imaginaries and coherent sheaves, Applied Categorical Structures, 17(6), (2009), 517-559.
[42]
Mike Prest and Alexander Slávik, Purity in categories of sheaves, Mathematische Zeitschrift, 297(1-2), (2021), 429-451.
[43]
Mike Prest, Model theory for sheaves of modules, in Logic and its Applications, Proc. 8th Indian Conf. ICLA, Delhi, Lecture Notes in Comp. Sci, 11600, Springer, (2019), 89-102.
[44]
Xavier Caicedo, Investigaciones acerca de los conectivos intuicionistas, Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales, 19, (1995), 705–716.
[45]
Xavier Caicedo, Conectivos intuicionistas sobre espacios topológicos, Revista de la Academia Colombiana de Ciencias Exactas, 21, (1997), 521-535.
[46]
Antonio Sette and Xavier Caicedo, Equivalência elementar entre feixes, Notas de lógica mathemática 38, 129-141, (1993).
[47]
Andrés Forero Cuervo, Una demostración alternativa del teorema de ultralıímites, Revista Colombiana de Matemáticas, 43, 115-138, (2009).
[48]
Andrés Montoya, Contribuciones a la teorıía de modelos de haces, Lecturas Matemáticas, 28, (2007), 5–37.
[49]
J. Benavides The logic of sheaves, sheaf forcing and the independence of the Continuum Hypothesis preprint, arxiv.1111.5854, (2012).
[50]
Maciol Ochoa and Andres Vilaveces, Sheaves of metric structures, Logic, Language, Information and Computation, 23rd Workshop WoLLIC 2016, (2016), 297-315.
[51]
Mike Fourman and Dana Scott, Sheaves and Logic, in eds. Mike Fourman, Chris Mulvey and Dana Scott Applications of Sheaves, Lecture Notes in Mathematics, 753, Springer Verlag, (1979), 302-401.
[52]
Denis Higgs, A category approach to Boolean-valued set theory, Preprint, University of Waterloo, (1973).
[53]
Denis Higgs, Injectivity in the Topos of Complete Heyting Algebra Valued Sets, Canadian Journal of Mathematics, 36(3), (1984), 550-568.
[54]
Andreas Brunner, The Method of Constants in the Model Theory of Sheaves over a Heyting Algebra, Ph.D. thesis, University of São Paulo, (2000).
[55]
Andreas Brunner and Francisco Miraglia, An Omitting Types Theorem for Sheaves over Topological Spaces, Logic Journal of the IGPL, 12(6), (2004), 525-548.
[56]
Diego Berrío, Logic of sheaves of structures on a locale, Master’s thesis, Universidad Nacional de Colombia, (2015), 70pp.
[57]
Francisco Miraglia, Ultraprodutos generalizados e feixes de estruturas sobre uma álgebra de Heyting completa, Tese de Livre Docência Universidade de São Paulo, (1990).
[58]
Hisashi Aratake, Sheaves of structures, Heyting-valued structures, and a generalization of Łoś’s theorem, Mathematical Logic Quarterly, 67, (2021), 445–468.
[59]
Andreas Brunner, Model theory in sheaves, South American Journal of Logic, 2(2), (2016), 379–404.
[60]
José Goudet Alvim, Caio de Andrade Mendes and Hugo Luiz Mariano, Q-Sets and Friends: Categorical Constructions and Categorical Properties, arXiv.2302.03123, (2023).
[61]
José Goudet Alvim, Caio de Andrade Mendes and Hugo Luiz Mariano, Q-Sets and Friends: Regarding Singleton and Gluing Completeness, arXiv.2302.03691, (2023).
[62]
Ana Luiza Tenório, Caio de Andrade Mendes, and Hugo Mariano, On sheaves on semicartesian quantales and their truth values, arXiv.2204.08351, (2023).
[63]
David Reyes and Pedro H. Zambrano, Co-quantale valued logics, preprint, arXiv:2102.06067. (2021).
[64]
Ulrich Höhle and Tomasz Kubiak, A non-commutative and non-idempotent theory of quantale sets Fuzzy Sets and Systems, 166(1), (2011), 1-43.
[65]
Francisco Miraglia and Ugo Solitro, Sheaves and Presheaves over Right-sided Idempotent Quantales, Logic Journal of the IGPL, 6(4), (1998), 545–600.
[66]
Marcelo Coniglio and Francisco Miraglia, Non-Commutative Topology and Quantales, Studia Logica, 65, (2000) 223–236.
[67]
Marcelo Coniglio and Francisco Miraglia, Modules in the Category of Sheaves over Quantales, Annals of Pure and Applied Logic, 108, (2001) 103–136.
[68]
Pedro Resende, Groupoid sheaves as quantale sheaves, Journal of Pure and Applied Algebra, 216(1), (2012), 41-70.
[69]
Pedro Resende, Lectures on étale groupoids, inverse semigroups and quantales, Lecture Notes for the GAMAP IP Meeting, Antwerp, (2006), 115pp.
[70]
Pedro Resende, Quantale-valued sets, quantale modules, and groupoid actions, Lecture, International Category Thery Conference, Carvoeiro, Portugal, 17-23 June 2007. (2007).
[71]
Valeria de Paiva, Lineales: Algebras and Categories in the Semantics of Linear Logic, in eds. Dave Barker-Plummer, David Beaver, Johan van Benthem and Patrick Scotto di Luzio Words, Proofs,and Diagrams, CSLI Publications, (2002), 123-142.
[72]
Igor Shafarevich, Basic Algebraic Geometry, Volume 2, (3rd edition), Springer, (2013).
[73]
Barry Tennison, Sheaf Theory, London Mathematical Society Lecture Note Series, 20, CUP, (1975).
[74]
Francis Borceux, Handbook of Categorical Algebra: Sheaf Theory. Vol. 3, Encyclopedia of Mathematics and its Applications, Cambridge University Press, (1994).
[75]
Anne Troelstra and Dirk van Dalen. Constructivism in Mathematics, Volumes 1 and 2, North-Holland, (1988).
[76]
Francisco Miraglia, An introduction to partially ordered structures and sheaves, Contemporary Logic Series, 1, Polimetrica, International Scientific Publisher, Milan, (2006).
[77]
David Marker, Model theory: an introduction, Graduate texts in mathematics, 217, Springer (2002).
[78]
Martin Hyland, Categorical Model Theory, lecture at Models and Fields meeting, Durham, www.maths.dur.ac.uk/events/Meetings/LMS/2009/Movies/hyland.wmv, (2009).
[79]
Heinz-Dieter Ebbinghaus, Jörg Flum and Wolfgang Thomas, Mathematical Logic, (second edition), Undergraduate Texts in Mathematics, Springer, (1994).
[80]
Ruiyuan Chen, Étale structures and the Joyal-Tierney representation theorem in countable model theory, preprint, arXiv:2310.11539, (2023).
[81]
Melvin Fitting, Intuitionistic Logic Model Theory and Forcing, North Holland, (1969).
[82]
Jonathan Fleischmann, Syntactic preservation theorems for intuitionistic predicate logic, Notre Dame Journal of Formal Logic, 51(2), (2010), 225–245.
[83]
Taus Brock-Nannestad and Danko Ilik, An intuitionistic formula hierarchy based on high-school identities, Mathematical Logic Quarterly, 65(1), (2019), 57-79.
[84]
Wolfgang Burr, The intuitionistic arithmetical hierarchy, in eds. Jan van Eijck, Vincent van Oostrom and Albert Visser, Logic Colloquium ’99, Lecture Notes in Logic, 17, CUP, (2004), 51-59.
[85]
Makoto Fujiwara and Taishi Kurahashi, Prenex normalization and the hierarchical classification of formulas, Archive for Mathematical Logic, 63, (2024), 391–403.
[86]
Aleksy Schubert, Pawel Urzyczyn, and Konrad Zdanowski On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods in Computer Science, 12(4), (2017), 1-25.
[87]
Wilfrid Hodges, Model Theory, Cambridge University Press, Cambridge, 1993.
[88]
Andreas Brunner, Charles Morgan and Darllan Pinto, Some contributions to presheaf model theory, II - back and forth, in preparation.
[89]
Chen Chung Chang and H. Jerome Keisler, Model theory(3rd edition), North-Holland, (1990).
[90]
Jonathan Kirby, An invitation to model theory, CUP, (2019).
[91]
Jiří Adámek and Jiří Rosický, Locally presentable and accessible categories London Mathematical Society Lecture Note Series, 189, Cambridge University Press, (1994).
[92]
Michael Makkai and Robert Paré, Accessible categories: the foundations of categorial model theory, Contemporary Mathematics, 104, American Mathematical Society (1989).

  1. Published in [4].↩︎

  2. An extremely rapid overview of one perspective on neostability can be gleaned from reading the introductions to the recent [5], the three papers [6], [7] and [8], or the slightly earlier [9].↩︎

  3. See [10] as a starting place for continuous stability theory and, for example, [11] or [12] for sample excursions in continuous neostability.↩︎

  4. See, for example, [13], for an outline of their history.↩︎

  5. See [14], [15] and [16] for introductions to these logics.↩︎

  6. There are generalizations of classical model theory to second order logic. See, for example, [17] for an introduction to this area. In one’s daydreams one might consider analogues of these extensions. However, once coming back to reality these seem rather far off as feasilbe projects.↩︎

  7. See, for example, [18].↩︎

  8. See, for example, [72] or [73], for introductions to and examples of presheaves and sheaves over topological spaces. See [74] and [75] for introductions to presheaves and sheaves over complete Heyting algebras similar to, but somewhat more effusive, than this one, in the former interwoven with an introduction to presheaves and sheaves over topological spaces.↩︎

  9. Chen works with étalé structures rather than working directly with sheaves. However this is not a substantive difference: see, for example, Borceux, [74], for the well known translations between étalé spaces and sheaves.↩︎

  10. See [81] and [75].↩︎