# Basic and Refined Nomic Truth Approximation by Evidence-Guided Belief Revision in AGM-Terms

## Authors

- First Online:

- Received:
- Accepted:

DOI: 10.1007/s10670-011-9292-0

- Cite this article as:
- Kuipers, T.A.F. Erkenn (2011) 75: 223. doi:10.1007/s10670-011-9292-0

- 7 Citations
- 262 Views

## Abstract

Straightforward theory revision, taking into account as effectively as possible the established nomic possibilities and, on their basis induced empirical laws, is conducive for (unstratified) nomic truth approximation. The question this paper asks is: is it possible to reconstruct the relevant theory revision steps, on the basis of incoming evidence, in AGM-terms? A positive answer will be given in two rounds, first for the case in which the initial theory is compatible with the established empirical laws, then for the case in which it is incompatible with at least one such a law.

## 1 Introduction

AGM-style belief revision (AGM-BR; for an overview, see Hansson 1999), typically aims at coherence optimization between a given set of beliefs and new information in as conservative a way as possible, implicitly taking that new information as true, whatever distance its adherents take to matters of truth. However, as far as aiming at truth approximation at all, AGM-BR seems to be primarily aiming at the truth about the actual world, *actual truth approximation*, in short. Following Grove (1988), Niiniluoto (1999) and Cevolani and Calandra (2009) have been studying the prospects of belief revision for approximation of the actual truth. New and extended attempts focusing on this aim have been made at conferences in Trieste (2009) and Amsterdam (2009) by Cevolani, Crupi and Festa, Schurz, Niiniluoto, Smets, and Zwart and Renardel.

However, theorizing and hence theory revision in the natural sciences typically aim at *nomic truth approximation*, that is, an approximation of the truth about what is nomically (e.g. physically) possible and what is not (Kuipers 2000). Nomic truth approximation by theory revision is guided by evidence, where evidence consists of case descriptions and induced empirical laws based on them. In addition to a basic (“content”) kind of nomic truth approximation, there is a refined (“likeness”) kind, as a concretization of the basic one (see Zwart (2001) for the distinction between content and likeness approaches^{1}). Moreover, there exist (observationally-theoretically) stratified variants of both, probabilistic variants and, in principle, all kinds of combinations.

An instructive stratified toy example is the following: let there be a complex, but finite, electric network of switches and bulbs, and a battery. Let the network of (serial and parallel) connections be hidden and the task is to find out the precise structure of this network. The observational nomic truth about the network amounts to a characterization of the physically possible state of the network, as far as positions of the switches (on/off) and the bulbs (lighting or not) are concerned. This nomic truth can be expressed by a propositional formula, of which the disjunctive normal form has as disjuncts the constituents that represent these states. It may be possible to reconstruct from this formula the theoretical nomic truth, that is, the full network, including the hidden connections. However, it may also be that there are empirically equivalent networks, that is, networks generating the same observational nomic truth.

*The question asked in this paper is: can something like AGM*-*BR be helpful for evidence*-*guided theory revision aiming at (some kind of) nomic truth approximation? In other words, is it possible to reconstruct plausible theory revision steps, on the basis of characteristic evidence, aiming at nomic truth approximation in AGM*-*terms?*

In Sect. 2 it will first be argued that straightforward basic theory revision, taking into account as effectively as possible the established nomic possibilities and the, on their basis, induced empirical laws, guarantees (unstratified) basic nomic truth approximation. Then it will be shown that this revision can be reconstructed into two AGM-steps, in arbitrary order. One of these is straightforward expansion; the other is an extreme form of contraction, viz. so-called full meet contraction. This revision needs, however, refinement for the difficult but likely case that at least one of the induced laws is incompatible with the original theory.

In Sect. 3 it will first be shown that the spheres approach of theory revision developed by Adam Grove (1988) can be used to refine the above indicated two-step theory revision such that it can be used for the hard case, and reduces to the basic case when theory and all induced laws are compatible. Assuming the proper order, that is, first a refined kind of revision in the face of the induced laws, viz. a kind of partial meet revision, and then full meet contraction in the face of the remaining counterexamples, the resulting refinement is potentially conducive for basic truth approximation. In terms of the likeness foundation of the spheres approach by Wlodek Rabinowicz (1995), based on a four-place similarity relation, it will be shown that even this refinement is potentially conducive for refined truth approximation.

