Partial monotonicity and a new version of the Ramsey test

We introduce two new belief revision axioms: partial monotonicity and consequence correctness. We show that partial monotonicity is consistent with but independent of the full set of axioms for a Gärdenfors belief revision sytem. In contrast to the Gärdenfors inconsistency results for certain monotonicity principles, we use partial monotonicity to inform a consistent formalization of the Ramsey test within a belief revision system extended by a conditional operator. We take this to be a technical dissolution of the well-known Gärdenfors dilemma.In addition, we present the consequential correctness axiom as a new measure of minimal revision in terms of the deductive core of a proposition whose support we wish to excise. We survey several syntactic and semantic belief revision systems and evaluate them according to both the Gärdenfors axioms and our new axioms. Furthermore, our algebraic characterization of semantic revision systems provides a useful technical device for analysis and comparison, which we illustrate with several new proofs.Finally, we have a new inconsistency result, which is dual to the Gärdenfors inconsistency results. Any elementary belief revision system that is consequentially correct must violate the Gärdenfors axiom of strong boundedness (K^*8), which we characterize as yet another monotonicity condition.This work was supported by the McDonnell Douglas Independent Research and Development program.     

Belief contraction without recovery

The postulate of recovery is commonly regarded to be the intuitively least compelling of the six basic Gärdenfors postulates for belief contraction. We replace recovery by the seemingly much weaker postulate of core-retainment, which ensures that if x is excluded from K when p is contracted, then x plays some role for the fact that K implies p. Surprisingly enough, core-retainment together with four of the other Gärdenfors postulates implies recovery for logically closed belief sets. Reasonable contraction operators without recovery do not seem to be possible for such sets. Instead, however, they can be obtained for non-closed belief bases. Some results on partial meet contractions on belief bases are given, including an axiomatic characterization and a non-vacuous extension of the AGM closure condition.     

Belief revision,epistemic conditionals and the Ramsey test

Epistemic conditionals have often been thought to satisfy the Ramsey test (RT): If A, then B is acceptable in a belief state G if and only if B should be accepted upon revising G with A. But as Peter Gärdenfors has shown, RT conflicts with the intuitively plausible condition of Preservation on belief revision. We investigate what happens if (a) RT is retained while Preservation is weakened, or (b) vice versa. We also generalize Gärdenfors' approach by treating belief revision as a relation rather than as a function.In our semantic approach, the same relation is used to model belief revision and to give truth-conditions for conditionals. The approach validates a weak version of the Ramsey Test (WRR) — essentially, a restriction of RT to maximally consistent belief states.We prove that alternatives (a) and (b) are both consistent, but argue that (b) is philosophically more promising. Gärdenfors' belief-revision axioms are compatible with WRR together with RT from left to right: the only direction of the test that is defensible on intuitive grounds.An earlier version of this paper was presented at the conference on the dynamics of knowledge and belief at Lund University, 24–26 August 1989. We wish to thank Sven Danielsson, Peter Gärdenfors, Sören Halldén, David Makinson, Hugh Mellor, Michael Morreau, Nils-Eric Sahlin and Brian Skyrms for their very helpful suggestions and remarks. We are also grateful for thought-provoking criticism and comments from two anonymous referees.     

Probabilistic dynamic belief revision

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws.     

On the logic of nonmonotonic conditionals and conditional probabilities

I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, , in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, CB holds just in case P[B|C]r. Thus, each conditional in a given family behaves like conditional probability above some specific support level.Chris Swoyer provided very helpful comments on drafts of this paper.     

Conditionals and theory change: Revisions,expansions, and additions

This paper dwells upon formal models of changes of beliefs, or theories, which are expressed in languages containing a binary conditional connective. After defining the basic concept of a (non-trivial) belief revision model. I present a simple proof of Gärdenfors's (1986) triviality theorem. I claim that on a proper understanding of this theorem we must give up the thesis that consistent revisions (additions) are to be equated with logical expansions. If negated or might conditionals are interpreted on the basis of autoepistemic omniscience, or if autoepistemic modalities (Moore) are admitted, even more severe triviality results ensue. It is argued that additions cannot be philosophically construed as parasitic (Levi) on expansions. In conclusion I outline somed logical consequences of the fact that we must not expect monotonic revisions in languages including conditionals.I wish to thank Peter Gärdenfors for a number of helpful comments, André Fuhrmann and Wolfgang Spohn for extensive discussion of parts of this paper, and Winfred Klink for kindly checking my English.     

Iterative Probability Kinematics

