1 Introduction

Van Fraassen’s constructive empiricism, with its central notion of empirical adequacy, and the partial structures approach, with its central notions of partial truth and partial isomorphism, are two major lines of research in the semantic view, according to which scientific theories are best represented by model- or set-theoretic structures. Proponents of the partial structures approach have argued that these two approaches are a perfect fit for each other: Da Costa and French (1990) have discussed a means for describing empirical adequacy as partial truth, and Bueno (1997) has used the notions of partial structure, partial isomorphism, and partial truth for generalizing empirical adequacy.

I will argue that da Costa and French’s attempt at describing empirical adequacy fails (Sect. 2), as does Bueno’s attempt at generalizing empirical adequacy (Sect. 4). As shown in the first part of this discussion (Lutz 2014b), empirical adequacy is under certain conditions equivalent to the technical notion of generalized approximate truth, and it can be generalized with the help of approximation sets so that it can deal with situations involving lack of knowledge and approximations. I argue in this part of the discussion that this generalization of empirical adequacy fits Bueno’s motivations better than his own generalizations (Sect. 4). I will further show that the central concepts of the partial structures approach, partial truth (Sect. 2), partial isomorphism, and partial homomorphism (“Appendix A”) can be captured in terms of approximation sets. Therefore everything that can be expressed with partial structures can be expressed with approximation sets. Indeed, approximation sets are more expressive than partial structures, which cannot express approximate functions nor approximate constants (Sect. 3).

The initial motivation for Bueno’s generalizations was Suárez’s criticism of constructive empiricism. I briefly show that both the criticism (“Appendix B”) and the first of Bueno’s replies (“Appendix C”) fail, while Bueno’s second reply succeeds even against Suárez’s unjustified criticism. This success, however, is the result of an almost trivially weak account of approximate empirical adequacy.

2 Empirical adequacy as partial truth

I will rely on the standard notations used in model theory (cf. Chang and Keisler 1990, §1.3).Footnote 1 A structure \(\mathfrak {B}\) is a pair \(\langle B,\mathscr {I}\rangle \) consisting of a domain B and an interpretation function \(\mathscr {I}\) from a set of \(\lambda _i\)-place relation symbols \(R_i\), \(\rho _j\)-place function symbols \(F_j\), and constant symbols \(c_k\) to, respectively, \(\lambda _i\)-ary relations, \(\rho _j\)-ary functions, and constants on B. Unless stated otherwise, I will in the following always assume this set of symbols with the same arities. I will sometimes refer to symbols as ‘terms’ when this does not lead to ambiguity. B will always be the domain \({\mathrm {dom}}{\left( \mathfrak {B} \right) } \) of \(\mathfrak {B}\), \(C={\mathrm {dom}}{\left( \mathfrak {C} \right) } \) etc. If \(\mathfrak {B} =\langle B,\mathscr {I}\rangle \), I write \(R_i^{\mathfrak {B}}\) instead of \(\mathscr {I}(R_i)\), and analogously for functions and constants. \(R_i^{\mathfrak {C}}\) is the relation in \(\mathfrak {C}\) that corresponds to relation \(R_i^{\mathfrak {B}}\) in \(\mathfrak {B}\), and analogously for functions and constants. In displayed form, I write a structure \(\mathfrak {B}\) as \(\langle B, R_1^{\mathfrak {B}},\dots ,R_s^{\mathfrak {B}},F_1^{\mathfrak {B}},\dots ,F_t^{\mathfrak {B}},c_1^{\mathfrak {B}},\dots ,c_u^{\mathfrak {B}}\rangle \) or, for possibly infinite index sets, \(\langle B,R_i^{\mathfrak {B}},F_j^{\mathfrak {B}},c_k^{\mathfrak {B}}\rangle _{i\in I,j\in J,k\in K}\). Substructures are defined as usual (see, e. g., Chang and Keisler 1990, pp. 21–22): A structure \(\mathfrak {B}\) is a substructure of structure \(\mathfrak {C}\) (\(\mathfrak {B} \subseteq \mathfrak {C} \)) if and only if \(B\subseteq C\), and each relation \(R_i^{\mathfrak {B}}\) of \(\mathfrak {B}\) is the restriction to B of the corresponding relation \(R_i^{\mathfrak {C}}\) of \(\mathfrak {C}\) (i. e., \(R_i^{\mathfrak {B}}=R_i^{\mathfrak {C}}\cap B^{\lambda _i}\)), each function \(F_j^{\mathfrak {B}}\) of \(\mathfrak {B}\) is the restriction to B of the corresponding function \(F_j^{\mathfrak {C}}\) of \(\mathfrak {C}\) (i. e., \(F_j^{\mathfrak {B}}=F_j^{\mathfrak {C}}\vert {B}^{\rho _j}\)), and each constant of \(\mathfrak {B}\) is the corresponding constant of \(\mathfrak {C}\) (cf. Hodges 1993, pp. 5–6).

Within this formalism, van Fraassen’s definition of ‘theory’ (van Fraassen 1980, p. 64; cf. van Fraassen 2008, p. 238) can be expressed as follows:

Definition 1

A theory \(\bigl \langle \{\mathfrak {T} _n\}_{n\in N},\{\mathbf {E} _n\}_{n\in N}\bigr \rangle \) contains a family, i. e. an indexed set, of structures (the models of the theory) and for each structure \(\mathfrak {T} _n=\Bigl \langle T_n, R_i^{\mathfrak {T} _n}, F_j^{\mathfrak {T} _n}, c_k^{\mathfrak {T} _n}\Bigr \rangle _{i\in I_n,j\in J_n,k\in K_n}\) a set \(\mathbf {E} _n\) of empirical substructures, such that for each \(\mathfrak {E} \in \mathbf {E} _n\), \(\mathfrak {E} \subseteq \mathfrak {T} _n\). With each model, a theory also contains every isomorphic structure and its correspondingFootnote 2 empirical substructures.

The argument for this formalization is given in the first part of this discussion (Lutz 2014b, §§3.1–3.2), where it is shown in detail that a model of a theory can have multiple empirical substructures.Footnote 3 As a shorthand, define \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \mathrel {\mathop :}=\bigl \langle \{\mathfrak {T} _n\}_{n\in N},\{\mathbf {E} _n\}_{n\in N}\bigr \rangle \).

Van Fraassen’s definition of ‘appearances’ (van Fraassen 1980, p. 64) can be expressed as follows:

Definition 2

Appearances are given by a set \(\mathbf {A}\) of structures. A structure \(\mathfrak {A} \in \mathbf {A} \) is an appearance.

Again, the first part of this discussion contains an argument for there being multiple appearances.

Definitions 1 and 2 then allow for

Definition 3

A theory \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is empirically adequate for appearances \(\mathbf {A}\) if and only if there is some \(n\in N\) such that for every \(\mathfrak {A} \in \mathbf {A} \), there is an \(\mathfrak {E} \in \mathbf {E} _n\) with \(\mathfrak {E} \cong \mathfrak {A} \).

This is the precise formulation of the informal statement that “a theory is empirically adequate exactly if what it says about the observable things and events in this world, is true” (van Fraassen 1980, p. 12). And it is essential to go beyond this informal statement, since the notion of empirical adequacy “will have to be spelt out very carefully if it is not to bite the dust among hackneyed objections” (van Fraassen 1980, p. 19). It is with Definition 3, then, that van Fraassen (1980, p. 12, emphasis removed) defines constructive empiricism as the claim that science “aims to give us theories which are empirically adequate; and acceptance of a theory involves as belief only that it is empirically adequate”.

Da Costa and French (1990, p. 257) now claim that van Fraassen’s notion of empirical adequacy can be expressed in terms of partial truth as it is defined in the partial structures approach. The partial structures approach is motivated by a simple epistemological point: Most of the time, scientists do not have enough information about a domain to determine its structure with arbitrary precision. For most relations, it is at best known of some tuples of objects that they fall under the relation and known of some objects that they do not fall under it. For many if not most tuples this is unknown. Similarly, the value of a function is not known for all of its possible arguments. Partial structures are defined to take this lack of knowledge into account.

While most works on partial structures in the philosophy of science (e. g., Bueno 1997; da Costa and French 1990, 2000) do not consider functions, and the foundational paper by Mikenberg et al. (1986) does not consider constants, the respective definitions can be easily combined to give

Definition 4

\({\tilde{\mathfrak {B}}}\) is a partial structure for the symbols \(\{R_i,F_j,c_k\}_{i\in I,j\in J,k\in K}\) if and only if

$$\begin{aligned} {\tilde{\mathfrak {B}}} =\bigl \langle B, R_i^{{\tilde{\mathfrak {B}}}},F_j^{{\tilde{\mathfrak {B}}}},c_k^{{\tilde{\mathfrak {B}}}}\bigr \rangle _{i\in I,j\in J,k\in K}\,\,,\end{aligned}$$
(1)

where \(B\ne \varnothing \), \(R_i^{{\tilde{\mathfrak {B}}}}=\bigl \langle R_i^{{\tilde{\mathfrak {B}}},+},R_i^{{\tilde{\mathfrak {B}}},-},R_i^{{\tilde{\mathfrak {B}}},\circ }\bigr \rangle \) is a tripartition of \(B^{\lambda _i}\) for each \(i\in I\), \(F_j^{{\tilde{\mathfrak {B}}}}: W_{{\tilde{\mathfrak {B}}},j}\longrightarrow B\) is a function with domain \(W_{{\tilde{\mathfrak {B}}},j}\subseteq B^{\rho _j}\) for each \(j\in J\), and \(c_k^{{\tilde{\mathfrak {B}}}}\in B\) for each \(k\in K\).