In the concluding Sect. 4 the main (positive) conclusions will be followed by a number of debunking remarks about the presented AGM-style theory revision from a realist point of view.

## 2 The Basic Account

### 2.1 Basic Definitions and Basic Theory Revision

According to the structuralist theory of truth approximation (Kuipers 2000), nomic truth approximation more specifically aims at the strongest true theory T about the set of nomic possibilities within the set of conceptual possibilities Mp generated by a chosen vocabulary for a chosen domain. Nomic truth approximation by evidence-guided *theory* revision requires definitions of ‘being closer to the truth’ and ‘being more successful’, or rather primarily their ‘at least as’-versions. A theory X amounts to a specified subset of Mp with the weak claim that it is a superset of T (T ⊆ X) and the strong claim that it is equal to it (T = X), resulting from adding the claim that X is a subset of T (X ⊆ T). The weak claim may also be called the *necessity claim* and the extra one the *sufficiency claim*, corresponding to whether the claim states that belonging to X is necessary or sufficient for being nomically possible.

Informally we can summarize the point of departure as follows: we have a domain Mp of possibilities and every theory ‘amounts to’ a subset of this domain. This applies also to the strongest true theory, T. The elements of T are the ‘real’ possibilities, so to speak. All the possibilities outside T are not real.

The weak claim concerning a theory X is that this theory does not leave out any real possibilities. The strong claim is that it in addition does not allow for any unreal possibilities.

*’ amounts to: Y∆T ⊆ X∆T (where ∆ stands for symmetrical difference, i. e. Y∆T = Y − T ∪ T − Y), and hence to:*

**Y is at least as close to T as X**(i

^{b}) T − Y is a subset of T − X(ii

^{b}) Y − T is a subset of X − T

and ‘**closer to****’** iff, in addition, in at least one case it is a *proper* subset.

This is the model version; there is also a consequence version and a mixed version (see Kuipers 2000, Chap. 8).

Not knowing T, we have to try to improve our guesses (theories) of what T is on the basis of, or guided by, (new) evidence. Evidence typically comes in by experimentally realizing conceptual possibilities, say R(t) up to time t. They are, of course, nomic possibilities, hence, if we have not made mistakes, R(t) is a subset of T (R(t) ⊆ T), whatever T is. Neglecting mistakes and forgetfulness, R(t) is an increasing set of established nomic possibilities.

R(t) will grow in particular due to testing general hypotheses, each one claiming that all nomic possibilities satisfy it. They may have been derived from the weak claim of theory X or may have been put to the test in order to test some other theory or for still other reasons. At each point of time we may assume that one or more of them are considered to have been sufficiently established as empirical laws by inductive generalization. Let subset S(t) of Mp represent at time t the resulting strongest, induced empirical law, which amounts to the claim that S(t) is the smallest induced superset of T, whatever T is (T ⊆ S(t)). Neglecting mistakes and forgetfulness, S(t) is a decreasing set.

In sum: R(t) ⊆ T ⊆ S(t), assuming no mistakes. From now on t will be omitted. The following definition is now plausible:

The (qualitative) basic definition of ‘* Y is at least as successful as X relative to R/S*’ amounts to:

(i^{b}-sf) R − Y is a subset of R − X

(ii^{b}-sf) Y − S is a subset of X − S

and ‘* more successful*’ by requiring in addition that in at least one case it is a

*proper*subset.

The first clause can be rephrased as: all established counterexamples to Y are counterexamples to X; and the second as: all established laws (represented by supersets of S!) explained by X are explained by Y. Note that the above definition implies that a theory Y is maximally successful relative to R/S iff R ⊆ Y ⊆ S. For then, and only then, both R − Y and Y − S are empty sets, which means that Y is at least as successful as any theory X.

: If Y is closer to T than X then Y will always be at least as successful as X and become more successful in the long run.Success Theorem

Proofof “Y will always be at least as successful as X”. First clauses, assuming R ⊆ T, R − Y ⊆ T − Y, and by (i^{b}), R − Y ⊆ T − X. But we also have that R − Y ⊆ R, hence R − Y is a subset of the intersection of R and T − X, which equals R − X. Second clauses, assuming T ⊆ S, Y − S ⊆ Y − T, and by (ii^{b}), Y − S ⊆ X − T. But we have also Y − S ⊆ Mp − S, hence Y − S is a subset of the intersection of Mp − S and X − T, which equals X − S. Q.e.d.