Following the pioneer work of Bruno De Finetti [12], conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's. Perhaps the most salient axiomatizations are Karl Popper's in [31], and Alfred Renyi's in [33]. Nonstandard probability spaces [34] are a well know alternative to this approach. Vann McGee proposed in [30] a result relating both approaches by showing that the standard values of infinitesimal probability functions are representable as Popper functions, and that every Popper function is representable in terms of the standard real values of some infinitesimal measure.Our main goal in this article is to study the constraints on (qualitative and probabilistic) change imposed by an extended version of McGee's result. We focus on an extension capable of allowing for iterated changes of view. Such extension, we argue, seems to be needed in almost all considered applications. Since most of the available axiomatizations stipulate (definitionally) important constraints on iterated change, we propose a non-question-begging framework, Iterative Probability Systems (IPS) and we show that every Popper function can be regarded as a Bayesian IPS. A generalized version of McGee's result is then proved and several of its consequences considered. In particular we note that our proof requires the imposition of Cumulativity, i.e. the principle that a proposition that is accepted at any stage of an iterative process of acceptance will continue to be accepted at any later stage. The plausibility and range of applicability of Cumulativity is then studied. In particular we appeal to a method for defining belief from conditional probability (first proposed in [42] and then slightly modified in [6] and [3]) in order to characterize the notion of qualitative change induced by Cumulative models of probability kinematics. The resulting cumulative notion is then compared with existing axiomatizations of belief change and probabilistic supposition. We also consider applications in the probabilistic accounts of conditionals [1] and [30].     

On the logic of theory change: Safe contraction

This paper is concerned with formal aspects of the logic of theory change, and in particular with the process of shrinking or contracting a theory to eliminate a proposition. It continues work in the area by the authors and Peter Gärdenfors. The paper defines a notion of safe contraction of a set of propositions, shows that it satisfies the Gärdenfors postulates for contraction and thus can be represented as a partial meet contraction, and studies its properties both in general and under various natural constraints.     

Systematic Withdrawal

Although AGM theory contraction (Alchourrón et al., 1985; Alchourrón and Makinson, 1985) occupies a central position in the literature on belief change, there is one aspect about it that has created a fair amount of controversy. It involves the inclusion of the postulate known as Recovery. As a result, a number of alternatives to AGM theory contraction have been proposed that do not always satisfy the Recovery postulate (Levi, 1991, 1998; Hansson and Olsson, 1995; Fermé, 1998; Fermé and Rodriguez, 1998; Rott and Pagnucco, 1999). In this paper we present a new addition, systematic withdrawal, to the family of withdrawal operations, as they have become known. We define systematic withdrawal semantically, in terms of a set of preorders, and show that it can be characterised by a set of postulates. In a comparison of withdrawal operations we show that AGM contraction, systematic withdrawal and the severe withdrawal of Rott and Pagnucco (1999) are intimately connected by virtue of their definition in terms of sets of preorders. In a future paper it will be shown that this connection can be extended to include the epistemic entrenchment orderings of Gärdenfors (1988) and Gärdenfors and Makinson (1988) and the refined entrenchment orderings of Meyer et al. (2000).     

A Sequent Formulation of Conditional Logic Based on Belief Change Operations

Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity.     

Towards a “Sophisticated” Model of Belief Dynamics. Part II: Belief Revision.

In the companion paper (Towards a “sophisticated” model of belief dynamics. Part I), a general framework for realistic modelling of instantaneous states of belief and of the operations involving them was presented and motivated. In this paper, the framework is applied to the case of belief revision. A model of belief revision shall be obtained which, firstly, recovers the Gärdenfors postulates in a well-specified, natural yet simple class of particular circumstances; secondly, can accommodate iterated revisions, recovering several proposed revision operators for iterated revision as special cases; and finally, offers an analysis of Rott’s recent counterexample to several Gärdenfors postulates [32], elucidating in what sense it fails to be one of the special cases to which these postulates apply.     

Iterated Belief Revision and Conditional Logic

In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl's ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors' Triviality Result.     

Reapproaching Ramsey: Conditionals and Iterated Belief Change in the Spirit of AGM