The definition of partial structures by Mikenberg et al. (1986, def. 1) is recovered for \(K=\varnothing \), the definition by da Costa and French (1990, pp. 255–256) and da Costa, Bueno, and French (1998, p. 605) for \(J=\varnothing \).Footnote 4 Lack of knowledge is represented by non-empty sets \(R_i^{{\tilde{\mathfrak {B}}},\circ }\) and sets \(W_{{\tilde{\mathfrak {B}}},j}\subset B^{\rho _j}\).

Taking into account background knowledge, expressed by a set \(\tilde{\varPi } \) of sentences, the primary statements, Mikenberg et al. (1986, def. 2.ii) and da Costa and French (1990, p. 256) give

Definition 5

Structure \(\mathfrak {C}\) is \({\tilde{\mathfrak {B}}}\) -normal for primary statements \(\tilde{\varPi } \) if and only if \(C=B\), \(R_i^{{\tilde{\mathfrak {B}}},+}\subseteq R_i^{\mathfrak {C}}\subseteq B^{\lambda _i}-R_i^{{\tilde{\mathfrak {B}}},-}\) for each \(i\in I\), \(F_j^{\mathfrak {C}}\vert {W}_{{\tilde{\mathfrak {B}}},j}=F_j^{{\tilde{\mathfrak {B}}}}\) for each \(j\in J\), \(c_k^{\mathfrak {C}}=c_k^{{\tilde{\mathfrak {B}}}}\) for each \(k\in K\), and \(\mathfrak {C} \vDash \tilde{\varPi } \).

This allows for the definition of partial truth, also called ‘pragmatic truth’ or ‘quasi-truth’:

Definition 6

Sentence \(\varphi \) is partially true in partial structure \({\tilde{\mathfrak {B}}}\) relative to primary statements \(\tilde{\varPi } \) if and only if there is a structure \(\mathfrak {C}\) that is \({\tilde{\mathfrak {B}}}\)-normal for \(\tilde{\varPi } \) and \(\mathfrak {C} \vDash \varphi \).

Since a theory may be given by a family \(\{\mathfrak {T} _n\}_{n\in N}\) rather than a set of sentences, da Costa and French (1990, pp. 256–257) giveFootnote 5

Definition 7

\(\{\mathfrak {T} _n\}_{n\in N}\) is partially true in partial structure \({\tilde{\mathfrak {B}}}\) relative to \(\tilde{\varPi } \) if and only if for some \(n\in N\), \(\mathfrak {T} _n\) is \({\tilde{\mathfrak {B}}}\)-normal for \(\tilde{\varPi } \).

If thus \(\{\mathfrak {T} _n\mathop {:}n\in N\}\) is the class of models of some finite set \(\varSigma \) of sentences, \(\{\mathfrak {T} _n\}_{n\in N}\) is partially true in \({\tilde{\mathfrak {B}}}\) relative to \(\tilde{\varPi } \) if and only if the conjunction of the elements of \(\varSigma \) is partially true in \({\tilde{\mathfrak {B}}}\) relative to \(\tilde{\varPi }\).