This theorem gives good reasons to abduce, under certain conditions and for the time being, that theory Y is closer to the truth than theory X when Y is persistently more successful than X, i.e., when we typically speak of

Proof sketchof “Y will …. become more successful [than X] in the long run”. When (i^{b}) or (ii^{b}) can be strengthened to proper subsets, in the long run, in which R approaches T by steadily growing and S approaches T by steadily shrinking, there will be realized (hence, nomic) possibilities belonging (to T) and to Y, but not to X, or there will be laws induced that assign the status of nomic impossibilities (in Mp − T) to conceptual possibilities that are excluded by Y, but not by X. Of course, a straightforward proof requires precise assumptions about the way in which the experiments are going through T and how and when laws are induced. Q.e.d.

*empirical progress*. Or, conversely: ‘truth approximation’ provides the

*default*-

*explanation*of ‘empirical progress’. For the basic case the good reasons are threefold (Kuipers 2000, 162), in brief: (1) it is still possible that Y is closer to the truth than X, which would explain the persistent greater success, (2) it is impossible that X is closer to the truth than Y, (3) if neither holds, the persistent greater success so far requires a (test history) specific explanation. We can also paraphrase the overall conclusion by saying that persistent greater success is conducive for truth approximation and hence that greater success is

*potentially*conducive for truth approximation.

From the above definitions and the theorem we may also draw the preliminary conclusion that, assuming the data are correct, theory revision which not only realizes empirical progress but also nomic truth approximation is at least formally possible. Moreover, as is easy to check, both are even realistic, in the case of finitely many conceptual possibilities, as in the electric network, and, in general, when a finite propositional language can be used.

*basic theory revision of X by R/S*. The revised theory is \( \left( {{\text{X}} \cap {\text{S}}} \right) \cup {\text{R}} \) or, equivalently, \( \left( {{\text{X}} \cap {\text{R}}} \right) \cup {\text{S}} \) and will be indicated by \( {\text{X}}_{\text{R/S}}^{\text{b}} \). Note that \( {\text{X}}_{\text{R/S}}^{\text{b}} \) equals X when R ⊆ X ⊆ S, i.e., when X is maximally successful. Moreover, it is easy to see that R ⊆ \( {\text{X}}_{\text{R/S}}^{\text{b}} \) ⊆ S, i.e., that \( {\text{X}}_{\text{R/S}}^{\text{b}} \) is maximally successful.

Note that the condition that X is not maximally successful amounts to the claim that R is not a subset of X or X is not a subset of S, i.e., R includes counterexamples of X or X cannot explain all laws derivable from S, in sum, X is not ‘between’ R and S (while the revision is!).

Basic Revision Theorem: Assuming correct data (R ⊆ T ⊆ S), ‘basic theory revision of X by R/S’, resulting in \( {\text{X}}_{\text{R/S}}^{\text{b}} \), guarantees that \( {\text{X}}_{\text{R/S}}^{\text{b}} \) is (basically) at least as close to T, and hence at least as successful as X relative to R/S. Moreover, it is even closer to T, and more successful, than X when X is not maximally successful.

In particular the first case is of a great interest, for though extreme in some sense, it is certainly not exceptional. It simply amounts to the case in which a theory X is incompatible with at least one established law, and hence with the strongest established law. But first we will deal with the question put in this paper as far as non-extreme cases are concerned.

### 2.2 Basic Theory Revision in Light of AGM-Belief Revision

