1. Introduction
This article puts forward a new criterion of formal equivalence of theories. Roughly speaking, theories are formally equivalent when their formalisms are intertranslatable in the sense that they can be logically or mathematically recovered from each other. There are various explications of this idea. The criterion of definitional equivalence is one of the oldest and most well-known ones. Recently, increasing effort has been devoted to finding criteria of formal equivalence that improve on definitional equivalence: the most important proposals are direct generalizations of definitional equivalence (Andréka, Madarász, and Németi Reference Andréka, Madarász and Németi2008; Barrett and Halvorson Reference Barrett and Halvorson2016) and category-theoretic criteria (Halvorson Reference Halvorson2016; Weatherall Reference Weatherall2016; Halvorson and Tsementzis Reference Halvorson, Tsementzis and Landry2017). These new criteria have been applied in several case studies.Footnote 1
A well-known criticism of this project is that no criterion that focuses exclusively on formalisms is able to capture full equivalence of theories, while full equivalence is what ultimately matters (see Coffey Reference Coffey2014). Whether two theories are fully equivalent depends on how their formalisms are empirically and ontologically interpreted. Different interpretations lead to different equivalence judgments.
Coffey is right that one should not neglect interpretation when addressing the problem of full theoretical equivalence. However, this point is by no means a valid objection against the project of explicating formal equivalence. This project is not committed to the assumption that formal equivalence is necessary and sufficient for full equivalence of theories. Instead, one can view the formal project as laying the groundwork for (sufficient) criteria of full theoretical equivalence.Footnote 2 According to this view, full theoretical equivalence is to formal equivalence what interpreted formalisms are to uninterpreted ones. The idea is that full equivalence of theories (qua interpreted formalisms) obtains if there is a way of translating between their formalisms that preserves empirical content as well as theoretical content beyond the empirical (if there is any). This idea has been put forward, for example, by Putnam (Reference Putnam and Putnam1983, 38–39). In order to turn this idea into a rigorous account, we need (1) a criterion of formal equivalence that is suitable for being supplemented with preservation conditions regarding interpretation, (2) an explication of what it is to endow a formalism with an interpretation, and (3) a rigorous formulation of preservation conditions.
This article addresses the first point (but work devoted to the second and third points is already in progress). In section 2, I highlight two aspects of formalisms that are relevant when it comes to interpreting a formalism. I briefly present the two currently most important criteria of formal equivalence—generalized definitional equivalence (GDE) and categorical equivalence (CE)—and point out that each of them takes into account one such aspect while neglecting the other. In section 3, I introduce the criterion of definable categorical equivalence (DCE), which takes into account both relevant aspects. Section 4 investigates the properties of DCE and how it is related to GDE and CE.
Section 4 contains results suggesting that DCE can also be of interest independently of the motivations concerning interpretation described above. For instance, these results shed new light on the criterion of GDE and answer a technical question about the relationship between CE and GDE posed by Barrett (Reference Barrett2018). There is a sense in which DCE builds a bridge between CE and GDE. Thereby, it connects two main strands of research about formal equivalence criteria: the category-theoretic approach and the definability-theoretic approach. The results of this article might be relevant to anyone who is interested in either of these approaches.
2. Two Criteria, Morphisms, and Internal Structure
To understand the new criterion, we first examine the criteria of GDE and CE. These two criteria focus on different aspects of formalisms. GDE focuses on the internal constitution of models, whereas CE focuses on relationships between models. I argue that both of these aspects are relevant when it comes to interpreting a formalism. An adequate criterion should take both into account.
2.1. Generalized Definitional Equivalence
The basic idea behind GDE is to count theories as formally equivalent just in case one can define the vocabulary of each theory within the other theory such that this introduction of vocabulary makes the two sides logically equivalent. This idea can be made precise using only weak presuppositions about the structure of theories. All we need is that a theory T comes with a class of models, Mod(T), and that its models are Σ(T)-structures of a signature Σ(T).Footnote 3 A signature is simply a collection of nonlogical symbols. It is not necessary to identify theories with their classes of models. Hence, this requirement is compatible with both the syntactic and the semantic view of theories. Moreover, signatures do not have to be single sorted and first order. They may just as well be many sorted and higher order.Footnote 4
Definition 1. T 1 is GD-equivalent to T 2 iff (if and only if) their classes of models Mod(T 1) and Mod(T 2) have stepwise GD-expansions E 1 and E 2 such that
. (For a definition of ‘GD-expansion’, see app. A.)
In essence, GD-equivalent theories differ only in the choice of primitive vocabulary. Since sort symbols also belong to the vocabulary of a theory, GD-equivalent theories may differ in the sorts of objects they take as primitive. GDE allows that objects of a sort taken as primitive in one theory have to be logically constructed in another theory. Definitional equivalence is the special case of GDE in which theories are required to have the same primitive sorts.
For self-contained expositions of the criterion of GDE, see Andréka et al. (Reference Andréka, Madarász and Németi2008) or Barrett and Halvorson (Reference Barrett and Halvorson2016).Footnote 5 Note that Halvorson and Barrett call GDE ‘Morita equivalence’.Footnote 6 GDE is also closely related to the criterion of general bi-interpretability as described by Hodges (Reference Hodges1993, sec. 5.4). There is a conjecture that the two criteria are in fact equivalent. Yet, a proof is still missing.
2.2. Choices of Morphisms as Interpretive Choices
GDE works well in many cases. However, there are cases in which the class of models of a formalism is endowed with additional structure that GDE is not designed to take into account but that is relevant when it comes to possible interpretations. As several authors have pointed out, it can be fruitful to endow a class of models with a collection of morphisms when reconstructing the formalism of a theory (e.g., Halvorson Reference Halvorson2016; Weatherall Reference Weatherall2016, Reference Weatherall and Landry2017; Nguyen, Teh, and Wells Reference Nguyen, Teh and Wells2017). Intuitively, morphisms are structure-preserving mappings between models (also called ‘transformations’ or ‘symmetries’ in some contexts).
Among other things, this additional structure on a class of models can be used to encode constraints on possible interpretations. Used in this way, a choice of morphisms reflects which features of models are taken to be meaningful, that is, intended to play a representational role in possible applications.Footnote 7 The idea is that only features invariant under the chosen morphisms count as meaningful.Footnote 8 For example, Euclidean geometry has the group of Euclidean isometries as morphisms, whereas affine geometry has the larger group of affine transformations as morphisms. So although distance is meaningful in Euclidean geometry, it is not meaningful in affine geometry since it is not invariant under all affine transformations. However, parallelism is still meaningful in affine geometry. Note that even if two formalisms have exactly the same models, they may differ in which morphisms they include. Also note that nonmeaningful (surplus or auxiliary) features of models can be of great practical usefulness, and it may be hard and even undesirable to eliminate them.
Since GDE does not take into account morphisms, it is unable to capture certain cases of equivalence or inequivalence that are due to choices of morphisms between models. Weatherall (Reference Weatherall2016) discusses examples of such equivalences. An example regarding inequivalences will be discussed in section 4.3.
So in order to deal with formalisms that are enriched with morphisms, we need a criterion that takes morphisms into account. CE is such a criterion.
2.3. Categorical Equivalence
In contrast to GDE, the criterion of CE compares classes of models endowed with morphisms rather than bare classes of models of theories. A class of models endowed with morphisms forms what is called a ‘category’. A category C comprises a class of objects, Ob(C); a class of morphisms (arrows) between these objects, Mor(C); an associative composition operation for morphisms; as well as an identity morphism from each object to itself. Category theory provides a rigorous notion of equivalence of categories, on which the criterion of CE is based. In order to define this notion, we need a few important category-theoretic concepts.
A functor from one category to another maps objects to objects and morphisms to morphisms in a way that preserves composition of morphisms and identity morphisms. So functors are morphisms of categories. Natural transformations, however, are morphisms of functors, and natural isomorphisms are invertible natural transformations.Footnote 9 Using these concepts, we can define when categories are equivalent. Roughly speaking, categories are equivalent just in case they are related by functors that are quasi-inverse to each other (and hence forget nothing that matters from a categorical perspective).
Definition 2. C1 and C2 are equivalent categories iff there are functors
such that their composition GF is naturally isomorphic to
, and FG is naturally isomorphic to
(where
is the identity functor on Ci for
).
A closely related notion is that of duality. Two categories are said to be dual to each other (also dually equivalent or contravariantly equivalent) iff one category is equivalent to the opposite of the other category, where the opposite of a category is the result of reversing all of its arrows.
With these concepts at hand, we can state the criterion of CE for theories that come with an associated category of models. If T is such a theory, let ‘Cat(T)’ denote its category of models.
Definition 3. T 1 is C-equivalent to T 2 iff Cat(T 1) and Cat(T 2) are equivalent or dually equivalent categories.
Philosophers of physics have applied this criterion in several case studies (see Barrett et al. Reference Barrett, Rosenstock and Weatherall2015; Hudetz Reference Hudetz2015; Rosenstock and Weatherall Reference Rosenstock and Weatherall2016; Weatherall Reference Weatherall2016; Barrett Reference Barrett2017; Teh and Tsementzis Reference Teh and Tsementzis2017).
2.4. Internal Structure of Models Matters for Representation
The criterion of CE only takes into account how models are related by morphisms and neglects other properties of models. In particular, it does not take into account how models are internally structured. Yet, the internal constitution of models matters when it comes to establishing representation relations between models and their target systems.
Let me illustrate this point using a simple example. It is well known that the category of finite-dimensional vector spaces with linear mappings as morphisms is equivalent to the category that has natural numbers as objects and real
-matrices as morphisms. Up to isomorphism, there is exactly one vector space of dimension n. So one replaces all vector spaces of dimension n with the natural number n and linear mappings with corresponding matrices. Differences in how the objects of two equivalent categories are internally structured are irrelevant from a purely category-theoretic perspective. Nonetheless, such differences are by no means irrelevant for all scientific purposes. Whenever vector spaces are used to model features of real-world systems, we cannot simply replace them with natural numbers. Vector spaces possess internal structure: a set of vectors, the operations of vector addition and scalar multiplication, a zero vector (and an underlying field of scalars). In applications, some of these features serve representational purposes. For example, vectors might be used to represent forces acting on objects, and the net force on an object may be represented by a sum of vectors. It is utterly impossible that a natural number n could serve the same representational purposes as a vector space of dimension n. The number n simply lacks the internal structure necessary for fulfilling such representational roles.
These observations suggest two things. First, a formalism intended to serve representational purposes can only be equivalently replaced by another formalism if their models have the same representational capacities. Second, it is a necessary condition for sameness of representational capacities that the models of each formalism have internal structure that is sufficient for recovering the relevant internal structure of the models of the other formalism.
It is hardly surprising that the fact that CE does not take into account the internal structure of models leads to a trivialization of CE in certain cases. It is easy to see that CE collapses to a mere cardinality comparison of model classes when the theories in question have “very few” morphisms. More precisely, any two theories with categories of models that are rigid groupoids (i.e., when every morphism is an isomorphism and no model has nontrivial automorphisms) are C-equivalent as soon as they have the same number of nonisomorphic models. We will see in section 4.1 that this does not hold for DCE.
3. Definable Categorical Equivalence
The upshot so far is this: both choices of morphisms and the internal structure of models are aspects of formalisms that are relevant when it comes to their possible interpretations. Hence, a criterion that is suitable for being supplemented with preservation conditions concerning interpretation should take these aspects into account. GDE and CE are not optimal in this respect because GDE does not take into account choices of morphisms and CE does not take into account the internal structure of models.Footnote 10
In this section, I propose a criterion that is designed to take into account both morphisms and the internal structure of models. The basic idea is to strengthen CE by imposing a definability constraint on equivalence functors. For this reason, the new criterion is called ‘definable categorical equivalence’. The definability constraint serves to capture the above-mentioned idea that, if theories are formally equivalent, the models in each formalism should have sufficient internal structure to recover the internal structure of the other formalism’s models.
Before laying down the definition of DCE, some preliminary remarks are in order. We consider theories T that come with an associated category Cat(T) having the models of T as objects. We use the same assumptions about Mod(T) as in the case of GDE (see sec. 2.1). So models are assumed to be higher-order structures.Footnote 11 Construing models of scientific theories as higher-order structures does not lead to a relevant loss of generality (see Hudetz Reference Hudetz2017). Models such as dynamical systems, differentiable manifolds, stochastic processes, causal graphs, or games (in normal or extensive form) can all be seen as higher-order structures. Moreover, theories with first-order structures as models are subsumed as a special case.
The essential idea of DCE does not depend on this particular choice of representing formalisms of theories. DCE could in principle also be explicated in a different framework in which we can rigorously talk about definability and models. I use the model-theoretic framework because it is very general, comparatively simple, and close to mathematical practice, and many philosophers are familiar with it. Moreover, it makes a comparison with GDE possible, which is also naturally explicated in this framework.
There is only a mild requirement concerning morphisms in Cat(T) since the type of structures used as models does not necessarily determine what the relevant notion of morphism is (see Awodey Reference Awodey1997, 18; Landry Reference Landry2007). The only requirement is that Σ(T)-isomorphic models of T should also be isomorphic in Cat(T). The idea is that being Σ(T)-isomorphic is the strictest notion of isomorphism for Σ(T)-structures. The Σ(T)-isomorphisms preserve all features of structures expressible in terms of the symbols in Σ(T). The notion of Σ(T)-isomorphism is the standard notion of isomorphism in model theory.Footnote 12 It is crucial that the above requirement allows that there are invertible morphisms in Cat(T), that is, Cat(T)-isomorphisms, that are not Σ(T)-isomorphisms. For example, gauge transformations serving as extra isomorphisms in the category of models of a potential-based formulation of classical electromagnetism are isomorphisms of this kind (see Weatherall Reference Weatherall2016). Moreover, Cat(T) may also contain noninvertible morphisms such as homomorphisms or embeddings.
I will now define DCE and then unpack the definition step by step.
Definition 4. T 1 is DC-equivalent to T 2 iff there are reconstruction functors