Restricting their discussion to relational structures (which contain only relation symbols), da Costa and French (1990, p. 255) suggest formalizing our knowledge of a domain by first giving a partial structure \({\tilde{\mathfrak {O}}} =\bigl \langle O,R_i^{{\tilde{\mathfrak {O}}}}\bigr \rangle _{i\in I}\) for the set of relation symbols \(\{R_i\}_{i\in I}\), where O is the set of observable objects. Then they extend the domain O by the domain \(U, O\cap U=\varnothing \), of unobservable objects and introduce further relations \(\{R_i\}_{i\in I'}, I'\cap I=\varnothing \) over \(O\cup U\) to arrive at a partial structure \({\tilde{\mathfrak {B}}} =\bigl \langle O\cup U, R_i^{{\tilde{\mathfrak {B}}}}\bigr \rangle _{i\in I\cup I'}\) (da Costa and French 1990, p. 256).Footnote 6 While they do not discuss explicitly what happens to the partial relations \(\bigl \{R_i^{{\tilde{\mathfrak {O}}}}\bigr \}_{i\in I}\) when the domain is extended, I take it that \(R_i^{{\tilde{\mathfrak {B}}},+}=R_i^{{\tilde{\mathfrak {O}}},+}\) and \(R_i^{{\tilde{\mathfrak {B}}},-}=R_i^{{\tilde{\mathfrak {O}}},-}\) for each \(i\in I\). In other words, the relation symbols \(\{R_i\}_{i\in I}\) do not serve to describe the unobservable objects.

Da Costa and French (1990, p. 257) then suggest that \({\tilde{\mathfrak {B}}}\) and the primary statements “can be taken to represent [a theory’s] ‘empirical substructures’, if [the primary statements are] restricted to observation statements only.” And this then, they claim, “leads us to understand the ‘empirical adequacy’ of a theory as its pragmatic truth” so that the formalism of partial structures “may provide a suitable theory of truth for van Fraassen’s ‘constructive empiricism’”. But it is at least not obvious how it could do this: For one, it is not clear in what sense \({\tilde{\mathfrak {B}}}\) “represents” the empirical substructures. As Bueno (1997, p. 595) furthermore points out, if it were clear, and empirical adequacy were then taken to be partial truth, it would follow that a theory is empirically adequate if and only if it is partially true according to its own empirical substructure. Thus the appearances would play no role whatsoever in the empirical adequacy of a theory.

It may be that da Costa and French (1990) had the following in mind: If the appearances \(\mathbf {A}\) are but a singleton set \(\{\mathfrak {A} \}\) with \(\mathfrak {A} =\langle O, R_i^{\mathfrak {A}}\rangle _{i\in I}\) and \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is empirically adequate for \(\{\mathfrak {A} \}\) (and hence contains the same predicates as \(\mathfrak {A}\)), then \(\mathfrak {A}\) is isomorphic to an empirical substructure \(\mathfrak {E} \in \mathbf {E} _n\) of \(\mathfrak {T} _n\) for some \(n\in N\). Since theories are closed under isomorphism, this is equivalent to \(\mathfrak {A}\) being an empirical substructure \(\mathfrak {E} \in \mathbf {E} _m\) of \(\mathfrak {T} _m\) for some \(m\in N\) (Hodges 1993, ex. 1.2.4b). Now \({\tilde{\mathfrak {B}}} \mathrel {\mathop :}=\langle {\mathrm {dom}}{\left( \mathfrak {T} _m\right) }, \langle R_i^{\mathfrak {A}}, O^{\lambda _i}-R_i^{\mathfrak {A}},{\mathrm {dom}}{\left( \mathfrak {T} _m\right) } ^{\lambda _i}-O^{\lambda _i}\rangle \rangle _{i\in I}\) is a partial structure, and \(\mathfrak {T} _m\) is \({\tilde{\mathfrak {B}}}\)-normal for any set \(\tilde{\varPi }\) with \(\mathfrak {T} _m\vDash \tilde{\varPi } \). Thus \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is partially true in partial structure \({\tilde{\mathfrak {B}}}\) relative to \(\tilde{\varPi }\) and hence the empirical adequacy of a theory leads to its partial truth in a structure that corresponds to the appearance. Bueno’s objection that the appearance plays no role in da Costa and French’s attempt is thereby avoided, and it is clear in which sense the partial structure “represents” the appearance.

This result, however, does not show that van Fraassen’s notion of empirical adequacy can be expressed as partial truth: Most obviously, the result relies on the assumption that the appearances have to be given by a single structure \(\mathfrak {A}\), an assumption that van Fraassen decidedly does not share, as noted in connection with Definitions 1, 2 and 3. Furthermore, the partial structure \({\tilde{\mathfrak {B}}}\) that corresponds to the appearance \(\mathfrak {A}\) can only be constructed with the help of the model of the theory of which the appearance is a substructure. Thus \({\tilde{\mathfrak {B}}}\) is in part determined by the content of the theory (namely its claim about the cardinality of the domain). For van Fraassen (2008, p. 284), an

appearance is determined jointly by the measurement set-up (involving both apparatus and the system to which it is applied), the experimental practice, and the theoretical conceptual framework in which the target and measurement procedure are classified, characterized, and understood[,]

but not, it seems, additionally by the content of any particular theory. The difference between the theoretical conceptual framework and the content of a theory is crucial: The theoretical conceptual framework of a theory does not restrict the possible states of the world in any way and is neither true nor false. The content of a theory, on the other hand, does restrict the possible states of the world, and can therefore be false.Footnote 7 What is worse, it is theoretical content that is needed for the construction of \({\tilde{\mathfrak {B}}}\): \(\mathfrak {A}\) contains the empirical content of the theory; everything else, and thus specifically the cardinality of the theory’s domain, is about unobservables. In his criticism of syntactic approaches, van Fraassen (1980, p. 54) states that the “empirical import of a theory cannot be isolated in this syntactical fashion, by drawing a distinction among theorems in terms of vocabulary” because “we shall be able to state in the observational vocabulary (however conceived) that there are unobservable entities, and, to some extent, what they are like.” When expressing the appearance \(\mathfrak {A}\) in its corresponding partial structure \({\tilde{\mathfrak {B}}}\), we shall be able to state in the partial structure that there are unobservable entities, and how many there are. For van Fraassen, this should be a big step in the wrong direction.

Finally, empirical adequacy has not been defined in terms of partial truth; rather, it has been shown that the empirical adequacy of a theory leads to its partial truth in a specifically constructed partial structure. But this partial structure can differ from theory to theory (since different theories can have domains of different cardinalities). Furthermore, the partial truth of the theory does not entail its empirical adequacy, that is, partial truth is only a necessary, not a sufficient condition for empirical adequacy. This is because the partial truth of \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) in \({\tilde{\mathfrak {B}}}\) only entails that \(\mathfrak {A}\) is a substructure of some \(\mathfrak {T} _m, m\in N\). It does not entail that \(\mathfrak {A}\) is an empirical substructure of \(\mathfrak {T} _m\).

Thus even in this charitable reconstruction, da Costa and French’s attempt to capture empirical adequacy in terms of partial truth is not successful.

3 Generalizing partial structures

While partial structures are not as hospitable to empirical adequacy as claimed by its proponents, the bigger problem is that they are also not particularly well-suited for their initially intended applications. It is probably because the discussions of partial structures and partial truth in the philosophy of science have typically ignored functions and, to some extent, constants, that this lack of applicability has so far been overlooked: Partial structures cannot capture the lack of knowledge about functions that typically occurs in the sciences, and cannot capture lack of knowledge about constants at all.

The interpretation of a relation symbol \(R_i\) in a partial structure \({\tilde{\mathfrak {B}}}\) can capture fairly general cases of lack of knowledge by determining a set \(R_i^{{\tilde{\mathfrak {B}}},\circ }\) of tuples that may or may not be in the extension of \(R_i\); however, in a partial structure each constant \(c_k\) is interpreted by one unique element \(c_k^{{\tilde{\mathfrak {B}}}}\in B\), so that the value of every constant is known precisely. Thus partial structures can be applied only in situations in which all constants are known with absolute precision, and thus almost only in situations in which no empirically determined constants like the fine structure constant, the gravitational constant, or any material constants occur at all. For instance, French and Ladyman (1997, p. 379) apply partial structures to the historical development of the Londons’ equations for superconductivity, one of them relating the current density \(\mathbf {j}\) and the magnetic field \(\mathbf {H}\) via the speed of light c and the constant \(\varLambda =\frac{m}{n_{\text {s}}e^2}\), where m is the mass and e the charge of an electron, and \(n_{\text {s}}\) is the density of electrons participating in superconduction (French and Ladyman 1997, p. 373). All the constants occurring in this equation (c, m, e, and \(n_{\text {s}}\)) have to be assumed as known with absolute precision. This is especially problematic for the phenomenological constant \(n_{\text {s}}\), which is experimentally determined by, for instance, measuring the conductivity of superconductors for alternating currents (Annett 2004, p. 60).

Such a measurement will probably never be perfectly precise, and even if, in the far future, the electron density could be determined with perfect precision, this would not be relevant for the analysis of the historical developoment of the Londons’ equation. Regarding fundamental constants like the fine structure constant, one may take the view that the presence of such a constant is an indicator that the theory in which they occur is not the final theory, which should be free of any constants. This view is at least controversial, since it is not obvious that there is such a theory; but the main problem is again that even if there is such a theory, its existence will make no difference to the applicability of partial structures before it has been found. In short, the preceding two replies to the partial structures’ problem with constants assume that partial structures are only applied in a state of complete knowledge (about constant values or the final theory); but partial structures were intended to be applied (and have been applied by its main proponents) to situations with incomplete knowledge. Finally, one may take the view that all alleged constants in theories are actually functions, because their values change with time, energy scale, or in some other way. This view is also controversial, and also does not solve the problem for the application of partial structures to those theories that do involve constants (like the Londons’ equation); furthermore, the treatment of functions in partial structures is barely less problematic than the treatment of constants.Footnote 8

At first sight, partial structures seem to fare better with respect to function symbols, since they assign values to functions only over a restricted domain. But such a treatment of functions can capture only a lack of knowledge that is encountered very seldomly in the sciences. For in a partial structure \({\tilde{\mathfrak {B}}}\), the values of a function \(F_j^{{\tilde{\mathfrak {B}}}}\) are known with arbitrary precision over \(W_{{\tilde{\mathfrak {B}}},j}\), but not at all over \(B^{\rho _j}-W_{{\tilde{\mathfrak {B}}},j}\). The result is that for each argument of the function, one either knows the value of the function with absolute precision, or has no information whatsoever about its possible values. In contrast, the measurement of, say, the time averaged intensity \(\overline{\psi } \) of a light wave over some spatial interval \([x_1,x_2]\) will typically have a finite precision, giving a range of possible intensity values \([y_1,y_2]\subset \mathbb {R}^{\ge 0}\) for each point \(x\in [x_1,x_2]\). A partial structure, however, can only capture measurements that, at any point x, give either a precise value \(\overline{\psi } (x)=y_3\in \mathbb {R}^{\ge 0}\), or the trivial range \(\mathbb {R}\). In the case of the Londons’ equation discussed by French and Ladyman (1997, p. 379), \(\mathbf {j}\) and \(\mathbf {H}\) are vector valued functions over space and time. In a partial structure, these function values have to be absolutely precise over one (possibly empty, possibly all-encompassing) space-time volume and absolutely imprecise over the remainder. Over no space-time value can they be determined only up to a non-zero, finite interval. Similarly, if the fine-structure constant, for instance, is actually a function over the energy scale, partial structures could only render it completely undetermined at some energies, and determined with absolute precision at the remaining energies. Our current knowledge of the fine-structure constant as being within in some non-zero, finite interval could not be expressed.

Thus partial structures are ill-equipped to capture lack of knowledge about functions and constants, and accordingly also ill-equipped to capture approximations of constants and functions. It is possible to reformulate a theory so that it contains relations instead of functions and constants. However, this increases the number of axioms of the theory, complicates the application of partial structures in a way analogous to the way that it complicates the application of standard structures (Hodges 1993, p. 2), and removes partial structures further from actual scientific practice. Besides, if theories need to be reformulated so that they can be analyzed with partial structures, the partial structures approach becomes in a sense superfluous: Every analysis of a theory in terms of partial structures is equivalent to an analysis of a reformulated theory in standard model theory (Lutz 2015). And if a theory has to be reformulated for an analysis in terms of partial structures, it might just as well be reformulated for an analysis in terms of standard model theory.

As argued in the first part of this discussion (Lutz 2014b, §§5.2–5.3), imprecise functions and constants can be handled fairly satisfyingly with the help of approximation sets, which are sets of structures that are generated from the denotations of approximate relation, function, and constant symbols. The denotation of a \(\lambda _i\)-place relation symbol \(R_i\) that is approximate over some domain A tripartitions the product domain \(A^{\lambda _i}\) into a set \(R_i^+\) of definite instances (the positive extension of \(R_i\)), a set \(R_i^-\) of definite non-instances (the negative extension), and a set \(R^\circ \) of borderline cases of \(R_i\) (the neutral extension). The denotation of a function symbol \(F_j\) that is approximate over A does not assign a single element \(b\in A\) to a \(\rho _j\)-tuple \(\langle a_1,\dots ,a_{\rho _j}\rangle \in A^{\rho _j}\), but rather a set \(F_j^{+\circ }(a_1,\dots ,a_{\rho _j})\subseteq A\). I will refer to the set \(\bigl \{\langle a_1,\dots ,a_{\rho _j},b\rangle \mathop {:}a_1,\dots ,a_{\rho _j}\in A, b\in F_j^{+\circ }(a_1,\dots ,a_{\rho _j})\bigr \}\) as the non-negative extension \(F^{+\circ }\) of \(F_j\). If \(F_j^{+\circ }(a_1,\dots ,a_{\rho _j})\) is a singleton set, I will say that \(F_j\) has a positive extension for \(\langle a_1,\dots ,a_{\rho _j}\rangle \). Considering constant symbols 0-place function symbols, this means that the denotation of a constant symbol \(c_k\) that is approximate over A is a set \(c_k^{+\circ }\subseteq A\).

The denotations of approximate terms over A lead to a set of of structures (Lutz 2014b, def. 7), which can be restricted to a penumbral set \(\mathbf {P}\) to express additional information not expressed by the denotations of the terms. Fine (1997, p. 123) gives the example of ‘pink’ and ‘red’ having disjoint extensions even if the positive extension of one is not a subset of the negative extension of the other. Przełęcki (1976, p. 376) gives the example of a function symbol’s extensions, which may be restricted “by some additional conditions of a more theoretical nature”, demanding, for instance, that any extension of the symbol be continuous.

Definition 8

Let the terms \(\{R_i,F_j,c_k\}_{i\in I,j\in J,k\in K}\) be approximate over domain A with positive, negative, and non-negative extensions \(\{R_i^+, R_i^-, F_j^{+\circ }, c_k^{+\circ }\}_{i\in I,j\in J,k\in K}\), and penumbral set \(\mathbf {P}\). Then the terms’ approximation set \(\mathbf {M}\) for A contains all and only structures \(\mathfrak {M} \in \mathbf {P} \) for which

$$\begin{aligned}&M=A, \end{aligned}$$
(2)
$$\begin{aligned}&R_i^+\subseteq R_i^{\mathfrak {M}}\subseteq A^{\lambda _i}-R_i^-\text { for all }i\in I, \end{aligned}$$
(3)
$$\begin{aligned}&F_j^{\mathfrak {M}}\subseteq F_j^{+\circ }\text { for all }j\in J, \text { and} \end{aligned}$$
(4)
$$\begin{aligned}&c_k^{\mathfrak {M}}\in c_k^{+\circ }\text { for all }k\in K\,\,.\end{aligned}$$
(5)

The penumbral set is assumed to be such that \(R_i^+=\bigcap \left\{ R_i^{\mathfrak {M}}\mathop {:}\mathfrak {M} \in \mathbf {M} \right\} \), \(R_i^-=\bigcap \left\{ M^{\lambda _i}-R_i^{\mathfrak {M}}\mathop {:}\mathfrak {M} \in \mathbf {M} \right\} \), \(F_j^{+\circ }=\bigcup \left\{ F_j^{\mathfrak {M}}\mathop {:}\mathfrak {M} \in \mathbf {M} \right\} \), and \( c_k^{+\circ }=\bigcup \left\{ c_k^{\mathfrak {M}}\mathop {:}\mathfrak {M} \in \mathbf {M} \right\} \). In other words, the penumbral set is assumed to exclude only structures from the approximation set that cannot be excluded with the help of positive, negative, and non-negative extensions. Note that condition (45) for functions is equivalent to the demand that for each \(\rho _j\)-tuple \(\langle a_1,\dots ,a_{\rho _j}\rangle \in A^{\rho _j}\) of the domain, \(F_j^{\mathfrak {M}}(a_1,\dots ,a_{\rho _j})\in F_j^{+\circ }(a_1,\dots ,a_{\rho _j})\).

Using approximation sets instead of partial structures does not lead to any loss of expressive power, because every partial structure can be expressed with the help of a corresponding approximation set:

Definition 9

Let \({\tilde{\mathfrak {B}}} =\bigl \langle B, R_i^{{\tilde{\mathfrak {B}}}}, F_j^{{\tilde{\mathfrak {B}}}},c_k^{{\tilde{\mathfrak {B}}}}\bigr \rangle _{i\in I,j\in J,k\in K}\) be a partial structure, \(\tilde{\varPi }\) a set of primary statements, and let \(\mathbf {P}\) be the class of models of \(\tilde{\varPi }\). Then the approximation set for \(\{R_i^+, R_i^-, F_j^{+\circ }, c_k^{+\circ }\}_{i\in I,j\in J,k\in K}\) over B with penumbral set \(\mathbf {P}\) and \(R_i^+=R_i^{{\tilde{\mathfrak {B}}},+}\), \(R_i^-=R_i^{{\tilde{\mathfrak {B}}},-}\), \(F_j^{+\circ }=F_j^{{\tilde{\mathfrak {B}}}}\cup (B^{\rho _j}-W_{{\tilde{\mathfrak {B}}},j})\times B\), and \(c_k^{+\circ }=\{c_k^{{\tilde{\mathfrak {B}}}}\}\) for \(i\in I,j\in J,k\in K\) corresponds to \({\tilde{\mathfrak {B}}}\) and \(\tilde{\varPi }\).

Claim 1

For any partial structure \({\tilde{\mathfrak {B}}} \), the set of \({\tilde{\mathfrak {B}}}\)-normal structures relative to \(\tilde{\varPi }\) is the corresponding approximation set.

Proof

\(\Rightarrow \)’: Let \(\mathfrak {C}\) be \({\tilde{\mathfrak {B}}}\)-normal for \(\tilde{\varPi }\). Then \(C=B\) and \(\mathfrak {C} \in \mathbf {P} \). Furthermore, \(R_i^+=R_i^{{\tilde{\mathfrak {B}}},+}\subseteq R_i^{\mathfrak {C}}\subseteq B^{\lambda _i}-R_i^{\mathfrak {B},-}=B^{\lambda _i}-R_i^-\) for each \(i\in I\), \({F_j}^{\mathfrak {C}}\vert {W}_{{\tilde{\mathfrak {B}}},j}=F_j^{{\tilde{\mathfrak {B}}}}\) so that \(F_j^{\mathfrak {C}}\subseteq F_j^{{\tilde{\mathfrak {B}}}}\cup (B^{\rho _j}-W_{{\tilde{\mathfrak {B}}},j})\times B=F_j^{+\circ }\) for each \(j\in J\), and \(c_k^{\mathfrak {C}}=c_k^{{\tilde{\mathfrak {B}}}}\in \{c_k^{{\tilde{\mathfrak {B}}}}\}=c_k^{+\circ }\) for each \(k\in K\). Thus \(\mathfrak {C}\) is in the approximation set corresponding to \({\tilde{\mathfrak {B}}}\) and \(\tilde{\varPi }\).

\(\Leftarrow \)’: Let \(\mathfrak {C}\) be in the approximation set for \(\{R_i^+, R_i^-, F_j^{+\circ }, c_k^{+\circ }\}_{i\in I,j\in J,k\in K}\) over B with penumbral set \(\mathbf {P}\). Then \(C=B\) and \(\mathfrak {C} \vDash \tilde{\varPi } \). Furthermore, \(R_i^{{\tilde{\mathfrak {B}}},+}=R_i^+\subseteq R_i^{\mathfrak {C}}\subseteq B^{\lambda _i}-R_i^+=B^{\lambda _i}-R_i^{\mathfrak {B},-}\) for each \(i\in I\), \(F_j^{\mathfrak {B}}\subseteq F_j^{+\circ }=F_j^{{\tilde{\mathfrak {B}}}}\cup (B^{\rho _j}-W_{{\tilde{\mathfrak {B}}},j})\times B\) so that \({F_j}^{\mathfrak {C}}\vert {W}_{{\tilde{\mathfrak {B}}},j}=F_j^{{\tilde{\mathfrak {B}}}}\), and \(c_k^{\mathfrak {C}}\in c_k^{+\circ }=\{c_k^{{\tilde{\mathfrak {B}}}}\}\) so that \(c_k^{\mathfrak {C}}=c_k^{{\tilde{\mathfrak {B}}}}\). Therefore \(\mathfrak {C}\) is \({\tilde{\mathfrak {B}}}\)-normal for \(\tilde{\varPi }\). \(\square \)

If the approximation set corresponding to \({\tilde{\mathfrak {B}}}\) and \(\tilde{\varPi }\) is a singleton set \(\{\mathfrak {C} \}\), then I will say that \(\mathfrak {C}\) corresponds to \({\tilde{\mathfrak {B}}}\) and \({\tilde{\mathfrak {B}}}\) corresponds to \(\mathfrak {C}\).

Since not every approximation set corresponds to a partial structure, the notion of an approximation set is a proper generalization of the notion of a partial structure. In fact, the notion of an approximation set generalizes the notion of a partial structure in a way that solves the latter’s problems with constants and functions: In a partial structure’s corresponding approximation set the non-negative extension of a constant \(c_k\) is \(c_k^{+\circ }=\{c_k^{{\tilde{\mathfrak {B}}}}\}\), that is, \(c_k\) has a (unique) positive extension, and every structure in the approximation set assigns the same object to \(c_k\). By contrast, an approximation set in general allows any kind of non-negative extension, and thus can contain structures that assign different objects to \(c_k\). The situation is analogous for function symbols \(F_j\): In a partial structure’s corresponding approximation set, the non-negative extension \(F_j^{+\circ }=F_j^{{\tilde{\mathfrak {B}}}}\cup (B^{\rho _j}-W_{{\tilde{\mathfrak {B}}},j})\times B\) takes a unique value for any argument from \(W_{{\tilde{\mathfrak {B}}},j}\) and takes the whole domain B as value for any argument from \(B^{\rho _j}- W_{{\tilde{\mathfrak {B}}},j}\). An approximation set, on the other hand, allows for a non-negative extension that is, for some or all of the arguments of \(F_j\), neither unique nor completely unrestricted. In other words, for each argument of \(F_j\), there is some set of values that \(F_j\) is assigned by the structures in the approximation set, and this set of values may be any subset of the domain. Thus approximation sets can capture both imprecise values for constants and imprecise values for functions.Footnote 9

Using approximation sets, one can define the approximate truth of a class \(\mathbf {E}\) and a family \(\{\mathfrak {T} _n\}_{n\in N}\) of structures:

Definition 10

Let \(\mathbf {M}\) be an approximation set. A class of structures \(\mathbf {E}\) is approximately true in \(\mathbf {M}\) if and only if for some \(\mathfrak {E} \in \mathbf {E} \) and some \(\mathfrak {M} \in \mathbf {M} \), \(\mathfrak {E} =\mathfrak {M} \).Footnote 10 A family \(\{\mathfrak {T} _n\}_{n\in N}\) is approximately true in \(\mathbf {M}\) if and only if \(\{\mathfrak {T} _n\mathop {:}n\in N\}\) is approximately true in \(\mathbf {M}\).

The relation between partial truth and approximate truth is given by

Claim 2

\(\{\mathfrak {T} _n\}_{n\in N}\) is partially true in partial structure \({\tilde{\mathfrak {B}}}\) for \(\tilde{\varPi }\) if and only if \(\{\mathfrak {T} _n\}_{n\in N}\) is approximately true in the corresponding approximation set.

Proof

Immediately from Claim 1. \(\square \)

Therefore approximate truth is a generalization of partial truth. Note that if \(\{\mathfrak {T} _n\mathop {:}n\in N\}\) is the class of models of a set of sentences \(\varSigma \) and the partial structure \({\tilde{\mathfrak {B}}}\) corresponds to a structure \(\mathfrak {B}\), the partial truth of \(\{\mathfrak {T} _n\}_{n\in N}\) in \({\tilde{\mathfrak {B}}}\) is equivalent to the truth of \(\varSigma \) in \(\mathfrak {B}\).

Approximation sets generalize partial structures, approximate truth generalizes partial truth, and partial isomorphisms (Definition 12) and partial homomorphisms (Definition 20) can be expressed in terms of isomorphisms and homomorphisms between the elements of approximation sets (“Appendix A”). Hence the partial structures approach can be completely captured and generalized in terms of approximation sets, which has a convenient corollary: Every possible application of partial structures is also a possible application of approximation sets. Specifically, any application of partial structures can be translated into an application of their corresponding approximation sets. For the reasons given above, the converse is not true.Footnote 11

4 Generalizing empirical adequacy

Bueno (1997, p. 595) suggests using the partial structures approach not for capturing, but rather for “extending van Fraassen’s proposals within a partial structure conception”. While his two generalizations are meant to allow for the formalization of common scientific practices within constructive empiricism and have been the basis of further development and applications of the partial structures approach, they have initially been suggested as a response to a criticism of empirical adequacy by Suárez (1995, 2005). I argue in “Appendix B” that this initial motivation is not relevant because Suárez’s criticism fails.

Both of Bueno’s generalizations rely on the idea that the appearances are seldom known well enough to be described in a set \(\mathbf {A}\) of structures, and that usually a set of partial structures must suffice, leading to the partial appearances \({\tilde{\mathbf {A}}}\). This is more than just a formal modification of the notion of empirical adequacy: Van Fraassen is arguably justified in assuming that the appearances are represented by structures, because a theory has to be empirically adequate with respect to all the appearances, known in all precision (cf. Monton and Mohler 2008, §1.5). While van Fraassen’s notion of empirical adequacy thus relies exclusively on what the appearances are like, Bueno’s notion includes our lack of knowledge about them. Bueno thus gives a generalization of empirical adequacy that takes epistemic states into account, and should therefore be equivalent to van Fraassen’s notion in the special case that there is no epistemic uncertainty about the phenomena. I will argue in the sequel that both of Bueno’s generalizations of empirical adequacy are inadequate, and that his intent is better captured by the generalizations of empirical adequacy suggested in the first part of this discussion.

4.1 Partial empirical adequacy

Bueno’s first suggested generalization can be motivated by the simple observation that if the appearances are given by partial structures, there can be no isomorphisms between the appearances and the empirical substructures of any theory, because substructures and isomorphisms are defined only for structures. Bueno (1997, p. 596) therefore defines the partial substructures of a relational partial structure, which can easily be generalized to partial structures as follows:

Definition 11

\({\tilde{\mathfrak {B}}}\) is a partial substructure of partial structure \({\tilde{\mathfrak {C}}}\), \({\tilde{\mathfrak {B}}} \subseteq {\tilde{\mathfrak {C}}} \), if and only if \(B\subseteq C\), \(R_i^{{\tilde{\mathfrak {B}}},+}=R_i^{{\tilde{\mathfrak {C}}},+}\cap B^{\lambda _i}\), \(R_i^{{\tilde{\mathfrak {B}}},-}=R_i^{{\tilde{\mathfrak {C}}},-}\cap B^{\lambda _i}\), \(R_i^{{\tilde{\mathfrak {B}}},\circ }=R_i^{{\tilde{\mathfrak {C}}},\circ }\cap B^{\lambda _i}\) for all \(i\in I\), \(F_j^{{\tilde{\mathfrak {B}}}}=F_j^{{\tilde{\mathfrak {C}}}}\vert {B}^{\rho _j}\) for all \(j\in J\), and \(c_k^{{\tilde{\mathfrak {B}}}}=c_k^{{\tilde{\mathfrak {C}}}}\) for all \(k\in K\).

It is easy to see that if \(\mathfrak {B}\) corresponds to \({\tilde{\mathfrak {B}}}\) and \(\mathfrak {C}\) corresponds to \({\tilde{\mathfrak {C}}}\), then \({\tilde{\mathfrak {B}}} \subseteq {\tilde{\mathfrak {C}}} \) if and only if \(\mathfrak {B} \subseteq \mathfrak {C} \).

Further, Bueno defines a partial isomorphism between two relational partial structures, which can also easily be generalized to partial structures:

Definition 12

\(f: B\longrightarrow C\) is a partial isomorphism between partial structures \(\mathfrak {B} \) and \(\mathfrak {C} \) if and only if f is a bijection and it holds that \(f\bigl (R_i^{{\tilde{\mathfrak {B}}},+}\bigr )=R_i^{{\tilde{\mathfrak {C}}},+}\) and \(f\bigl (R_i^{{\tilde{\mathfrak {B}}},-}\bigr )=R_i^{{\tilde{\mathfrak {C}}},-}\) for each \(i\in I\), \(f(W_{{\tilde{\mathfrak {B}}},j})=W_{{\tilde{\mathfrak {C}}},j}\) and \(f\bigl (F_j^{{\tilde{\mathfrak {B}}}}x_1\dots x_{\rho _j}\bigr )=F_j^{{\tilde{\mathfrak {C}}}}f(x_1)\dots f(x_{\rho _j})\) for each \(x_1,\dots ,x_{\rho _j}\in W_{{\tilde{\mathfrak {B}}},j}\), \(j\in J\), and \(f\bigl (c_k^{{\tilde{\mathfrak {B}}}}\bigr )=c_k^{{\tilde{\mathfrak {C}}}}\) for each \(k\in K\).Footnote 12

\({\tilde{\mathfrak {B}}}\) and \({\tilde{\mathfrak {C}}}\) are called partially isomorphic (\({\tilde{\mathfrak {B}}} \cong {\tilde{\mathfrak {C}}} \)) if and only if there is a partial isomorphism between \({\tilde{\mathfrak {B}}}\) and \({\tilde{\mathfrak {C}}}\).Footnote 13 It is easy to see that if \(\mathfrak {B}\) corresponds to \({\tilde{\mathfrak {B}}}\) and \(\mathfrak {C}\) corresponds to \({\tilde{\mathfrak {C}}}\), then \({\tilde{\mathfrak {B}}} \cong {\tilde{\mathfrak {C}}} \) if and only if \(\mathfrak {B} \cong \mathfrak {C} \). Since the notion of partial isomorphism has been the basis of much further development in the partial structure approach (e. g., Bueno 1999, pp. 65–66; French 2000, p. 106; Bueno 2000, §3.2, §4.1; Bueno et al. 2002, p. 499; da Costa and French 2003, pp. 48–52; French 2003, p. 1480; Bueno and Colyvan 2011, p. 14) I show in “Appendix A” that the concept has an analogue for approximation sets.

Bueno (1997, p. 596) further assumes that theories are given as families \(\{{\tilde{\mathfrak {T}}} _n\}_{n\in N}\) of partial structures, with a set \({\tilde{\mathbf {E}}} _n\) of partial empirical substructures for each \(n\in N\).Footnote 14 But this assumptions is problematic: In constructive empiricism, theories and their empirical substructures are assumed to be given by normal structures, not partial structures, and Tarski semantics only provides a way of translating the equations of a theory (like Maxwell’s equations and the Londons’ equations) into normal structures.Footnote 15 And it is not obvious how a theory \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) given by normal structures can be described as a set of partial structures. Of course, every normal structure corresponds to a partial structure, but in this identification partial truth, partial substructures, and partial isomorphisms amount to truth, substructures, and isomorphisms, respectively, so nothing is gained.

However, there may be a solution to this problem: Given \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \), one can try finding a set \(M\subseteq \wp N\) of subsets of N such that for each \(m\in M\), \(\{\mathfrak {T} _n\mathop {:}n\in m\}\) is an approximation set corresponding to a partial structure \({\tilde{\mathfrak {T}}} _m\) and \(\bigcup _{n\in m}\mathbf {E} _n\) is a union of approximation sets that correspond to elements of a set \({\tilde{\mathbf {E}}} _m\) of partial structures. This provides a partial theory \(\bigl \langle \bigl \{{\tilde{\mathfrak {T}}} _m\bigr \}_{m\in M},\bigl \{{\tilde{\mathbf {E}}} _m\bigr \}_{m\in M}\bigr \rangle \). Any theory with approximation claims about relations and functions (of the kind that can be captured by partial structures) leads in this way to non-trivial partial structures. As a toy theory, consider \(\forall x(Px\rightarrow Qx)\wedge \forall x (Qx\rightarrow Rx)\). For fixed \(P^{\mathfrak {B}}\) and \(R^{\mathfrak {B}}\) with \(P^{\mathfrak {B}}\subset R^{\mathfrak {B}}\), it leads to the non-trivial partial structure \({\tilde{\mathfrak {B}}} =\langle B, P^{{\tilde{\mathfrak {B}}}},Q^{{\tilde{\mathfrak {B}}}},R^{{\tilde{\mathfrak {B}}}}\rangle \) with \(Q^{{\tilde{\mathfrak {B}}},\circ }= B-(P^\mathfrak {B} \cup Q^\mathfrak {B})\ne \varnothing \).Footnote 16