Now we turn to the main question of the paper: is it possible to reproduce the theory revision from X to \( {\text{X}}_{\text{R/S}}^{\text{b}} \) by AGM-style belief revision? As is well-known, *AGM*-*belief revision* centers around three (partially related) operations (Alchourrón et al. 1985), see also e.g. Cevolani and Calandra (2009). A belief set, that is, a deductively closed set of sentences of a given language, is confronted with some ‘input sentence’ that, by minimal further changes of the original belief set, either should become a consequence or no longer be a consequence of the revised belief set. For the first case, it makes an important difference whether or not the input sentence is compatible with the belief set. In the first subcase we get so-called *expansion*, viz., the belief set is strengthened to the set of consequences of the union of the belief set and the input sentence. Regarding the input sentence it leads from suspension of judgment about that sentence to its acceptance. In the second subcase the belief set has to be adapted in a more complicated way, satisfying certain axioms. It is called *revision* (in the narrow sense). Regarding the input sentence revision leads from its rejection to its acceptance, except when the input sentence is inconsistent. Finally, in the second main case, the input sentence is supposed to belong to the belief set, but should no longer belong to the revised set. Hence, now the belief set has to be weakened in a minimal way, again in line with some axioms. It is called *contraction*. Regarding the input sentence it leads from its acceptance to suspension of judgment, except when the input sentence is logically true, in which case it remains accepted after contraction.^{2}

The focus in the belief revision program has been the axiomatic characterization of the three indicated operations. Whereas this kind of explication of expansion is relatively simple, it is rather complicated for revision and contraction.

To be sure, we did not present the previous subsection in terms of sentences of a language but in terms of (sets of) conceptual possibilities or structures generated by a language. But we could translate, for example, theory X in terms of Th(X), i.e., the (deductively closed) set of sentences that are true of all structures in X. In this way the set of structures X becomes the set of models of Th(X). However, it is characteristic of the structuralist approach to identify a sentence or theory X with its set of models and to consider the set of (subsets of Mp being) supersets of X as representing the set of consequences of X. In the present context of nomic theories, this essentially model-theoretical notion of consequence is, directly be transmitted to the weak claim of a theory. To be precise, if Y is a superset of X, X ⊆ Y, the weak claim of theory Y, “T ⊆ Y”, is a consequence of the weak claim of theory X, “T ⊆ X”. Note that the strong claims of theories X and Y are incompatible as soon as Y is a *proper* superset of X.

In this way we not only get ‘model versions’ of (sets of) sentences and consequences, but we can also form model versions of the three operations (Hansson 1999, 220–225). For expansion this is almost trivial, for revision and contraction some extreme forms are also rather easy, precisely the ones we need in this section.

Expansion of theory X by input ‘sentence’ A amounts to \( {\text{X}} \cap {\text{A}} \). The so-called *full meet* (fm-)revision of X by A amounts to \( {\text{X}} \cap {\text{A}} \) when X is compatible with A (\( {\text{X}} \cap {\text{A}} \) is non-empty) and to A when X is incompatible with A. Finally, the so-called *full meet* (fm-)contraction of X by A amounts to \( {\text{X}} \cup {\text{cA}} \) when X entails A and to X when it does not. Note that fm-revision of X by A not only entails A, as informally required of revision, but also coincides with expansion of X by A when X and A are compatible and fully jumps to A when they are incompatible. In the latter case it is an extreme form of (AGM-)revision. Note also that fm-contraction of X by A no longer entails A, when X does entail A, as informally required of contraction, but that it then fully allows *all* possibilities in cA. In this sense it is an extreme form of (AGM-)contraction. Note, moreover, that it remains X when X does not entail A.

Since the AGM-operations typically deal with the consequences of the relevant belief set, it is plausible to focus our leading question first on the way in which the weak or necessity claim of a theory X has to be adapted. To obtain a nomic theory in our sense we have to finally add the sufficiency claim to the adapted version of X. Recall that we exclude in this subsection two extreme cases, of which the most important one is that S and X are incompatible.

From the indicated perspective it is immediately clear that the first step in the basic revision, from X to \( {\text{X}} \cap {\text{S}} \), is a clear case of (the model version of) *expansion* of X by S. Similarly, if we consider the transition from \( {\text{X}} \cup {\text{R}} \) to \( ( {\text{X}} \cup {\text{R)}} \cap {\text{S}} \). Recall, for later purposes, that expansion and fm-revision of X by S coincide when they are compatible, which we are assuming.

Regarding the transition from X to \( {\text{X}} \cup {\text{R}} \), or from \( {\text{X}} \cap {\text{S}} \) to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \), the situation is a bit more complicated. Focusing on the transition from X to \( {\text{X}} \cup {\text{R}} \), that is, from X to X \( \cup \) (R − X), of which R − X amounts to the set of realized counterexamples of X, we see that whereas X is a subset of, and hence entails, c(R − X), X \( \cup \) R does no longer entail this consequence. It even allows all possibilities in R − X. This amounts to fm-contraction of X by c(R − X). Similarly, the transition from \( {\text{X}} \cap {\text{S}} \) to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \) amounts to fm-contraction of \( {\text{X}} \cap {\text{S}} \) by c(R − (\( {\text{X}} \cap {\text{S}} \))).