According to the Ramsey Test, conditionals reflect changes of beliefs: α?>?β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α?>?β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α?>?(β?>?γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals.     

Causal and noncausal conditionals: An integrated model of interpretation and reasoning

We present an integrated model for the understanding of and the reasoning from conditional statements. Central assumptions from several approaches are integrated into a causal path model. According to the model, the cognitive availability of exceptions to a conditional reduces the subjective conditional probability of the consequent, given the antecedent. This conditional probability determines people's degree of belief in the conditional, which in turn affects their willingness to accept logically valid inferences. In addition to this indirect pathway, the model contains a direct pathway: Availability of exceptional situations directly reduces the endorsement of valid inferences. We tested the integrated model with three experiments using conditional statements embedded in pseudonaturalistic cover stories. An explicitly mentioned causal link between antecedent and consequent was either present (causal conditionals) or absent (arbitrary conditionals). The model was supported for the causal but not for the arbitrary conditional statements.     

Conditioning and Interpretation Shifts

This paper develops a probabilistic model of belief change under interpretation shifts, in the context of a problem case from dynamic epistemic logic. Van Benthem [4] has shown that a particular kind of belief change, typical for dynamic epistemic logic, cannot be modelled by standard Bayesian conditioning. I argue that the problems described by van Benthem come about because the belief change alters the semantics in which the change is supposed to be modelled: the new information induces a shift in the interpretation of the sentences. In this paper I show that interpretation shifts can be modeled in terms of updating by conditioning. The model derives from the knowledge structures developed by Fagin et?al [8], and hinges on a distinction between the propositional and informational content of sentences. Finally, I show that Dempster-Shafer theory provides the appropriate probability kinematics for the model.     

Probabilistic causality reexamined

According to Nancy Cartwright, a causal law holds just when a certain probabilistic condition obtains in all test situations which in turn satisfy a set of background conditions. These background conditions are shown to be inconsistent and, on separate account, logically incoherent. I offer a corrective reformulation which also incorporates a strategy for problems like Hesslow's thrombosis case. I also show that Cartwright's recent argument for modifying the condition to appeal to singular causes fails.Proposed modifications of the theory's probabilistic condition to handle effects with extreme probabilities (0 or 1) are found unsatisfactory. I propose a unified solution which also handles extreme causes. Undefined conditional probabilities give rise to three good, but non-equivalent, ways of formulating the theory. Various formulations appear in the literature. I give arguments to eliminate all but one candidate. Finally, I argue for a crucial new condition clause, and show how to extend the results beyond a simple probabilistic framework.     

Conditional Probability in the Light of Qualitative Belief Change

We explore ways in which purely qualitative belief change in the AGM tradition throws light on options in the treatment of conditional probability. First, by helping see why it can be useful to go beyond the ratio rule defining conditional from one-place probability. Second, by clarifying what is at stake in different ways of doing that. Third, by suggesting novel forms of conditional probability corresponding to familiar variants of qualitative belief change, and conversely. Likewise, we explain how recent work on the qualitative part of probabilistic inference leads to a very broad class of ‘proto-probability’ functions.     

What makes us believe a conditional? The roles of covariation and causality

Two experiments were conducted to investigate the roles of covariation and of causality in people's readiness to believe a conditional. The experiments used a probabilistic truth-table task (Oberauer & Wilhelm, 2003 Oberauer, K. and Wilhelm, O. 2003. The meaning(s) of conditionals: Conditional probabilities, mental models, and personal utilities. Journal of Experimental Psychology: Learning, Memory & Cognition, 29: 680–693. [Crossref], [PubMed], [Web of Science ®] , [Google Scholar]) in which people estimated the probability of a conditional given information about the frequency distribution of truth-table cases. For one group of people, belief in the conditional was determined by the conditional probability of the consequent, given the antecedent, whereas for another group it depended on the probability of the conjunction of antecedent and consequent. There was little evidence that covariation, expressed as the probabilistic contrast or as the pCI rule (White, 2003 White, P. A. 2003. Making causal judgements from the proportion of confirming instances: The pCI rule. Journal of Experimental Psychology: Learning, Memory, and Cognition, 29: 710–727.  [Google Scholar]), influences belief in the conditional. The explicit presence of a causal link between antecedent and consequent in a context story had a weak positive effect on belief in a conditional when the frequency distribution of relevant cases was held constant.     

Conditionals and monotonic belief revisions: the success postulate

One of the main applications of the logic of theory change is to the epistemic analysis of conditionals via the so-called Ramsey test. In the first part of the present note this test is studied in the limiting case where the theory being revised is inconsistent, and it is shown that this case manifests an intrinsic incompatibility between the Ramsey test and the AGM postulate of success. The paper then analyses the use of the postulate of success, and a weakening of it, generating axioms of conditional logic via the test, and it is shown that for certain purposes both success and weak success are quite superfluous. This suggests the proposal of abandoning both success and weak success entirely, thus permitting retention of the postulate of preservation discarded by Gärdenfors.     

A Theory of Belief for Scientific Refutations

A probability function on an algebra of events is assumed. Some of the events are scientific refutations in the sense that the assumption of their occurrence leads to a contradiction. It is shown that the scientific refutations form a a boolean sublattice in terms of the subset ordering. In general, the restriction of to the sublattice is not a probability function on the sublattice. It does, however, have many interesting properties. In particular, (i) it captures probabilistic ideas inherent in some legal procedures; and (ii) it is used to argue against the commonly held view that behavioral violations of certain basic conditions for qualitative probability are indicative of irrationality. Also discussed are (iii) the relationship between the formal development of scientific refutations presented here and intuitionistic logic, and (iv) an interpretation of a belief function used in the behavioral sciences to explain empirical results about subjective, probabilistic estimation, including the Ellsberg paradox.