Using the notions of partial substructure and partial isomorphism and the assumption of partial theories, Bueno (1997, p. 596) introduces

Definition 13

A partial theory \(\bigl \langle \bigl \{{\tilde{\mathfrak {T}}} _m\bigr \}_{m\in M},\bigl \{{\tilde{\mathbf {E}}} _m\bigr \}_{m\in M}\bigr \rangle \) is partially empirically adequate for the partial appearances \({\tilde{\mathbf {A}}}\) if and only if there is some \(m\in M\) such that for every \({\tilde{\mathfrak {A}}} \in {\tilde{\mathbf {A}}} \), there is an \({\tilde{\mathfrak {E}}} \in {\tilde{\mathbf {E}}} _m\) with \({\tilde{\mathfrak {E}}} \cong {\tilde{\mathfrak {A}}} \).

As noted, capturing the appearances as a set of partial structures rather than a set of structures introduces an epistemic element into empirical adequacy. If there is no lack of knowledge about the appearances, then \(R_i^{{\tilde{\mathfrak {B}}},\circ }=\varnothing \) and \(W_{{\tilde{\mathfrak {B}}},j}=A^{\rho _j}\) for all \(i\in I, j\in J\), and partial appearances \({\tilde{\mathfrak {A}}}\), so that there are structures corresponding to the partial structures. Since furthermore partial substructures and partial isomorphisms generalize substructures and isomorphisms, Definition 13 generalizes Definition 3 of empirical adequacy to partial theories and partial appearances. Therefore, for full information, partial empirical adequacy is equivalent to empirical adequacy, as required.