In sum, we may now conclude that basic theory revision of X by R/S, leading to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \) or, equivalently, \( ( {\text{X}} \cup {\text{R)}} \cap {\text{S}} \), can be seen as the successive application of expansion and fm-contraction (or vice versa), followed by adding the sufficiency claim to the resulting theory.

To be sure, we need to add the sufficiency claim, of which it is not easy to see how it can be represented in AGM-terms, starting from the present perspective on ‘nomic theories’. It seems that the totally different approach by Cevolani, Crupi, and Festa (this volume) opens a new perspective avoiding this closure operation of sorts. However, that approach seems restricted to finite propositional languages and does not seem to have a clear alternative for the ‘refined account’ that we will soon start to motivate and to develop.

From our perspective the above analysis completes our task of an AGM-presentation of basic theory revision for the non-extreme cases in which X and S are compatible (\( {\text{X}} \cap {\text{S}} \) ≠ Ø) and in which X and R do not exhaust Mp (\( {\text{X}} \cup {\text{R}} \) ≠ M_{p}), respectively. In both extreme cases the role of X essentially vanishes. Whereas the second extreme case (\( {\text{X}} \cup {\text{R}} \) = M_{p}) seems rather rare, the first extreme case (\( {\text{X}} \cap {\text{S}} \) = Ø) certainly is not: it merely assumes that X is incompatible with at least one induced empirical law. Hence, the main remaining task is to refine the expansion of X by S in some way for the case in which X and S are incompatible.

One might suggest that another aspect of the transition from X to \( {\text{X}} \cup {\text{R}} \) (or from \( {\text{X}} \cap {\text{S}} \) to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R)}} \) may require refinement. Instead of fm-contraction of X by c(R − X) one might think of so-called partial meet contraction of X by c(R − X), in which case not all possibilities in R − X are allowed. This would require some kind of degree of trustworthiness of the various experimentally realized conceptual possibilities. A similar kind of refinement of the transition from X to \( {\text{X}} \cap {\text{S}} \) arises when we would assume a degree of trustworthiness of the induced laws, in which case S is no longer taken for granted. However, these kinds of refinement, which amount to weakening of the correct data assumption, go beyond the scope of the present paper.

Finally, here, and for later purposes, it is interesting to see what would have resulted when we would have defined basic theory revision of X by R/S in terms of fm-revision of X by S followed by the relevant fm-contraction, or vice versa (in both cases, followed by adding the sufficiency claim). By the indicated alternative definition we would obtain \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \) when \( {\text{X}} \cap {\text{S}} \) is non-empty, and \( {\text{S}} \cup {\text{R}} \), that is, S, when \( {\text{X}} \cap {\text{S}} \) is empty, hence deviating from our primary definition in, and only in, the second case. By the ‘vice versa’ definition, fm-contraction by c(R − X), followed by fm-revision by S, we would obtain \( ( {\text{X}} \cup {\text{R)}} \cap {\text{S}} \), which reduces to R when \( {\text{X}} \cap {\text{S}} \) is empty. Hence, in this case the result would not differ from our primary definition. Let us call the deviating alternative definition the *fm*-*definition* of basic theory revision of X by R/S.

## 3 The Refined Account

The main problem of basic revision of X by R/S is that it reduces to R when X and S do not overlap, i.e., contradict each other. Expansion of X by S then gives the empty set, the subsequent weakening with R just amounts to R, hence a result that in no way reminds us of X. It is easy to check that the other order leads to the same result. For this route it is crucial to note that R is a subset of S. The plausible direction for refinement is to try to concretize basic revision of X by R/S in terms of a likeness approach that reduces to the basic (content) approach under the appropriate idealization conditions (IC-test), i.c. when X and S are compatible.

From the AGM-BR-perspective and our structuralist view of theories the spheres approach of Adam Grove (1988) is highly plausible. The spheres may seem to fall rather out of the air, but later we will see that they can be given a plausible ‘similarity foundation’ which, moreover, enables us to connect the spheres approach more specifically to the (structuralist) likeness approach of qualitative truth approximation.