constituting a (dual) equivalence between the categories Cat(T 1) and Cat(T 2).
So in contrast to CE, the existence of arbitrary functors constituting a (dual) equivalence between categories of models is not sufficient for DCE. Roughly speaking, a reconstruction functor is a functor such that for every model
of the source theory, the corresponding model F(Α) of the target theory can be reconstructed up to isomorphism from 𝒜. To reconstruct F(𝒜) from 𝒜 is to define F(𝒜) on the basis of 𝒜. The reconstruction has to be uniform in the sense that the same definitions are used for all models. More precisely:
Definition 5. A functor
is a reconstruction functor iff there is a reconstruction manual Φ for Σ(T 2) in terms of Σ(T 1) such that for every object 𝒜 in Cat(T 1), F(𝒜) is defined by Φ over 𝒜, or a Σ(T 2)-isomorphic copy of F(𝒜) is defined by Φ over 𝒜.
The rest of this section is devoted to clarifying what reconstruction manuals are and what it means that a structure is defined over another structure by a reconstruction manual.
Reconstruction manuals tell us how to reconstruct structures of one signature from structures of another signature. They can be viewed as functions mapping the nonlogical symbols of one signature to open formulas over the other signature. The free variables of these associated formulas need to be of the right type, of course. So a reconstruction manual presupposes an association between the types of the two signatures in question. In the general case of higher-order signatures, this can be made precise as follows.
Definition 6. Let Σ1 and Σ2 be higher-order signatures. Then α is an association of Σ1-types with Σ2-types iff α maps every type of Σ1 to a type of Σ2 such that:
1. α commutes with the product type constructor:
.2. α commutes with the power type constructor:
.
Using this auxiliary notion, we can make precise what reconstruction manuals are.
Definition 7. Let Σ1 and Σ2 be higher-order signatures. Then Φ is a reconstruction manual for Σ1 in terms of Σ2 iff there is an association α of Σ1-types with Σ2-types such that:
1. Φ maps every basic sort σ of Σ1 to a Σ2-formula Φσ with one free variable of type α(σ).
2. Φ maps every predicate P in Σ1 with simple type ℘(τ) to a Σ2-formula ΦP with a free variable of type α(τ).
3. Φ maps every function symbol f in Σ1 with input-type τ 1 and output-type τ 2 to a Σ2-formula Φf with two free variables of types α(τ 1), α(τ 2).
4. Φ maps every individual constant c in Σ1 of basic sort σ to a Σ2-formula Φc with a free variable of type α(σ).
With the concept of reconstruction manuals at hand, we can make precise what it means that the models of one theory can be defined from corresponding models of another theory. Definability of models is explained in terms of definability of their components. The latter notion is understood as usual: suppose 𝒜 is a Σ-structure and φ an open formula over Σ. Then a set X is defined by φ over 𝒜 just in case X contains exactly those (tuples of) objects that satisfy φ in 𝒜 (i.e.,
). The set defined by φ in 𝒜, that is, the extension of φ in 𝒜, is denoted by ‘φ 𝒜’. Similarly, the extension of a symbol S of Σ in 𝒜 is denoted by ‘S 𝒜’. Using this notation, then the next definition explicates when a model is defined over another model by means of a reconstruction manual.
Definition 8. Suppose 𝒜1 is a Σ1-structure and 𝒜2 is a Σ2-structure. Then 𝒜2 is defined by Φ over 𝒜1 iff Φ is a reconstruction manual for Σ2 in terms of Σ1 such that the following conditions hold:
1. for every symbol S of Σ2 that is not an individual constant,
is defined by ΦS over 𝒜1 (i.e.,
).2. for every individual constant c of Σ2, {
} is defined by Φc over 𝒜1 (i.e.,
).
This completes the explication of DCE. Before investigating the properties of DCE, three remarks about possible modification are in order. First, using formulas of higher-order languages in reconstruction manuals reflects a liberal attitude about which kinds of logico-mathematical constructions are admissible to reconstruct models. This liberality ties in with scientific practice. Working scientists do not restrict themselves to first-order constructions. For example, defining states over a C*-algebra is a higher-order construction: states are defined as certain functions from a C*-algebra to its underlying field ℂ. However, using higher-order languages is not essential to the idea of DCE. So if one wishes to take a less liberal stance on admissible logical constructions for philosophical reasons, one can impose constraints on which kinds of formulas are allowed in reconstruction manuals (e.g., only first-order formulas). This will lead to stricter versions of DCE.
Second, to go beyond formal equivalence, one can impose admissibility constraints on reconstruction manuals and functors that take into consideration how formalisms are interpreted. A natural constraint would be to allow only reconstruction manuals that preserve meaningfulness in the sense that they map meaningful symbols of one theory to meaningful formulas of another theory. Also, constraints regarding empirical content or theoretical content beyond the empirical can be brought in at this stage. However, putting forward concrete formulations of preservation conditions for reconstruction functors falls outside the scope of this article. But work devoted to this issue is already in progress.
Third, there are cases in which it is not necessary to reconstruct the entire internal structure of models. It may suffice to reconstruct only those parts of models that play a representational role. Such cases can be captured using the notion of partial reconstruction manuals. Roughly speaking, a partial reconstruction manual maps the meaningful formulas of one theory to meaningful formulas of another theory. Explicating DCE with partial reconstruction manuals raises questions about meaningfulness and interpretation that would lead us too far afield. Therefore, we will restrict our attention to the simpler case of full reconstruction manuals in this article.
4. Properties of the New Criterion
To understand the new criterion better, it is useful to examine in which ways it differs from CE and GDE and in which ways it is similar to these criteria.
4.1. DCE Is Strictly Stronger than CE
There are cases of CE in which equivalence functors trivially exist but mutual reconstruction of models is not possible along these functors. In particular, the criterion of DCE does not collapse to a mere cardinality comparison of model classes when it comes to theories with “very few” morphisms (described at the end of sec. 2.4). I will illustrate this point using two examples. First, let us consider a well-known simple toy example of a pathological C-equivalence due to Barrett and Halvorson (Reference Barrett and Halvorson2016, theorem 5.7). They specify two single-sorted first-order axiom systems:
and
with signatures
and
, respectively. Elementary embeddings serve as morphisms in their categories of models. Barrett and Halvorson prove that T 1 and T 2 are C-equivalent but not GD-equivalent. Theory T 2 is stronger than T 1 in virtue of its additional axioms. The reason why T 1 and T 2 are C-equivalent is that they have the same number of nonisomorphic models and their categories of models are rigid groupoids. However, one can show that no functors constituting an equivalence between these categories are reconstruction functors. Hence:
Proposition 1. The theories T 1 and T 2 are not DC-equivalent.
Although this is only a toy example, it shows that, relative to CE, the definability condition built into DCE makes a difference and is therefore not redundant. This observation might seem trivial. Nevertheless, it is important to make in order to address an idea that has recently been put forward in the literature. Feintzeig (Reference Feintzeig2017) claims that an adjunction between two categories of models hints at a sense in which the models in one category are definable from the models in the other category. Since every C-equivalence is an adjunction, the same must hold for CE if Feintzeig’s claim is right. This idea leads to the question whether CE entails that the models in one category are in some sense definable from the models in the other category. If this were so, then adding a definability condition to CE would be redundant. However, it is not so in general. It might be true in special cases in which all the internal structure of models is fully encoded by the morphisms between them.Footnote 13 But there are cases in which CE does not capture or even hint at mutual definability in any way. Here is an example that is more general and more robust than the first one.Footnote 14 There is no reasonable sense of definability according to which any two rigid structures whatsoever are definable from each other. Nevertheless, for any two rigid structures 𝒜1 and 𝒜2, there is an equivalence between the categories C1 and C2, where Ci has 𝒜i as its sole object and the trivial identity automorphism of 𝒜1 as its only arrow. In such cases, CE is trivially satisfied even if 𝒜1 and 𝒜2 are not definable from each other in any sense. In contrast, DCE is not necessarily satisfied, as it explicitly takes into account definability.
Proposition 2. There are theories with an up to isomorphism unique rigid model that are C-equivalent but not DC-equivalent.
For instance, take a simple theory describing a social network with an up to isomorphism unique rigid model (a finite graph) and a cosmological model that arises from general relativity by means of conditions singling out a unique space-time manifold with no nontrivial isometries (i.e., where space-time is highly asymmetric). Then these theories are trivially C-equivalent. However, they are not DC-equivalent because a model of general relativity with its rich internal structure is not definable from a finite graph.
Some authors take it as “a definite mark against categorical equivalence as a general standard for equivalence of theories” (Barrett Reference Barrett2018, 636) that C-equivalence does not imply that the models of each theory are somehow definable in terms of the models of the other. From this perspective, DCE can be seen as an amendment of CE not subject to this concern.
4.2. Proving CE Often Yields a Proof of DCE
We have now seen that DCE is a nontrivial strengthening of CE, ruling out several instances of the latter. However, the definability constraint in the criterion of DCE does not constitute an extreme strengthening either. DCE is not very far from CE in the sense that from many proofs of C-equivalences occurring in practice one can extract proofs of DC-equivalences. The reason is that proofs of (dual) equivalences between concrete categories often establish more than the mere existence of (contravariant) equivalence functors. In many cases, one establishes how to define structures of one kind from structures of another kind and vice versa in order to specify functors witnessing the duality or equivalence in question. In such cases, theorems sometimes state a bit less than their proofs establish.
For example, when proving that the category of Boolean algebras is dual to the category of Stone spaces one defines a Stone space from a given Boolean algebra and vice versa. Another example is Gelfand duality, where one defines a compact Hausdorff space from any given unital commutative C*-algebra 𝒜 (i.e., the space of nonvanishing C*-algebra homomorphisms from 𝒜 to ℂ with the spectral topology) and one defines a unital commutative C*-algebra from any given compact Hausdorff space χ (i.e., the algebra of continuous functions from χ to ℂ). Roughly speaking, the definitions involved in specifying the functors constituting Gelfand duality capture a sense in which state spaces and algebras of observables of classical mechanical systems can be reconstructed from each other (Strocchi Reference Strocchi2005, 15).
Actually, finding appropriate definitions is often a crucial step in proofs of (dual) equivalences between categories. It is what enables us to specify functors in the first place, and the fact that the so specified functors constitute a (dual) equivalence between the categories in question depends on the judicious choice of definitions. In this sense, the idea of reconstruction underlying DCE ties in with scientific practice.
It follows from the results in the previous section that not all instances of CE have proofs involving definitions in this way. However, I conjecture that many instances of CE that we encounter in practice do, especially those arising from reconstruction or representation theorems. This conjecture suggests to undertake case studies as a task for future research. For example, is the C-equivalence between formulations of Hamiltonian mechanics and Lagrangian mechanics (Barrett Reference Barrett2017) a case of DCE? Does the Gelfand-Naimark representation theorem (Gelfand and Naimark Reference Gelfand and Naimark1943) allow us to prove that the Hilbert space formalism and the C*-algebra formalism of quantum mechanics are DC-equivalent? Do reconstruction theorems relating different approaches to quantum field theories (e.g., Wightman Reference Wightman1956; Osterwalder and Schrader Reference Osterwalder and Schrader1973, Reference Osterwalder and Schrader1975) give rise to DC-equivalences?
4.3. DCE and GDE Differ in the Presence of Surplus Structure
A major difference between DCE and GDE is that DCE is not overly sensitive to the presence of auxiliary or surplus structure because it takes morphisms into account. This section is devoted to showing that. We put the focus on a particular kind of auxiliary structure, namely, coordinate systems. Although introducing coordinates is an insignificant extension of a formalism as far as representational capacities are concerned, it makes a big difference for GDE: models that are not GD-equivalent can become GD-equivalent when equipped with coordinate systems. The reason is that the presence of a coordinate system allows us to formulate new definitions that could not be formulated otherwise. These newly available definitions can be used to establish GDE even though the definientia involved are not meaningful formulas. This leads to pathological positive cases of GDE. As we will see, DCE is not beset with this problem.
Let us look at an example to illustrate these points. We compare n-dimensional Minkowski geometry (MGn) and n-dimensional Euclidean geometry (EGn). The models of MGn and EGn are n-dimensional Minkowski spaces and n-dimensional Euclidean spaces, respectively. Both Minkowski spaces and Euclidean spaces are here understood as real vector spaces equipped with generalized inner products (i.e., nondegenerate symmetric bilinear forms).Footnote 15 This is a slight simplification. Strictly speaking, Minkowski and Euclidean spaces should be treated as affine spaces—rather than vector spaces—equipped with generalized inner products.Footnote 16 But since this would unnecessarily complicate our presentation without affecting any results, the chosen simplification is unproblematic. It is also common in physics to simplify in this way (see Naber Reference Naber2012).
So we take an n-dimensional Minkowski space (V, η) to consist of an n-dimensional vector space
over the field R of real numbers together with a Minkowskian inner product
of metric signature (1,
). An n-dimensional Euclidean space (V, 〈·, ·〉) is an n-dimensional real vector space V endowed with a Euclidean inner product
of metric signature (n, 0). Up to isomorphism, there is only one n-dimensional Minkowski space and only one n-dimensional Euclidean space.
When endowed with a physical interpretation (see Malament Reference Malament2009, sec. 3.2), four-dimensional Minkowski geometry yields the theory of space-time underlying special relativity. Four-dimensional Euclidean geometry, when physically interpreted, ascribes a very different structure to space-time. But more than that these geometries should count as inequivalent irrespective of concrete physical applications because their generalized inner products are very different from a purely mathematical point of view. They encode very different notions of distance and angles. The criteria of GDE and DCE both capture this difference when the models of Euclidean and Minkowski geometry are not endowed with coordinate systems:
1. MGn and EGn are not DC-equivalent.
2. MGn and EGn are not GD-equivalent.
However, we will now see that if we endow their models with coordinate systems, the resulting versions of Minkowski and Euclidean geometry become GD-equivalent but not DC-equivalent. Endowing models with coordinate systems can hardly be regarded as an illegitimate step. Although coordinate systems may be dispensable for a characterization of fundamental space-time structure or other foundational issues, they still play an important role in practice. Usually, one cannot apply geometry empirically without choosing a reference frame and an associated coordinate system. For a defense of the legitimacy of a coordinate-based approach for foundational work, see Wallace (Reference Wallace2016).
We need a bit of terminology to specify the coordinatized models. A linear coordinate system for an n-dimensional vector space V is an n-tuple of coordinate functions (f 0, …,
), where
maps every vector
to a real number serving as the ith coordinate of v (
), such that the function
defined by
is a vector space isomorphism from V to the real coordinate space Rn.Footnote 17 We say that a linear coordinate system (f 0, …,
) for V is a Lorentz coordinate system for an n-dimensional Minkowski space
iff f is an isometric isomorphism from ℳ to the real coordinate space (Rn, η std) with the standard Minkowski inner product η std on Rn, which takes the following form in the standard coordinates xi on ℝn (mapping elements of ℝn to their ith components):
It immediately follows that all Lorentz coordinate systems for ℳ are related to each other by Lorentz transformations. Analogously, (f 0, …,
) is a Euclidean coordinate system for an n-dimensional Euclidean space
iff f is an isometric isomorphism from ℰ to the real coordinate space (Rn, 〈·, ·〉std) with the standard Euclidean inner product on Rn, which is given by
Now we can specify the models of Minkowski and Euclidean geometry extended with coordinate systems (
and
). The models of
are those structures (V, f 0, …,
, η) such that (V, η) is a model of MGn and (f 0, …,
) is a Lorentz coordinate system for (V, η). The models of
are those structures (V, f 0, …,
, 〈·, ·〉) such that (V, 〈·, ·〉) is a model of EGn and (f 0, …,
) is a Euclidean coordinate system for (V, 〈·, ·〉).Footnote 18 With these specifications at hand, one can prove that
Proposition 4.
and
are GD-equivalent (for
).
To get an impression of what is going on here, consider a model
of
, where
. It follows that ℳ is a definitional expansion of V+ because (f 0, …,
) is a Lorentz coordinate system for ℳ, and hence ℳ satisfies
Now define a Euclidean inner product 〈⋅, ⋅〉 over V+:
This definition can be formulated in the first-order language of n-dimensional vector spaces with coordinate functions. Then
is a model of
and also a definitional expansion of V+. Hence, ℳ and ℰ are definitional expansions of the same underlying structure V+ and, therefore, have a common definitional expansion (V+, η, 〈·, ·〉). Thus, ℳ and ℰ are definitionally equivalent.
Let us now see how a different analysis of the relationship between
and
can be achieved by making use of morphisms to wash out auxiliary structure. The crucial point is that choices of coordinates need not be preserved under morphisms. One can change coordinates (e.g., via a Lorentz transformation in the case of
), and the model with the new coordinate system will represent exactly the same physical situation. This suggests specifying the categories of models of
and
in such a way that choices of coordinates may vary under morphisms. In particular, we should not take
-isomorphisms and
-isomorphisms as the respective morphisms because they preserve all the internal structure of models, including coordinate functions. Furthermore, if we would like to wash out surplus structure that is due to our simplification—that is, the designated origins in Euclidean and Minkowski spaces—now is the opportunity to do so by choosing morphisms that do not preserve origins. This is what we will do. We define
in such a way that
is a morphism in
iff h is a bijection from V to V′ that is an affine map from V to V′ preserving Minkowski inner products (i.e.,
for all u,
), and for technical reasons we also require that h maps each scalar to itself.Footnote 19 The morphisms in
are specified analogously.
It follows that the automorphism group of each model in
is the Poincaré group, whereas the automorphism group of models in
is the Euclidean group. The fact that the Poincaré group and the Euclidean group are not isomorphic implies that
Proposition 5.
and
are not DC-equivalent (for
).
We can say more when we consider which formulas count as meaningful in
and
. On a usual interpretation of these formalisms, formulas with free vector variables are only meaningful when they are invariant under morphisms. We call a formula φ over
with n free variables invariant under the morphisms of
just in case for all morphisms
in
, an n-tuple (a 1, …, an) satisfies φ in ℳ iff (h(a 1), …, h(an)) satisfies φ in ℳ′. It follows that the formula
is not invariant under the morphisms of
.Footnote 20 Hence, formula (5) is not meaningful in
. So although formula (5) defines a Euclidean inner product over any given model of
, this inner product will not count as meaningful in
. Thus, any reconstruction manual for
in terms of
yielding (5) as a translation of
does not preserve meaningfulness. An analogous conclusion holds for reconstruction manuals for
in terms of
.
4.4. DCE Is Close to GDE in the Absence of Surplus Structure
We have seen that DCE and GDE sometimes coincide and sometimes do not coincide. This section shows under which conditions the two criteria coincide.
First, one can show that DCE is a generalization of GDE for theories of a certain kind. Barrett and Halvorson (Reference Barrett and Halvorson2016) have shown that GD-equivalent first-order theories with elementary embeddings as morphisms are C-equivalent. Their proof can be generalized for the case of theories with higher-order structures as models. Moreover, one can show that the equivalence functors constructed from a GD-equivalence are indeed reconstruction functors (which is not entirely trivial). So we get the following result.
Theorem 1. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the morphisms in Cat(Ti) are precisely elementary embeddings (
). If T 1 and T 2 are GD-equivalent, then T 1 and T 2 are DC-equivalent.
Let us briefly pause here and reflect on what the choice of elementary embeddings as morphisms means for a theory. Elementary embeddings are injective mappings between models that preserve all relations definable in the theory’s language. This choice of morphisms reflects the idea that all definable features of models may be taken to be meaningful. (The same holds for Σ(T)-isomorphisms, which form a subclass of elementary embeddings.) So taking precisely elementary embeddings (or precisely Σ(T)-isomorphisms) as the morphisms of a theory T means viewing the models of T as not exhibiting any auxiliary or surplus structure.
Under this reading, theorem 1 partially captures the idea that morphisms need to be taken into account only in the presence of auxiliary or surplus structure. This idea furthermore suggests that DCE should not be much wider than GDE when it comes to theories without auxiliary or surplus structure. The following theorem captures a sense in which this is indeed the case. This theorem is one of the main technical results of this article.
Theorem 2. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the isomorphisms in Cat(Ti) are precisely the Σ(Ti)-isomorphisms (
). If T 1 and T 2 are DC-equivalent, then T 1 and T 2 are GD-equivalent up to external auxiliaries.
The qualification ‘up to external auxiliaries’ concerns auxiliary vocabulary introduced in GD-expansions rather than auxiliary vocabulary of the theories themselves. Every GD-expansion to a signature with new sorts also introduces auxiliary function symbols relating the new sorts to old sorts. GDE up to external auxiliaries is like GDE except that it does not require such “external” auxiliary vocabulary to be recovered. More precisely, T 1 and T 2 are GD-equivalent up to external auxiliaries iff they have stepwise GD-expansions E 1 and E 2 that coincide insofar as one ignores external auxiliary vocabulary on both sides; that is,
.Footnote 21
So for theories with standard model-theoretic isomorphisms, DCE differs from GDE only in not requiring that auxiliary symbols used for reconstructing the sorts of one theory from the sorts of another theory have to be recovered as well. Hence, DCE is slightly more liberal than GDE in these cases. This raises the question whether and when we should regard recovering external auxiliaries as necessary. I am not aware of any published arguments concerning this question. To shed light on what the requirement of recovering external auxiliaries amounts to, it is useful to find a corresponding strengthening of DCE. It turns out that to obtain GDE simpliciter instead of GDE up to auxiliaries, one only needs to strengthen DCE by adding an extra definability condition regarding isomorphisms between models and their inner models given by composition of reconstruction functors. Call such isomorphisms ‘inner isomorphisms’.
Definition 9. T 1 and T 2 are DC-equivalent with definable inner isomorphisms iff there are functors
,
and reconstruction manuals Φ for Σ(T 2) in terms of Σ(T 1) and Ψ for Σ(T 1) in terms of Σ(T 2) establishing a DCE between T 1 and T 2 such that
1. there is a family of Σ(T 1)-formulas defining a Σ(T 1)-isomorphism from 𝒜1 to GF(𝒜1) for all
and2. there is a family of Σ(T 2)-formulas defining a Σ(T 2)-isomorphism from 𝒜2 to FG(𝒜2) for all
such that3. these isomorphisms are compatible with each other and with Φ and Ψ.
Call 1–3 the ‘many-sorted Ahlbrandt-Ziegler condition’. Its underlying idea is closely related to the concept of bi-interpretability due to Ahlbrandt and Ziegler (Reference Ahlbrandt and Ziegler1986). For a more detailed formulation of this condition, see definition B8, appendix B.
Theorem 3. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the isomorphisms in Cat(Ti) are precisely the Σ(Ti)-isomorphisms (
). If T 1 and T 2 are DC-equivalent with definable inner isomorphisms, then T 1 and T 2 are GD-equivalent.
This shows that the requirement to recover external auxiliaries contained in GDE is closely related to the requirement that inner isomorphisms are definable in a certain way. Moreover, this theorem answers a question posed by Barrett (Reference Barrett2018, 637). The question is whether there is a special property
of functors such that the existence of a C-equivalence that is constituted by functors having property
entails GDE (given the theories in question have precisely elementary embeddings as morphisms). The property of being a reconstruction functor comes close. But to achieve GDE, a monadic property of functors is unlikely to suffice. However, a binary relation between functors works, namely, the relation of being reconstruction functors that jointly satisfy the Ahlbrandt-Ziegler condition.
There are good reasons not to include the many-sorted Ahlbrandt-Ziegler condition as a regular component of the criterion of DCE. When strengthened with this extra condition, it would not be able to capture formal equivalences between theories with categories of models that do not (only) contain standard model-theoretic isomorphisms. For instance, in Weatherall’s (Reference Weatherall2016) examples, different potential-based models 𝒜1, 𝒜2 that are related by a gauge transformation will be mapped to the same model 𝒜 by the composite auto-equivalence functor. However, the gauge transformations from 𝒜1 to 𝒜 and from 𝒜2 to 𝒜 are not induced by uniformly defined bijections in the way the many-sorted Ahlbrandt-Ziegler condition would require (cf. definition B8, app. B). So if we seek to capture equivalences between theories that do not (only) have standard model-theoretic isomorphisms, we should not impose the many-sorted Ahlbrandt-Ziegler condition as necessary.
5. Conclusion
I have argued that choices of morphisms and the internal structure of models both matter when it comes to possible interpretations of a formalism. I have pointed out that GDE does not take into account morphisms and CE does not take into account the internal structure of models. I have presented a new criterion, namely, DCE, which connects the category-theoretic approach and the definability-theoretic approach to formal equivalence. DCE is a strengthening of CE with a definability constraint on equivalence functors. It is also closely related to GDE in cases in which morphisms preserve all definable features of models. DCE takes into account the internal structure of models as well as choices of morphisms. Thereby, it allows a more nuanced analysis of scientific theories.
An important task for future work is to supplement DCE with preservation conditions concerning interpretation by imposing constraints on which reconstruction manuals and functors are admissible. One can specify preservation conditions corresponding to different levels of interpretation: (1) preservation of meaningfulness for preinterpreted formalisms, (2) preservation of empirical content for empirically interpreted formalisms, and (3) preservation of theoretical content for formalisms that are endowed with a full-blown interpretation going beyond the empirical. Furthermore, one can weaken the notion of reconstruction functor by allowing partial reconstruction manuals, in which nonmeaningful features of models do not need to be reconstructed. Working out these ideas in detail and exploring their consequences seems to be a promising direction for future research.
Appendix A. GD-Expansions
Suppose Σ and Σ+ are higher-order signatures with
and C and E are classes of Σ-structures and Σ+-structures, respectively.
Definition A1. E is a GD-expansion of C to Σ+ by Δ iff Δ is a set of explicit definitions and sort-definitions of the symbols in
in terms of Σ such that
1. all
satisfy the admissibility conditions of the definitions in Δ;2. all
satisfy Δ;3. and
.
For the form of sort-definitions, see Barrett and Halvorson (Reference Barrett and Halvorson2016, sec. 4.1).
Definition A2. E is a stepwise GD-expansion of C to Σ+ by (Δ1, …, Δn) iff there is a sequence (E 0, E 1, …, En) of classes of structures of signatures
such that
1.
and
;2.
and
;3. and Ei is a GD-expansion of
to Σi by Δi (for
).
Appendix B. Proofs
Proposition 1. The theories T 1 and T 2 are not DC-equivalent.
Proof. Note that, up to Σ2-isomorphism, there is only one model
of T 2 such that the predicate Q 0 has a nonempty extension. Suppose for reductio that there are reconstruction functors
and
constituting a (dual) equivalence. Then for every
there is an
such that 𝒜2 is Σ2-isomorphic to F(𝒜1) and 𝒜2 is definable from 𝒜1 by some reconstruction manual Φ. It follows that
(*) there can only be one model
up to Σ1-isomorphism such that
; namely,
.
The formula
contains only finitely many of the predicates P 0, P 1, … of Σ1. Therefore, we get many models 𝒜 of T 1 such that 𝒜 is not Σ1-isomorphic to
but
. We achieve this by varying the extensions of those Pi not contained in the formula
, while using the same extension as in
for the predicates contained in
. Thus, we get a contradiction to (*). QED
Proposition 2. There are theories with an up to isomorphism unique rigid model that are C-equivalent but not DC-equivalent.
Proof. Let T 1 be a theory with an up to isomorphism unique finite rigid model (e.g., an asymmetric graph) and let T 2 be a theory with an up to isomorphism unique infinite rigid model (e.g., a space-time manifold without nontrivial isometries). Then T 1 and T 2 are trivially C-equivalent. But they are not DC-equivalent. It is sufficient to show that no infinite structure is definable over a finite structure. Let 𝒜 be a structure such that every basic type has a finite extension. Note that if τ 1 and τ 2 are types with finite extensions, then so are the product type
and the power types ℘(τi). Thus, every type has a finite extension. Therefore, every Σ(𝒜)-formula can only have a finite extension under 𝒜. Hence, no infinite set is definable over 𝒜. QED
1. MGn and EGn are not DC-equivalent.
2. MGn and EGn are not GD-equivalent.
Proof. The Σ(MGn)-automorphism group of the models of MGn is not isomorphic to the Σ(EGn)-automorphism group of the models of EGn. Since GDE preserves automorphism groups, MGn and EGn cannot be GD-equivalent. For analogous reasons, they cannot be DC-equivalent either. QED
Proposition 4.
and
are GD-equivalent (for
).
Proof. Let VEC+ be the set of all structures (V, f 0, …,
) such that V is an n-dimensional vector space and (f 0, …,
) is a linear coordinate system for V. It suffices to show that both
and
are GD-expansions of VEC+. Let
be a model of
, where
. Then (f 0, …,
) is a Lorentz coordinate system for ℳ. This implies that ℳ satisfies the definition
Moreover, it follows that
. Conversely, if
, one can define a Minkowskian inner product η over V+ using the equation above. Then
. Hence,
is a GD-expansion of VEC+. Analogously, one shows that
is a GD-expansion of VEC+. QED
Proposition 5.
and
are not DC-equivalent (for
).
Proof. There cannot be reconstruction functors establishing a (dual) equivalence between
and
because the Poincaré group is not isomorphic to the Euclidean group. QED
Definition B1. A stepwise GD-expansion E of C to Σ+ by (Δ1, …, Δn) uses only subsorts iff all basic sorts of Σ+ are introduced as subsorts of types of Σ by (Δ1, …, Δn).
Lemma B1. If T 1 and T 2 are GD-equivalent, there are stepwise GD-expansions E 1 and E 2 of Mod(T 1) and Mod(T 2) using only subsorts such that
.
Theorem 1. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the morphisms in Cat(Ti) are precisely elementary embeddings (
). If T 1 and T 2 are GD-equivalent, then T 1 and T 2 are DC-equivalent.
Proof. By lemma B1, Mod(T 1) and Mod(T 2) have stepwise GD-expansions E 1 and E 2 to some signature Σ+ by (
, …,
) and (
, …,
) using only subsorts such that
. This gives rise to reconstruction manuals. Let Φ map every symbol S of Σ(T 2) to the open Σ(T 1)-formula used to define S in (
, …,
). Then Φ is a reconstruction manual for Σ(T 2) in terms of Σ(T 1). Analogously, we get a reconstruction manual Ψ for Σ(T 1) in terms of Σ(T 2).
Let Cat(Ei) be the category having the structures of Ei as objects and elementary embeddings between them as morphisms (
). Then the reduct functors
and
are equivalence functors, as described in Barrett and Halvorson (Reference Barrett and Halvorson2016, sec. 5). By the axiom of choice, there are functors
and
essentially inverse to P 1 and P 2. Since
, we can define functors
and
. Functors F and G constitute an equivalence of categories. It is a matter of routine to check that F and G are reconstruction functors with regard to the reconstruction manuals Φ and Ψ. QED
In order to prove theorem 2, we need several lemmas and definitions.
Lemma B2. Suppose α and α′ both are associations of Σ1-types with Σ2-types satisfying 1 in definition 7 with respect to the same reconstruction manual Φ for Σ1 in terms of Σ2. Then, for every type τ of
.
So given a type τ of Σ1, a reconstruction manual Φ for Σ1 in terms of Σ2 associates a unique type Φ(τ) of Σ2 with τ.
Definition B2. Let Φ be a reconstruction manual for Σ* in terms of Σ, and let T be a theory with signature Σ. Then we say that Φ is formally admissible with regard to T 2 iff for every model 𝒜 of T
1. for every basic sort σ of Σ*, Φσ defines a nonempty set over 𝒜.
2. for every function symbol f of Σ*, Φf defines a function over 𝒜.
3. for every individual constant c of Σ*, Φc defines a singleton over 𝒜.
From now on suppose that (a) T and T* have disjoint signatures Σ and Σ* and (b) Φ is a reconstruction manual for Σ* in terms of Σ that is formally admissible with regard to T.
Definition B3. Σ+ is a Φ-extension of Σ by external auxiliaries iff Σ+ contains the symbols of Σ as well as Σ* and
1. for every basic sort σ in Σ*, Σ+ contains exactly one new function symbol i σ with σ as input type and Φ(σ) as output type.
2. for every type τ of Σ*, Σ+ contains exactly one new function symbol j τ with τ as input type and Φ(τ) as output type.
From now on let Σ+ be a Φ-extension of Σ by external auxiliaries.
Definition B4. Let
. Then we call the Σ+-structure 𝒜+ with the following properties the canonical expansion of 𝒜 to Σ+ induced by Φ:
1.
.2. For every symbol S in Σ* that is not an individual constant:
.3. For every individual constant c in
.4. For every basic sort σ in
is the identity on
.5. For every type τ over
is the identity on D τ, where D τ is defined as follows:a) if τ is a basic sort of Σ*, then
.b) if
is a product type of Σ*, then
.c) if
is a power type of Σ*, then
.
Definition B5. The canonical expansion of Mod(T) to Σ+ induced by Φ is the isomorphic closure of {
}, where 𝒜+ is the canonical expansion of 𝒜 to Σ+ induced by Φ for
.
Henceforth, it is useful to write variables with their type as superscript (e.g., ‘x τ’) to avoid confusion.
Lemma B3. The canonical expansion of Mod(T) to Σ+ induced by Φ is a stepwise GD-expansion of Mod(T) to Σ+ by (
,
,
), where
1.
consists of subsort-definitions for all basic sorts σ of Σ*:
2.
consists of definitions of the injection symbols j τ for types τ of Σ*:where the definiens φ τ(x τ, z Φ(τ)) is a
-formula for every type τ of Σ*, recursively defined as follows:a) if τ is a basic sort of Σ*, then φ τ(x τ, z Φ(τ)) is the formula
.b) if
is a product type of Σ*, then φ τ(x τ, z Φ(τ)) is the formula
c) if
is a power type of Σ*, then φ τ(x τ, z Φ(τ)) is the formula
3.
consists of the following definitions:a)
, for every predicate P in Σ* of type τ.b)
, for every function symbol f in Σ* with input-type τ 1 and output-type τ 2.c)
, for every individual constant c of basic sort σ in Σ*.
Lemma B4. Suppose that
is a reconstruction functor with reconstruction manual Φ, the isomorphisms in Cat(T*) are precisely the Σ*-isomorphisms, 𝒜 is a model of T, and 𝒜+ is the canonical expansion of 𝒜 to Σ+ induced by Φ. Then H(𝒜) is Σ*-isomorphic to
.
Lemma B5. Suppose E is the canonical expansion of Mod(T) to Σ+ induced by Φ,
, and
is the canonical expansion of
to Σ+ induced by Φ. Then 𝒜 is Σ+-isomorphic to
.
Theorem 2. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the isomorphisms in Cat(Ti) are precisely the Σ(Ti)-isomorphisms (
). If T 1 and T 2 are DC-equivalent, then T 1 and T 2 are GD-equivalent up to external auxiliaries.
Proof. Suppose T 1 and T 2 are DC-equivalent. Let Σ1 and Σ2 be their signatures. Then there are reconstruction functors
and
constituting a (dual) equivalence accompanied by reconstruction manuals Φ for Σ2 over Σ1 and Ψ for Σ1 over Σ2. It follows that Φ and Ψ are formally admissible with regard to T 1 and T 2, respectively. Let
and
be Φ- and Ψ-extensions of Σ1 and Σ2 by external auxiliaries, respectively. Now let E 1 and E 2 be the canonical expansions of Mod(T 1) and Mod(T 2) to
and
induced by Φ and Ψ. We know from lemma 3 that E 1 and E 2 are stepwise GD-expansions of Mod(T 1) and Mod(T 2), respectively. We show that
.Suppose
. Then there is a
such that
. Moreover,
. Let
be the canonical expansion of
to
induced by Φ. Check that the following statements hold.
1. ℬ is
-isomorphic to
(by lemma B5 and
).2.
is Σ2-isomorphic to
(lemma B4).3.
is Σ2-isomorphic to
(by 1, 2 and
).4.
is Σ1-isomorphic to
(because F and G constitute a (dual) equivalence and isomorphisms in Cat(Ti) are Σ(Ti)-isomorphisms).5.
is Σ1-isomorphic to
, where
is the canonical expansion of
induced by Ψ (lemma B4).6.
is Σ1-isomorphic to
(by 4 and 5).7. 𝒜 is
-isomorphic to
(by 3 and 6).
Since
, its canonical expansion
by Ψ is in E 2. This implies
.
is closed under
-isomorphism because E 2 is closed under
-isomorphism. Hence,
. The proof for the other direction is analogous. QED
Definition B6. We say that χ is a family of formulas defining inner isomorphisms of T1-models with regard to F, Φ and G, Ψ iff
1. χ maps every basic sort σ1 of Σ(T 1) to a Σ(T 1)-formula
.2. for every basic sort σ1 of Σ(T 1) and every
,
is a bijection from
to
; and these bijections constitute a Σ(T 1)-isomorphism from 𝒜1 to GF(𝒜1).
Definition B7. Let Σ(T 1)+ be a Φ-extension of Σ(T 1) by external auxiliaries, let E 1 be the canonical expansion of Mod(T 1) to Σ(T 1)+ induced by Φ and let χ be a family of formulas defining inner isomorphisms of T 1-models with regard to F, Φ and G, Ψ. Then the χ-expansion of Mod(T 1) to
induced by Φ and Ψ is the stepwise GD-expansion of E 1 to
by (
,
) where
is as in lemma B3 and
comprises definitions of the following form for all basic sorts σ1 of Σ(T 1):
Definition B8. T 1 and T 2 are DC-equivalent with definable inner isomorphisms iff there are functors
,
and reconstruction manuals Φ for Σ(T 2) in terms of Σ(T 1) and Ψ for Σ(T 1) in terms of Σ(T 2) establishing a DCE between T 1 and T 2 such that the many-sorted Ahlbrandt-Ziegler condition holds:
1. there is a family of formulas χ defining inner isomorphisms of T 1-models with regard to F, Φ and G, Ψ and
2. there is a family of formulas
defining inner isomorphisms of T 2-models with regard to G, Ψ and F, Φ such that3. these isomorphisms are compatible with each other and with Φ and Ψ in the following sense:
a) for every model ℬ1 of the χ-expansion of Mod(T 1) to
induced by Φ and Ψ and all basic sorts σ2 of Σ(T 2):
.b) for every model ℬ2 of the
-expansion of Mod(T 2) to
induced by Φ and Ψ and all basic sorts σ1 of Σ(T 1):
.
Theorem 3. Suppose T 1 and T 2 are theories with disjoint signatures, and suppose the isomorphisms in Cat(Ti) are precisely the Σ(Ti)-isomorphisms (
). If T 1 and T 2 are DC-equivalent with definable inner isomorphisms, then T 1 and T 2 are GD-equivalent.
Proof. Let Σ1, Σ2 be the signatures of T 1, T 2. There are functors F, G, reconstruction manuals Φ, Ψ, and stepwise GD-expansions E 1, E 2 to extended signatures
,
as in the proof of theorem 2, and we know that
. Moreover, there are families of formulas χ and
defining inner isomorphisms of T 1-models and T 2-models, respectively.
Note that, for every basic sort σ1 and every type τ 1 of Σ1, the auxiliary function symbols
and
are in
but not in
. Analogously, for every basic sort σ2 and every type τ 2 of Σ2, the auxiliary function symbols
and
are in
but not in
. Moreover, that is the only difference between
and
.
Let
be the χ-expansion of Mod(T 1) to
induced by Φ and Ψ, and let
be the
-expansion of Mod(T 2) to the same signature. By definition,
is a stepwise GD-expansion of Ei (
). We have to show that
. It is sufficient if
for σ1 in Σ1 and
for σ2 in Σ2 because the definitions of
and
are the same for
and
. That
and
follows directly from the many-sorted Ahlbrandt-Ziegler condition. QED