Since Suárez’s criticism fails, it is not important that partial empirical adequacy cannot cope with Suárez’s criticism (“Appendix C.1”). A real problem is that almost no theory is ever partially empirically adequate, and if so, only for a very short time (with some notable exceptions). This is because the partial appearances are meant to represent our lack of knowledge of the appearances. And to be partially empirically adequate, the partial theory must have a partial empirical substructure that is partially isomorphic to the partial appearances, and therefore describe our state of knowledge about the appearances. Formally, for each relation \(R_i^{{\tilde{\mathfrak {A}}}}\) of a partial appearance, there has to be a relation \(R_i^{{\tilde{\mathfrak {E}}}}\) of a partial empirical substructure of the partial theory such that a partial isomorphism maps all and only elements in \(R_i^{{\tilde{\mathfrak {A}}},\circ }\) to elements in \(R_i^{{\tilde{\mathfrak {E}}},\circ }\). Therefore, if a theory asserts more about any appearance than what is currently known (so that \(R_i^{{\tilde{\mathfrak {A}}},\circ }\) is mapped to a proper subset of \(R_i^{{\tilde{\mathfrak {E}}},\circ }\)), it is not partially empirically adequate. If a theory asserts in some respects more about any appearance than what is currently known about any appearance and in some respects asserts less (so that \(R_i^{{\tilde{\mathfrak {A}}},\circ }\) is mapped neither to a subset nor a superset of \(R_i^{{\tilde{\mathfrak {E}}},\circ }\)), it is not partially empirically adequate either. This point becomes even clearer when considering Bueno’s claim that partial isomorphisms to partial substructures amount to “approximate embeddings” (Bueno 1997, p. 597): If the partial appearances are meant to describe the approximation with which we know the appearances, then a partial theory is partially empirically adequate only if for some \(n\in N\), the partial empirical substructures in \({\tilde{\mathbf {E}}} _n\) contain the exact approximations up to which we know the appearances. Therefore, if a partial theory describes the appearances up to some approximation, the theory is not partially empirically adequate until we have determined the appearances with exactly that approximation. Of course, if later the we know a little bit more, the theory ceases to be partially empirically adequate.Footnote 17