The basic idea of Grove is to postulate nested spheres around X, satisfying a number of conditions, notably, and plausibly, that X is the smallest and Mp is the largest sphere. Consider the smallest sphere σ_{X}(S) around X overlapping with S. It is now plausible to define (refined) theory revision of X by S (\( {\text{X}}_{\text{S}}^{\text{r}} \)) as the intersection of S and σ_{X}(S), i.e. as σ_{X}(S) \( \cap \) S. It is easy to check (IC-test!) that, when X and S are compatible, σ_{X}(S) = X and hence \( {\text{X}}_{\text{S}}^{\text{r}} = {\text{X}} \cap {\text{S}}( = {\text{X}}_{\text{S}}^{\text{b}} ) \). Grove has proved that \( {\text{X}}_{\text{S}}^{\text{r}} \) satisfies the original AGM-axioms of belief revision presented in (Alchourrón et al. 1985). This corresponds to what later has been called ‘transitively relational partial meet revision’ (Hansson 1999, p. 223), which we will simply abbreviate by ‘pm-revision’.

In sum, \( {\text{X}}_{\text{S}}^{\text{r}} \) = σ_{X}(S) \( \cap \) S is the most straightforward AGM-way to deal with the revision of X by S, but how to take R into account now? Recall that R is a non-empty subset of S. Recall also that the transition from X to \( {\text{X}} \cup {\text{R}} \) amounted to fm-contraction of X by c(R − X) and the transition from \( {\text{X}} \cap {\text{S}} \) to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \) to fm-contraction of \( {\text{X}} \cap {\text{S}} \) by c(R − (\( {\text{X}} \cap {\text{S}} \))). As Hansson (1999, 224–225) describes, contraction can also get a spheres interpretation, giving rise to partial meet (pm-)contraction. However, this would mean that we have to make a selection of members of R − X or of R − (X ∩ S), respectively. In the present context there is not much reason for this kind of refinement.

Therefore, the only question that remains is the order in which the refined revision by S and the basic revision by R should take place. According to a first alternative one can first apply fm-contraction of X by c(R − X), followed by pm-revision of the result (\( {\text{X}} \cup {\text{R}} \)) by S, leading to \( {\text{X}}_{\text{S(R)}}^{\text{r}} = \,_{\text{def}} ({\text{X}} \cup {\text{R}})^{\text{r}}_{\text{S}} = ({\text{X}} \cup {\text{R}}) \cap {\text{S}} = {\text{X}}_{\text{R/S}}^{\text{b}} \), since \( {\text{X}} \cup {\text{R}} \) itself is the smallest sphere around \( {\text{X}} \cup {\text{R}} \) overlapping with S. Hence, \( {\text{X}}_{\text{S(R)}}^{\text{r}} = {\text{X}}_{\text{R/S}}^{\text{b}} \), i.e., basic revision of X by R/S, even if \( {\text{X}} \cap {\text{S}} \) = Ø. Hence, the first alternative is no solution of the main problem.

_{X}(S) \( \cap \) S) by c(R − (σ

_{X}(S) \( \cap \) S)). In this way we get: \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) = \( _{\text{def}} {\text{X}}_{\text{S}}^{\text{r}} \)\( \cup \)R = (σ

_{X}(S) \( \cap \) S) \( \cup \) R. Note that (IC-test) \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) reduces to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \) = \( {\text{X}}_{\text{R/S}}^{\text{b}} \) when X and S overlap. However, \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) ≠ \( {\text{X}}_{\text{R/S}}^{\text{b}} \) when X and S do not overlap. Hence, the order matters a lot, and we will opt for this second alternative. Of course, refined revision is only rounded off by adding the sufficiency claim. Of the suggested overlaps in the figure below, the only required overlap is that of σ

_{X}(S) with S, not that with T, let alone that with R. However this may be, the horizontally shaded area indicates the revision step and the vertically shaded area the contraction step.

Note that pm-revision of X by S reduces to fm-revision when there are just two spheres, viz. X and Mp. Hence, when there are just two spheres, the result of pm-revision of X by S followed by the relevant fm-contraction, and closed by adding the sufficiency claim, reduces to (the result of) the fm-definition of basic theory revision of X by R/S.