The concept of approximate empirical adequacy defined in the first part of this discussion (Lutz 2014b, def. 10, 13) avoids these problems by using, instead of a set \({\tilde{\mathbf {A}}}\) of partial structures, a set \(\mathbf {A}\) of approximation sets for the appearances (called ‘approximate appearances’). As argued in Sect. 3, this also generalizes the kind of approximations for functions and constants that can be captured in partial appearances.

Definition 14

Given the approximate appearances \(\mathbf {A}\), a theory \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is approximately empirically adequate for \(\mathbf {A}\) if and only if there is some \(n\in N\) such that for every \(\mathbf {Q} \in \mathbf {A} \), there are an \(\mathfrak {A} \in \mathbf {Q} \) and an \(\mathfrak {E} \in \mathbf {E} _n\) with \(\mathfrak {E} \cong \mathfrak {A} \).

This expresses van Fraassen’s assumption that a theory is empirically adequate if and only if “what the theory says about what is observable (by us) is true” (van Fraassen 1980, p. 18, emphasis removed) if truth is taken to be truth up to isomorphism:

Definition 15

Let \(\mathbf {M}\) be an approximation set. A class of structures \(\mathbf {E}\) is approximately true up to isomorphism in \(\mathbf {M}\) if and only if for some \(\mathfrak {E} \in \mathbf {E} \) and some \(\mathfrak {M} \in \mathbf {M} \), \(\mathfrak {E} \cong \mathfrak {M} \).

The difference to Definition 10 stems from the difference between the notion of partial truth (Definition 7), which relies on the identity of structures, and van Fraassen’s notion of empirical adequacy (that is, the truth of the empirical part of a theory), which relies on isomorphism.Footnote 18 This difference turns out to be crucial considering Bueno’s dismissal of the following suggestion for generalizing the empirical adequacy of a theory \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \): One could demand that there be some \(n\in N\) such that for every \({\tilde{\mathfrak {A}}} \in {\tilde{\mathbf {A}}} \), there is an \({\tilde{\mathfrak {A}}}\)-normal structure \(\mathfrak {A}\) with \(\mathfrak {A} \in \mathbf {E} _n\). However, because of the definition of ‘\({\tilde{\mathfrak {A}}}\)-normal structure’, this would require that the empirical substructures in \(\mathbf {E} _n\) have the same domains as the partial appearances. The problem with this requirement, so Bueno (1997, p. 594), is that in practice “we would hardly, if ever, see such a constraint satisfied”. Since the identity of empirical substructures and appearances is Bueno’s sole stated reason for rejecting this generalization, Definition 14 should be acceptable, because it avoids exactly this identity:

Claim 3

If each approximate appearance in the approximate appearances \(\mathbf {A}\) correspond to a partial appearance in the partial appearances \({\tilde{\mathbf {A}}}\) and vice versa, a theory \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is approximately empirically adequate for \(\mathbf {A}\) if and only if there is some \(n\in N\) such that for every \({\tilde{\mathfrak {A}}} \in {\tilde{\mathbf {A}}} \), there are an \({\tilde{\mathfrak {A}}}\)-normal structure \(\mathfrak {A}\) and an \(\mathfrak {E} \in \mathbf {E} _n\) with \(\mathfrak {E} \cong \mathfrak {A} \).

Proof

Immediately from Claim 1. \(\square \)

The demand that Bueno dismisses is recovered by substituting ‘\(=\)’ for ‘\(\cong \)’ in Definition 14 and Claim 3.Footnote 19 Note that, besides allowing for approximations more general than those that can be described by partial structures, Definition 14 additionally avoids the need for partial theories.

4.2 Pragmatic empirical adequacy

Bueno’s second generalization (Bueno 1997, §5) starts from the ideas that the structures of data are often changed in multiple steps into structures of theories (Suppes 1962), and that theories are not compared directly to data, but more refined structures (Bogen and Woodward 1988). To capture both points, Bueno (1997, pp. 600–601) gives an informal description of a hierarchy of partial structures (cf. French and Ladyman 1999, p. 113). Since he makes a distinction between partial structures with finite and with infinite domains, this can be captured in the following two more explicit definitions.

Definition 16

A hierarchy of finite partial structures is a finite sequence \(\langle {\tilde{\mathfrak {B}}} _l\rangle _{1\le l\le m}\) of relational partial structures with finite domains for the \(\lambda _i\)-place relation symbols \(\{R_i\}_{i\in I}\),Footnote 20 such that (i) \({\tilde{\mathfrak {B}}} _m\) corresponds to a structure, and (ii) for all \(1\le l<m\) and \(i\in I\), \({\mathrm {card}}\bigl (R_{i}^{{\tilde{\mathfrak {B}}} _l,\circ }\bigr )>{\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\bigr )\) and \({\mathrm {card}}(B_l)\le {\mathrm {card}}(B_{l+1})\).Footnote 21

Definition 17

A hierarchy of infinite partial structures is a finite sequence \(\langle {\tilde{\mathfrak {B}}} _l\rangle _{1\le l\le m}\) of relational partial structures with infinite domains for the \(\lambda _i\)-place relation symbols \(\{R_i\}_{i\in I}\), such that (i) \({\tilde{\mathfrak {B}}} _m\) corresponds to a structure and (ii) for all \(1\le l<m\) and \(i\in I\), \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\supset R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\).

A hierarchy of partial structures is either a hierarchy of finite or a hierarchy of infinite partial structures.

Bueno (1997, p. 601) further defines a reduced partial structure \({\tilde{\mathfrak {B}}}\) of a partial structure \({\tilde{\mathfrak {C}}}\) to be a partial substructure of \({\tilde{\mathfrak {C}}}\) such that every element of \({\tilde{\mathfrak {B}}}\) ’s domain has been measured at some point with a specific measurement result. Finally, Bueno (1997, pp. 601, 607) seems to define the partial models of the phenomena to be a hierarchy of partial structures (a) whose lowest partial structure represents the data, (b) whose highest partial structure represents the appearances, and (c) where there is a cardinal number w such that the partial structure at each level has a reduced partial structure with a domain of cardinality w.Footnote 22 By Definition 11, there is for every relational partial structure \({\tilde{\mathfrak {B}}}\) and set \(C\subseteq B\) a partial substructure \({\tilde{\mathfrak {C}}} \subseteq {\tilde{\mathfrak {B}}} \) with \({\mathrm {dom}}{\left( {\tilde{\mathfrak {C}}} \right) } =C\). Thus condition (c) simply demands that for each \(l, 1\le l\le m\), at least one element of domain \(A_l\) has been measured.

Bueno (1997, p. 601, my notation) claims that partial models of the phenomena formalize the idea that

at each level, partial relations R, which were not yet defined at a lower level (whose elements thus belong to \(R^\circ \)) come to be defined: either taking their elements as belonging to the domain of R (i. e. \(R^+\)) or belonging to the complement of R (that is, \(R^-\)). The partial relations are extended until one obtains normal (total) structures. These are then to be compared to scientific theories in testing them.

This description is rather misleading because it incorrectly suggests that each new level in the hierarchy introduces new relations. What is probably meant is that at each level \({\tilde{\mathfrak {B}}} _l\) and for each relation symbol \(R_i\), tuples of members of the domain that were borderline cases at the lower level \({\tilde{\mathfrak {B}}} _{l-1}\) (and thus belong to \(R_i^{{\tilde{\mathfrak {B}}} _{l-1},\circ }\)) come to be included either in the positive extension of \(R_i\) (i. e., \(R_i^{{\tilde{\mathfrak {B}}} _l,+}\)) or in the negative extension of \(R_i\) (i. e., \(R_i^{{\tilde{\mathfrak {B}}} _l,-}\)).Footnote 23