Let us now evaluate refined revision first in terms of basic truthlikeness and basic successfulness. Let us begin by the latter. It is not difficult to check that \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) is basically at least as successful as X. It is even maximally successful, for it holds that \( {\text{R}} \subseteq {\text{X}}_{\text{R(S)}}^{\text{r}} \subseteq {\text{S}} \), hence, \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) has no established counterexamples and it explains the strongest established law, hence it explains all established laws. However, already in view of being basically at least as successful, the proposed revision is, due to the (basic) success theorem, potentially conducive for basic truth approximation, even if X is incompatible with S. But in this extreme case, the proposed revision is not basically at least as close to the truth, except in a very extreme, lucky case. The reason is that, as a rule, the revision introduces new mistakes, viz. it includes models of S outside T that did not belong to X, i.e., σ_{X}(S) \( \cap \) (S − T) will be non-empty. This is typically grist to the mill of refined truth approximation, for in that approach new mistakes are allowed as long as they are less bad than old ones. Hence, the question is how the revision fares in terms of refined truthlikeness and corresponding refined successfulness.

*between*x and z. It is supposed to satisfy some plausible minimal (s-) conditions.

^{3}Moreover, we need not assume that all pairs of structures are comparable in the sense of being related by some intermediate structure. Hence we define: x and z are

*related*, r(x,z), iff \( \exists \) y s(x,y,z). Finally, we say that s is trivial if: for all x, y, and \( {\text{z}}\,{\text{s}}\left( {{\text{x}},{\text{y}},{\text{z}}} \right){\text{iff}}\,{\text{x}} = {\text{y}} = {\text{z}}. \)

This relation might be paraphrased by: X has at least as similar representatives of x as of y.

Recall that σ_{X}(S) was the ‘smallest’ sphere around X that overlaps with S and that \( {\text{X}}_{\text{S}}^{\text{r}} \) = σ_{X}(S) \( \cap \) S was defined as the refined revision of X by S. Rabinowicz proved that \( {\text{X}}_{\text{S}}^{\text{r}} \) = {x′ ∈ S| \( \exists \)x ∈ X ∀y ∈ X ∀y′ ∈ S sim(x′,x;y′,y)}, where the latter set corresponds to Rabinowicz’ version of \( {\text{X}}_{\text{S}}^{\text{r}} \). The idea behind this version is that it forms “the set of S-worlds that are as similar to some worlds in X as possible, as compared with other worlds in X” (Rabinowicz (1995, p. 82, S substituted for Y). The Limit Assumption that now is needed instead of a, here not presented, very arbitrary assumption of Grove is not at all that arbitrary: if X and S are non-empty then \( {\text{X}}_{\text{S}}^{\text{r}} \) is non-empty.

*iff*

**Y is refined at least as truthlike as X**(i

^{r}) \( \forall \)x ∈ X z ∈ T r(x,z) → ∃y ∈ Y s(x,y,z)(ii

^{r}) \( \forall \)y ∈ Y − (X \( \cup \) T) ∃x ∈ X − T ∃z ∈ T − X s(x,y,z)

It is easy to check that (i^{r}) is a strengthening of (i^{b}) of the basic definition and that (ii^{r}) is a weakening of (ii^{b}). (i^{r}) roughly says that every comparable pair of structures, one of X and one of T, has an ‘intermediate’ in Y. (ii^{r}) states that if Y − (X \( \cup \) T) is at all non-empty, which is excluded in the basic case, these structures are ‘useful’. The definition reduces to the basic one when s is trivial.

Whereas the basic revision \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) was easily seen to be basically at least as truthlike as X, the refined revision \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) is now not necessarily at least as truthlike as X in the refined sense. Hence, there is now even more reason to turn to successfulness.

*, iff*

**Y is refined at least as successful as X, relative to R/S**(i

^{r}-sf) \( \forall \)x ∈ X z ∈ R r(x,z) → ∃y ∈ Y s(x,y,z)(ii

^{r}-sf) \( \forall \)y ∈ Y − (X \( \cup \) S) ∃x ∈ X − S ∃z ∈ S − X s(x,y,z)