The definition of a hierarchy of partial structures has a number of quirks that become problems in the definition of the partial models of the phenomena. One is that a partial structure \({\tilde{\mathfrak {B}}} _l\) with \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }=\varnothing \) for some, but not all \(i\in I\) cannot occur in a hierarchy. For condition (ii) demands that \({\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\bigr )>{\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\bigr )\) or \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\supset R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\) for all \(i\in I\). Thus, if \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }=\varnothing \) for some \(i\in I\), condition (ii) cannot be fulfilled by \(R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\), so that \(\mathfrak {B} _l\) must be the highest level of the hierarchy. And because the highest level must correspond to a structure, \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }=\varnothing \) for all \(i\in I\). This problem can easily be solved by slightly modifying condition (ii), demanding only \({\mathrm {card}}\bigl (R_{i}^{{\tilde{\mathfrak {B}}} _l,\circ }\bigr )\ge {\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\bigr )\) in Definition 16 and \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\supseteq R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\) in Definition 17 for all \(i\in I\). To arrive at an asymmetric relation, one could further demand that the respective converse relation does not hold for all \(i\in I\).

A bigger problem is that the demands on the relations are radically different for hierarchies of finite and infinite domains. Infinite structures form a hierarchy if from one level to the next, some borderline cases of each relation symbol become members of its positive or negative extension, but not vice versa. The relations of finite structures, on the other hand, only have to have a decreasing number of borderline cases, no matter which ones they are. This means that the concept of a hierarchy of infinite partial structures does not constitute a limit of the concept of a hierarchy of finite partial structures: If \({\tilde{\mathfrak {B}}} _l=\bigl \langle B,R_1^{{\tilde{\mathfrak {B}}} _l}\bigr \rangle \) with \(R_1^{{\tilde{\mathfrak {B}}} _l,\circ }=\{a,b\}\), and \({\tilde{\mathfrak {B}}} _{l+1}=\bigl \langle B,R_1^{{\tilde{\mathfrak {B}}} _{l+1}}\bigr \rangle \) with \(R_1^{{\tilde{\mathfrak {B}}} _{l+1},\circ }=\{c\}\), then \({\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\bigr )>{\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\bigr )\), but \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\not \supset R_i^{{\tilde{\mathfrak {B}}} _{l+1},\circ }\). Thus these two structures can be elements of hierarchies of finite partial structures with arbitrarily big finite domains B, but cannot be elements of a hierarchy of infinite partial structures. Note also that for infinite domains, the elements in \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\) for any \(i\in I\), \(1\le l\le m\) have to be in every \(R_i^{{\tilde{\mathfrak {B}}} _k,\circ }\), \(k\le l\), so that, since \(R_i^{{\tilde{\mathfrak {B}}} _l,\circ }\ne 0\) for all \(i\in I\), \(1\le l<m\), partial structures at all levels except the last one have to have some elements in common. In contradistinction, the domains of the finite structures can change completely from one level to the next.

This radical difference between hierarchies of finite and infinite structures has a number of odd implications. First and foremost, there is no obvious reason for the change in condition (ii). If the subset-relation is justified for infinite domains, its lack of justification for finite domains first has to be shown. Second, it is not clear how to define a hierarchy of partial structures some of which have finite, and some of which have infinite domains. Third, any concept relying on the concept of a hierarchy of partial structures will also have very different properties for finite and infinite domains. This, though, renders typical scientific methods unusable, for example the use of limiting cases, where a very big but finite domain is used as approximation of an infinite domain. Results for finite domains thus will typically have little bearing on results for infinite domains, and vice versa.Footnote 24

The biggest problem of the concept of a hierarchy of partials structures, however, is starkly illustrated by Bueno’s own informal description (quoted above) of each level in the hierarchy as “extending” the relations of the partial structure from the previous level. In the rest of his article, Bueno (e. g., 1997, pp. 592–593) uses the concept of one relation “extending” another only to state that the relations \(\{R_i^{\mathfrak {B}}\}_{i\in I}\) in a \({\tilde{\mathfrak {B}}} _l\)-normal structure \(\mathfrak {B} \) extend the relations \(\{R_i^{{\tilde{\mathfrak {B}}} _l}\}_{i\in I}\). This entails that to \(\mathfrak {B}\) there corresponds a partial structure \({\tilde{\mathfrak {B}}}\) so that for all \(i\in I\), \(R_i^{{\tilde{\mathfrak {B}}} _l,+}\subseteq R_i^{{\tilde{\mathfrak {B}}},+}\) and \(R_i^{{\tilde{\mathfrak {B}}} _l,-}\subseteq R_i^{{\tilde{\mathfrak {B}}},-}\). The natural generalization of this use of ‘extension’ is that the same subset condition also holds between all relations of any two partial structures where the relations of the one extend the relations of the other.Footnote 25 But understood in this way, Bueno’s informal description is incompatible with his definition of hierarchies of infinite and of finite partial structures. In hierarchies of infinite partial structures, a member of the positive extension \(R_i^{{\tilde{\mathfrak {B}}} _l,+}\) may be in the negative extension \(R_i^{{\tilde{\mathfrak {B}}} _{l+1},-}\) and vice versa. In hierarchies of finite partial structures, any instance, non-instance, or borderline case can become an instance, non-instance, or borderline case on the next level of the hierarchy, as long as the number of borderline cases overall decreases. Hence at each level, any information one has about the domain can be negated on the next level. It is thus a stretch to say that the hierarchy is “built in such a way that, at each level, there is a gain of information regarding the phenomena being modeled” (Bueno 1997, p. 603), because then one would convey information by saying: “They are certainly scoundrels, though they may not be”.Footnote 26

This problem is severe enough that the relation of the highest level of a pragmatic empirical hierarchy to the rest of the hierarchy is almost trivial:

Claim 4

If \(\langle {\tilde{\mathfrak {B}}} _l\rangle _{1\le l\le m}\) is a hierarchy of infinite partial structures for \(\{R_i\}_{i\in I}\), then \(\langle {\tilde{\mathfrak {B}}} _l,{\tilde{\mathfrak {C}}} \rangle _{1\le l<m}\) is also a hierarchy of infinite partial structures for any infinite partial structure \({\tilde{\mathfrak {C}}} \) for \(\{R_i\}_{i\in I}\) that corresponds to a structure. If \(\langle {\tilde{\mathfrak {B}}} _l\rangle _{1\le l\le m}\) is a hierarchy of finite partial structures for \(\{R_i\}_{i\in I}\), then \(\langle {\tilde{\mathfrak {B}}} _l,{\tilde{\mathfrak {C}}} \rangle _{1\le l<m}\) is also a hierarchy of finite partial structures for any finite partial structure \({\tilde{\mathfrak {C}}} \) for \(\{R_i\}_{i\in I}\) with \({\mathrm {card}}(B_{m-1})\le {\mathrm {card}}\left( {\mathrm {dom}}{\left( {\tilde{\mathfrak {C}}} \right) } \right) \) that corresponds to a structure. (This holds whether the definitions use ‘\(\supset \)’, ‘\(\supseteq \)’, ‘>’, or ‘\(\ge \)’ in condition (ii).)

Proof

If condition (ii) is formulated with ‘\(\supset \)’, then \(R_i^{{\tilde{\mathfrak {B}}} _{m-1},\circ }\ne \varnothing \) for all \(i\in I\). Since \(R_i^{{\tilde{\mathfrak {C}}},\circ }=\varnothing \) for all \(i\in I\) and the empty set is a proper subset of every non-empty set, condition (ii) is fulfilled. If condition (ii) is formulated with ‘>’, then \({\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {B}}} _{m-1},\circ }\bigr )>0={\mathrm {card}}\bigl (R_i^{{\tilde{\mathfrak {C}}},\circ }\bigr )\) for all \(i\in I\). If condition (ii) is formulated with ‘\(\supseteq \)’ or ‘\(\ge \)’, the proof is immediate. \(\square \)

Therefore any level of a hierarchy of partial structures below the highest one only restricts the relation symbols of the partial structure at the highest level (and in the finite case also the minimal size of the domain).Footnote 27 This almost trivial restriction of the highest level of the hierarchy of partial structures by the lower levels is not meaningfully strengthened in Bueno’s definition of the partial models of the phenomena, for the only additional restriction on the structure at the highest level of the hierarchy is that at least one object in its domain must have been measured. Which element is measured, however, is independent from the lower levels.

Bueno (1997, p. 602, my notation) goes on to define that a theory

is empirically adequate if it is pragmatically true in the (partial) empirical substructure \({\tilde{\mathfrak {E}}}\) according to a structure \(\mathfrak {B}\), where \(\mathfrak {B}\) is the last level of the hierarchy of models of phenomena (being thus a total structure).

A sentence is “pragmatically true in \({\tilde{\mathfrak {E}}}\) according to \(\mathfrak {B}\) ” if and only if it is true in \(\mathfrak {B}\) and \(\mathfrak {B}\) is \({\tilde{\mathfrak {E}}}\)-normal (Bueno 1997, p. 592, my notation). Technically, \(\mathfrak {B}\) is the total structure that corresponds to the last level \({\tilde{\mathfrak {B}}}\) of the hierarchy of models of phenomena, since each level in such a hierarchy is a partial structure.