The Refined Success Theorem tells now that, assuming correct data, ‘refined at least as truthlike’ entails ‘refined at least as successful’. Again the proof is not difficult. However, for the general proof of (ii^{r})’s entailment of (ii^{r}-sf) we need to assume that, if Y − (X \( \cup \) S) is non-empty, S is convex (i.e., if x, z ∈ S and s(x,y,z), that is, when y is qua kind of structure between x and z, then y ∈ S). Similar to the basic case, the consequence of the theorem is that being persistently more successful in the refined sense is conducive for refined truth approximation (provided S is convex, if relevant).

The final crucial question now is whether the (AGM-interpretable) refined revision \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) of X by R/S is at least as successful as X in the refined sense. In that case it would be potentially conducive for truth approximation for it may become persistently more successful in the refined sense and hence conducive for refined truth approximation. This happens to be the case according to the following:

**Main Theorem**: \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) is refined at least as successful as X, relative to R/S.

This is also trivial, for \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) is a subset of S, hence \( {\text{X}}_{\text{R(S)}}^{\text{r}} \) − (X\( \cup \)S) is empty. The latter fact has even the consequence that the convexity of S is not required for the applicability of the Refined Success Theorem.

## 4 Conclusions

The main conclusions of this paper are:

First, basic revision of theory X in light of evidence R/S, assuming X and S compatible, based on expansion by S, leading to \( {\text{X}} \cap {\text{S}} \), followed by fm-contraction by c(R − (\( {\text{X}} \cap {\text{S}} \))), leading to \( ( {\text{X}} \cap {\text{S)}} \cup {\text{R}} \), and closed by adding the sufficiency claim, is basically at least as successful as X and even basically at least as close to X in the nomic sense.

Second, refined theory revision in light of evidence R/S, assuming X and S incompatible, based on pm-revision by S, along Grove-Rabinowicz lines, leading to σ_{X}(S) \( \cap \) S, followed by fm-contraction by c(R − (σ_{X}(S) \( \cap \) S)), leading to (σ_{X}(S) \( \cap \) S) \( \cup \) R, and closed by adding the sufficiency claim, is at least as successful as X in the refined sense, and hence potentially conducive for refined nomic truth approximation.

- (a)
Having to focus in both cases first on the necessity claim and to add at last the sufficiency claim is not very elegant.

- (b)
Both revisions are rather ad hoc. However, as in general for ad hoc changes in a theory, the crucial question is whether they can be put to new (HD-) tests, and this is evidently the case. After all, it could even be the case that all further tests indicate that no new ad hoc maneuvers have to be made.

- (c)
Both revisions are rather diehard empiricist or instrumentalist. The ‘instrument’ X is precisely so adapted that it just saves the phenomena, not only with respect to R but also with respect to S. Note that this character will not change by weakening the correct data assumption, as suggested at the end of Sect. 2.

- (d)
If there is something like well-formed theories, there do not seem to be good reasons to expect that the two revisions will satisfy the criteria, even if R and S satisfy some derived criteria.

- (e)
Last, but not least, what remains of the idea behind X? A proper theory, even if it is without theoretical terms, in some sophisticated sense, is usually based on one or two ideas. It is difficult to imagine that such ideas do not become ‘mutilated’ by the revision.

Be this as it may, the two results may stimulate the interaction between truth approximation and belief revision approaches for they fundamentally show that AGM belief revision provides means for nomic truth approximation.

The formal definition also leaves room for the case in which the input sentence does not belong to the original belief set. Then the outcome of contraction is simply the original belief set, i.e. judgment about the input sentence was and remains suspended.

They are: centered, centering and conditionally left and right reflexive. Here s is centered iff s(x,x,x) and centering iff s(x,y,x) implies x = y. s is conditionally left/right reflexive if s(x,y,z) implies all kinds of left and right reflexivity, i.e., s(x,x,y), s(x,x,z), s(y,y,z) and s(x,y,y), s(x,z,z), s(y,z,z), respectively. Note that this conditional form leaves room for incomparable structures (see text), which otherwise would not be the case.

## Acknowledgments

The author wishes to thank Roberto Festa for the occasion to present this paper in 2009 at a symposium in Trieste, Gustavo Cevolani, Gerhard Schurz and Wlodek Rabinowicz for very useful comments, and the *Netherlands Institute for Advanced Study* (NIAS), Wassenaar, for providing again paradisiacal conditions for research and writing, including linguistic correction by Anne Simpson.

### Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.