Bueno’s definition of what I will call ‘pragmatic empirical adequacy ’ requires some unpacking, since it defines the pragmatic empirical adequacy of a sentence (and thus, via Tarski semantics, of a class or a family of structures), not the pragmatic empirical adequacy of a family of partial structures. But Bueno’s definition presumes that theories have partial empirical substructures, hence it presumes that theories are at the same time given as families of partial structures. Luckily, this puzzle is easily solved by relying on the suggestion for arriving at partial structures of theories that was developed in Sect. 4.1. The suggestion provides, for a theory given by a sentence \(\vartheta \) and thus by a family of structures \(\{\mathfrak {T} _n\}_{n\in N}\), a corresponding family of partial structures \(\{{\tilde{\mathfrak {T}}} _m\}_{m\in M}\). Hence one can state Bueno’s definition as follows: A theory \(\vartheta \) with the corresponding partial theory \(\bigl \langle \bigl \{{\tilde{\mathfrak {T}}} _m\bigr \}_{m\in M},\bigl \{{\tilde{\mathbf {E}}} _m\bigr \}_{m\in M}\bigr \rangle \) is pragmatically empirically adequate iff there is an \(m\in M\) and an \({\tilde{\mathfrak {E}}} \in {\tilde{\mathbf {E}}} _m\) such that \(\vartheta \) is pragmatically true in \({\tilde{\mathfrak {E}}} \) according to \(\mathfrak {B}\), where \(\mathfrak {B}\) is the last level of the hierarchy of models of phenomena. Given the definition of ‘pragmatically true in \({\tilde{\mathfrak {E}}} \) according to \(\mathfrak {B}\) ’, this is means that \(\vartheta \) is pragmatically empirically adequate iff \(\vartheta \) is true in \(\mathfrak {B}\), where \(\mathfrak {B}\) is the last level of the hierarchy of models of phenomena and is \({\tilde{\mathfrak {E}}} \)-normal for some \(m\in M\) and \({\tilde{\mathfrak {E}}} \in {\tilde{\mathbf {E}}} _m\). If the theory is expressed as a family \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) of structures, Bueno’s definition entails that \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is pragmatically empirically adequate iff there is an \(n\in N\), an \(m\in M\), and an \({\tilde{\mathfrak {E}}} \in {\tilde{\mathbf {E}}} _m\) such that \(\mathfrak {T} _n\) is \({\tilde{\mathfrak {E}}} \)-normal and the last level of the hierarchy of models of phenomena.

This definition has a number of peculiar features that cast its adequacy into doubt. For one, it defines pragmatic empirical adequacy relative to a single hierarchy of partial structures, with a single structure on its highest level that represents the appearances. Hence the definition presumes, contrary to van Fraassen, that there is only one appearance. Second, since \(\mathfrak {T} _n\) is \({\tilde{\mathfrak {E}}}\)-normal, \({\mathrm {dom}}{\left( \mathfrak {T} _n\right) } =E\), so that all the objects that occur in the theory also have to occur in its partial empirical substructure, which thereby is not a proper substructure. Third, every element of the approximation set corresponding to \({\tilde{\mathfrak {E}}} _n\) is \({\tilde{\mathfrak {E}}} _n\)-normal, so that Bueno’s definition entails the following: \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is pragmatically empirically adequate iff there is an \(n\in N\) such that \(\mathfrak {T} _n\) is the last level of the hierarchy of models of phenomena. In other words, a theory is pragmatically empirically adequate if and only if it is true in the highest level of the partial models of the phenomena, that is, in the single appearance.Footnote 28 Thus empirical adequacy is the same as truth in the structure of the appearance, which trivializes van Fraassen’s idea of substituting empirical adequacy for truth as the goal of science. Fourth, there is only the almost trivial relation between the appearances at the highest level and the data at the lowest level of the models of the phenomena. Claim 4 shows that the last level is almost independent from the lower levels, so that, if the data are meant to determine the appearances, the notion of pragmatic empirical adequacy is almost trivial. If, on the other hand, the appearances are determined on their own, then pragmatic empirical adequacy simply presumes that the appearance is given by a structure, not a partial structure, and thus does not differ in this respect from empirical adequacy. A corollary of these four points is that pragmatic empirical adequacy clearly does not properly generalize empirical adequacy. The effects of these modifications of empirical adequacy on Suárez’s criticism are discussed in “Appendix C.2”.

The fifth peculiarity of the definition is that it contradicts the presupposition of Bueno’s claim that “there is no problem with the fact that \({\tilde{\mathfrak {E}}}\) and \(\mathfrak {B}\) have distinct domains” (Bueno 1997, p. 603, my notation). There is indeed no problem, but only because \({\tilde{\mathfrak {E}}}\) and \(\mathfrak {B} =\mathfrak {T} _n\) have the same domain, since \(\mathfrak {B}\) is \({\tilde{\mathfrak {E}}}\)-normal. Oddly, Bueno (1997, p. 603, n. 16) seems to acknowledge this in a footnote, in which he states that “one of the conditions for a total structure to be employed as one that extends the relations of a partial structure, is that both of them have the same domain. Such a condition obviously could not hold here.”Footnote 29 This identity of the domain of the partial appearance and the partial empirical substructure should be fatal for the definition according to Bueno’s own standards, since he has dismissed another suggestion for generalizing empirical adequacy (discussed in connection with Claim 3) on exactly these grounds.

Finally, the definition is in tension with Bueno’s informal description. Bueno (1997, p. 603) states:

The basic point of [the definition] consists in the fact that, intuitively, a theory is empirically adequate if that part of it which is concerned with the observable phenomena (its empirical substructures) can be extended to a total structure that represents the information provided by the observational side of ‘experience’ (the last level in the hierarchy of partial models of phenomena).

If \(\{{\tilde{\mathfrak {T}}} _m\}_{m\in M}\) is given via approximation sets, and thus the partial empirical substructures \({\tilde{\mathfrak {E}}}\) are given via approximation sets as well, the \({\tilde{\mathfrak {E}}}\)-normal structures are just empirical substructures of \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \). Further, the highest level of the models of the phenomena corresponds to a structure \(\mathfrak {A}\). If a structure is represented by another through an isomorphism between the two, Bueno’s informal description then states that a theory is pragmatically empirically adequate if and only if one of its empirical substructures is isomorphic to the appearance \(\mathfrak {A}\). In Bueno’s informal description, pragmatic empirical adequacy thus differs from empirical adequacy only in that there can be only one appearance, and there must also be an almost unrelated data structure. But this is not the case for Bueno’s more formal definition.

The first part of this discussion (Lutz 2014b, def. 14, 15, 17) contains a generalization of empirical adequacy that avoids all of the above criticisms. It provides a substitute for Bueno’s notion of the models of the phenomena:

Definition 18

A restricted hierarchy of approximate appearances \(\langle \{\mathbf {A} _l\}_{l\in L},C\rangle \) contains an indexed set \(\{\mathbf {A} _l\}_{l\in L}\) of approximate appearances with an ordered index set L and a set C containing for any \(\mathbf {A} _l,\mathbf {A} _m,l,m\in L,l\le m\) exactly one bijection \(b: \mathbf {A} _l\longrightarrow \mathbf {A} _m\) such that for all \(\mathbf {Q} \in \mathbf {A} _l\), \(b(\mathbf {Q})\subseteq \mathbf {Q} \).

Additionally, for any three bijections \(b,c,d\in C\) with \(b:\mathbf {A} _l\longrightarrow \mathbf {A} _m\), \(c:\mathbf {A} _m\longrightarrow \mathbf {A} _n\), and \(d:\mathbf {A} _l\longrightarrow \mathbf {A} _n\), \(d=c\circ b\).

As explained in the first part of this discussion, this definition leads to a real increase of information from one point of the hierarchy to the next, allows more than one appearance, and is not restricted to hierarchies of finitely many levels;Footnote 30 with the help of the set C, it also determines for any appearance at any level in the hierarchy a unique line of ancestors and descendants and thus, specifically, which appearances from different levels describe the same phenomenon.

One can define which appearances are possible given the knowledge one has about them at some point (cf. Lutz 2014b, def. 11):

Definition 19

Given approximate appearances \(\mathbf {A}\), \(\mathbf {A} '\) are approximately possible appearances if and only if \(\mathbf {A} '=\{e(\mathbf {Q})\mathop {:}\mathbf {Q} \in \mathbf {A} \}\), where e is any function from \(\mathbf {A} \) to \(\bigcup \mathbf {A} \) with \(e(\mathbf {Q})\in \mathbf {Q} \).

Thus for every approximation set in the approximate appearances, any of its members can be a member of the appearances.

These definitions lead to the following result (Lutz 2014b, Claim 7):

Claim 5

\(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is approximately empirically adequate at all points of all restricted hierarchies of approximate appearances with the initial sequence \(\langle \mathbf {A} _l\rangle _{l\le m}\) if and only if \(\langle \mathfrak {T} _n,\mathbf {E} _n\rangle \) is empirically adequate for all appearances that are approximately possible given \(\mathbf {A} _l\).

By Claim 5, the growth of information can be represented by the restricted hierarchy of approximate appearances, and at each point of the hierarchy, it is clear which theories are approximately empirically adequate. Thus, while Bueno’s generalizations based on partial structures are inadequate, his motivations provide reasons for adopting the generalizations suggested in the first part of this discussion.

5 Conclusion

Partial structures and van Fraassen’s notion of empirical adequacy do not go well together: Empirical adequacy has been neither successfully expressed nor successfully generalized in terms of partial structures. Partial structures even face problems in their initial intended domain of application: They are inadequate for expressing approximations of functions and constants.

The notion of an approximation set generalizes the notion of a partial structure to allow for approximations of functions and constants, and allows for the notions of partial isomorphism and partial homomorphism without the use of partial structures. These results show that approximation sets can be used to formalize all theories, models, and appearances that can be formalized in partial structures, and can in fact formalize more. That approximation sets do not rely on any new technical notions allows for a simple transfer of known results from model theory. Furthermore, approximation sets are the basis of the notion of approximate empirical adequacy and of a restricted hierarchy of approximate empirical appearances, which capture the basic intuitions behind Bueno’s notions of partial and pragmatic empirical adequacy without succumbing to their problems.

Together with the results of the first part of this discussion, these results show the adequacy and flexibility of approximation sets, approximate empirical adequacy, and hierarchies of approximate empirical appearances.