Indicative Conditionals and Conditional Probabilities

We will look at several theories of indicative conditionals grouped into three categories: those that base its semantics on its logical counterpart (the material conditional); intensional analyses, which bring in alternative possible worlds; and a third subgroup which denies that indicative conditionals express propositions at all. We will also look at some problems for each kind of approach.

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...

The truth functional account of conditional statements ‘if A then B’ is not only inadequate; it eliminates the very conditionality expressed by ‘if’. Focusing only on the truth-values of the statements ‘A’ and ‘B’ and different combinations of these, one is bound to miss out on the conditional relation expressed between them. All approaches that treat conditionals as functions of their antecedents and consequents will end up in some sort of logical atomism where causal matters simply are reduced to the (...) joint occurrence of A and B. (shrink)

It is now well known that, on pain of triviality, the probability of a conditional cannot be identified with the corresponding conditional probability [27]. This surprising impossibility result has a qualitative counterpart. In fact, Peter Gardenfors showed in [13] that believing 'If A then B' cannot be equated with the act of believing B on the supposition that A.

Recent work has shown that in spite of these negative results, the question 'how to accept a conditional?' has a clear answer. Even if conditionals are not truth-carriers, they do have precise acceptability conditions. Nevertheless most epistemic models of conditionals do not provide acceptance conditions for iterated conditionals. One of the main goals of this essay is to provide a comprehensive account of the notion of epistemic conditionality covering all forms of iteration.

It is now well known that, on pain of triviality, the probability of a conditional cannot be identified with the corresponding conditional probability [25]. This surprising impossibility result has a qualitative counterpart. In fact, Peter Gärdenfors showed in [13] that believing ‘If A then B’ cannot be equated with the act of believing B on the supposition that A — as long as supposing obeys minimal Bayesian constraints. Recent work has shown that in spite of these negative results, the question (...) ‘how to accept a conditional?’ has a clear answer. Even if conditionals are not truth-carriers, they do have precise acceptability conditions. Nevertheless most epistemic models of conditionals do not provide acceptance conditions for iterated conditionals. One of the main goals of this essay is to provide a comprehensive account of the notion of epistemic conditionality covering all forms of iteration. First we propose an account of the basic idea of epistemic conditionality, by studying the conditionals validated by epistemic models where iteration is permitted but not constrained by special axioms. Our modeling does not presuppose that epistemic states should be represented by belief sets (we only assume that to each epistemic state corresponds an associated belief state). A full encoding of the basic epistemic conditionals (encompassing all forms of iteration) is presented and a representation result is proved. In the second part of the essay we argue that the notion of change involved in the evaluation of conditionals is suppositional, and that such notion should be distinguished from the notion of updating (modelled by AGM and other methods). We conclude by considering how some of the recent modellings of iterated change fare as methods for iterated supposing. (shrink)

Numerous triviality results have been directed at a collection of views that tie the probability of a conditional sentence to the conditional probability of the consequent on its antecedent. -/- In this paper I argue that this identification makes little sense if conditional sentences are context sensitive. The best alternative, I argue, is a version of the thesis which states that if your total evidence is E then the evidential probability of a conditional evaluated in a context where E is (...) salient is the probability of the consequent given the antecedent. The biggest challenge to this thesis comes from the 'static' triviality arguments developed by Stalnaker, Hajek and Hall. It is argued that these arguments rely on invalid principles of conditional logic and that the thesis is consistent with a reasonably strong logic that does not include the principles in question. (shrink)

In this paper I present a precise version of Stalnaker's thesis and show that it is both consistent and predicts our intuitive judgments about the probabilities of conditionals. The thesis states that someone whose total evidence is E should have the same credence in the proposition expressed by 'if A then B' in a context where E is salient as they have conditional credence in the proposition B expresses given the proposition A expresses in that context. The thesis is formalised (...) rigorously and two models are provided that demonstrate that the new thesis is indeed tenable within a standard possible world semantics based on selection functions. Unlike the Stalnaker-Lewis semantics the selection functions cannot be understood in terms of similarity. A probabilistic account of selection is defended in its place. -/- I end the paper by suggesting that this approach overcomes some of the objections often leveled at accounts of indicatives based on the notion of similarity. (shrink)

We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary right-nested conditionals. We show that problem of determining acceptance of any such nested conditional can be reduced (...) to acceptance tests for unnested conditionals. Thus, iterated revision can be accomplished in a "virtual" manner, using uniterated revision. (shrink)

Adams’s Thesis, the claim that the probabilities of indicative conditionals equal the conditional probabilities of their consequents given their antecedents, has proven impossible to accommodate within orthodox possible-world semantics. This essay proposes a modification to the orthodoxy that removes this impossibility. The starting point is a proposal by Jeffrey and Stalnaker that conditionals take semantic values in the unit interval, interpreting these (à la McGee) as their expected truth-values at a world. Their theories imply a false principle, namely, that the (...) probability of a conditional is independent of any proposition inconsistent with its antecedent. But they also point to something important, namely, that our uncertainty about conditionals is not confined to uncertainty about the facts (what the actual world is like) but also expresses uncertainty about the counterfacts (what the world would be like if one or another supposition were true). To capture this observation, this essay proposes that the semantic contents of conditionals be treated as sets of vectors of possible worlds, not singleton worlds, with the coordinates of each specifying the world that is or would be true under the supposition that it represents. The probabilities of truth for conditionals will then depend on the joint probabilities of the facts and counterfacts, the latter in turn depending on the mode of supposition. The implication of this treatment is that the probabilities of conditionals are conditional probabilities whenever the mode of supposition is evidential. (shrink)

Adams' famous thesis that the probabilities of conditionals are conditional probabilities is incompatible with standard probability theory. Indeed it is incompatible with any system of monotonic conditional probability satisfying the usual multiplication rule for conditional probabilities. This paper explores the possibility of accommodating Adams' thesis in systems of non-monotonic probability of varying strength. It shows that such systems impose many familiar lattice theoretic properties on their models as well as yielding interesting logics of conditionals, but that a standard complementation operation (...) cannot be defined within them, on pain of collapsing probability into bivalence. (shrink)

Adams Thesis has much evidence in its favour, but David Lewis famously showed that it cannot be true, in all but the most trivial of cases, if conditionals are proprositions and their probabilities are classical probabilities of truth. In this paper I show thatsimilar results can be constructed for a much wider class of conditionals. The fact that these results presuppose that the logic of conditionals is Boolean motivates a search for a non-Boolean alternative. It is argued that the exact (...) proposition expressed by a conditional depends on the context in which it is uttered. Consequentlyits probability of truth will depend not only on the probabilities of the various propositions it might express, but also on the probabilities of the contexts determining which proposition it does in fact express.The semantic theory developed from this is then shown to explain why agents degrees of belief satisfyAdams Thesis. Finally the theory is compared with proposals for a three-valued logic of conditionals. (shrink)

In this paper Richard Jeffrey's 'Logic of Decision' is extended by examination of agents' attitudes to the sorts of possibilities identified by indicative conditional sentences. An expression for the desirability of conditionals is proposed and, along with Adams' thesis that the probability of a conditional equals the conditional probability of its antecedent given its consequent, is defended by informally deriving it from Jeffrey's notion of desirability and some weak constraints on rational preference for conditional possibilities. Finally a statement is given (...) of a representation theorem establishing the conditions under which a rational agent's preferences for conditionals determines the existence of unique measures (up to choice of scale) of her degrees of belief and desire. (shrink)

This paper uses the framework of Popper and Miller's work on axiom systems for conditional probabilities to explore Adams' thesis concerning the probabilities of conditionals. It is shown that even very weak axiom systems have only a very restricted set of models satisfying a natural generalisation of Adams' thesis, thereby casting severe doubt on the possibility of developing a non-Boolean semantics for conditionals consistent with it.

This dissertation interprets the lack of uniqueness in probability representations of agents' degrees of belief in the decision theory of Richard Jeffrey as a formal statement of an important epistemological problem: the underdetermination of our attributions of belief and desire to agents by the evidence of their observed behaviour. A solution is pursued through investigation of agents' attitudes to information of a conditional nature. ;As a first step, Jeffrey's theory is extended to agents' conditional attitudes of belief and desire by (...) introduction of a definition of conditional desirability. The second step is an analysis of agents' attitudes to conditionals. Following Adams it is argued that the probability of a conditional is the conditional probability of its consequent given the antecedent. Since numerous 'trivialization' results show that no proposition could be such that this were the case, it is proposed that conditionals express a variable proposition as a function of the context in which they are asserted. The consequent technical treatment of conditionals as proposition-valued functions of sets of possible worlds delivers Adams' thesis as a natural consequence without fear of trivialization. ;Conditionals are the underlying objects of the decision theory that is presented in the final chapter. A representation theorem is proven for preferences defined over sets of such conditionals satisfying certain closure conditions, where an agent is understood to prefer one conditional over another just in case she prefers that the former by true rather than the latter. The theorem establishes that a rational preference ranking of conditionals implies the existence of a unique probability function and a desirability function unique up to choice of scale, that agree with the preference ranking, and that these functions satisfy both the axioms of Jeffrey's decision calculus and Adams' thesis. The theorem is interpreted as saying that elicitation of an agent's choices amongst conditional options suffices to determine our attributions of belief and desire to them. (shrink)

The sum, difference, product and quotient of two functions with different domains are usually defined only on their common domain. This paper extends these definitions so that the sum and other operations are essentially defined anywhere that at least one of the components is defined. This idea is applied to propositions and events, expressed as indicator functions, to define conditional propositions and conditional events as three-valued indicator functions that are undefined when their condition is false. Extended operations of "and", "or", (...) "not" and "conditioning" are then defined on these conditional events with variable conditions. The probabilities of the disjunction and of the conjunction of two conditionals are expressed in terms of the conditional probabilities of the component conditionals. In a special case, these are shown to be weighted averages of the component conditional probabilities where the weights are the relative probabilities of the various conditions. Next, conditional random variables are defined to be random variables X whose domain has been restricted by a condition on a second random variable Y. The extended sum, difference, product and conditioning operations on functions are then applied to these conditional random variables. The expectation of a random variable and the conditional expectation of a conditional random variable are recounted. Theorem 1 generalizes the standard result that the conditional expectation of the sum of two conditional random variables with disjoint and exhaustive conditions is a weighted sum of the conditional expectations of the component conditional random variables. Because of the extended operations, the theorem is true for arbitrary conditions. Theorem 2 gives a formula for the expectation of the product of two conditional random variables. After the definition of independence of two random variables is extended to accommodate the extended operations, it is applied to the formula of Theorem 2 to simplify the expectation of a product of conditional random variables. Two examples end the paper. The first concerns a work force of n workers of different output levels and work shifts. The second example involves two radars with overlapping surveillance regions and different detection error rates. One radar's error rate is assumed to be sensitive to fog and the other radar's error rate is assumed to be sensitive to air traffic density. The combined error rate over the combined surveillance region given heavy fog and moderate air traffic is computed. (shrink)

This paper motivates and develops a novel semantic framework for deontic modals. The framework is designed to shed light on two things: the relationship between deontic modals and substantive theories of practical rationality and the interaction of deontic modals with conditionals, epistemic modals and probability operators. I argue that, in order to model inferential connections between deontic modals and probability operators, we need more structure than is provided by classical intensional theories. In particular, we need probabilistic structure that interacts directly (...) with the compositional semantics of deontic modals. However, I reject theories that provide this probabilistic structure by claiming that the semantics of deontic modals is linked to the Bayesian notion of expectation. I offer a probabilistic premise semantics that explains all the data that create trouble for the rival theories. (shrink)

Kratzer semantics for modals and conditionals generates the prediction that sentences of the form if p, ought p are trivially true. As Frank and Zvolenszky show, for certain flavors of modality, like deontic modality, this prediction is false. I explain some conservative solutions to the problem, and then argue that they are inadequate to account for puzzle cases involving self-frustrating oughts. These cases illustrate a general problem: there are two forms of information-sensitivity in deontic modals. Even generalizations of Kratzer semantics (...) that predict these two roles for information, e.g. Kolodny and MacFarlane, predict that they vary together. I propose a generalization of Kratzer semantics that allows the two roles for information to vary independently of each other. (shrink)

I present two Triviality results for Kratzer's standard “restrictor” analysis of indicative conditionals. I both refine and undermine the common claim that problems of Triviality do not arise for Kratzer conditionals since they are not strictly conditionals at all.

: The two main psychological theories of the ordinary conditional were designed to account for inferences made from assumptions, but few premises in everyday life can be simply assumed true. Useful premises usually have a probability that is less than certainty. But what is the probability of the ordinary conditional and how is it determined? We argue that people use a two stage Ramsey test that we specify to make probability judgements about indicative conditionals in natural language, and we describe (...) experiments that support this conclusion. Our account can explain why most people give the conditional probability as the probability of the conditional, but also why some give the conjunctive probability. We discuss how our psychological work is related to the analysis of ordinary indicative conditionals in philosophical logic. (shrink)

Adams famously suggested that the acceptability of any indicative conditional whose antecedent and consequent are both factive sentences amounts to the subjective conditional probability of the consequent given the antecedent. The received view has it that this thesis offers an adequate partial explication of Ramsey’s test, which characterizes graded acceptability for conditionals in terms of hypothetical updates on the antecedent. Some results in van Fraassen may raise hope that this explicatory approach to Ramsey’s test is extendible to left-nested conditionals, that (...) is, conditionals whose antecedent is itself conditional in form. We argue that this interpretation of van Fraassen’s results is to be rejected. Specifically, we provide an argument from material inadequacy against a generalization of Adams’ thesis for left-nested conditionals. (shrink)

In a series of articles, David Barnett (2006, 2009, 2010) has developed a general theory of conditionals. The grand aim is to reconcile the two main rivals: a suppositional and a truth-conditional view (Barnett 2006, 521). While I confine my critical discussion to counterfactuals, I will give some hints how they might spell trouble for his suppositional view in general.

I take issue with two claims of DeRose: Conditionals of deliberation must not depend on backtracking grounds. ‘Were’ed-up conditionals coincide with future-directed indicative conditionals; the only difference in their meaning is that they must not depend on backtracking grounds. I use Egan’s counterexamples to causal decision theory to contest the first and an example of backtracking reasoning by David Lewis to contest the second claim. I tentatively outline a rivaling account of ‘were’ed-up conditionals which combines features of the standard analysis (...) of counterfactuals with the contextual relevance of the corresponding indicative conditionals. (shrink)

KK is the thesis that if you can know p, you can know that you can know p. Though it’s unpopular, a flurry of considerations have recently emerged in its favor. Here we add fuel to the fire: standard resources allow us to show that any failure of KK will lead to the knowability and assertability of abominable indicative conditionals of the form, ‘If I don’t know it, p.’ Such conditionals are manifestly not assertable—a fact that KK defenders can easily (...) explain. I survey a variety of KK-denying responses and find them wanting. Those who object to the knowability of such conditionals must either (i) deny the possibility of harmony between knowledge and belief, or (ii) deny well-supported connections between conditional and unconditional attitudes. Meanwhile, those who grant knowability owe us an explanation of such conditionals’ unassertability—yet no successful explanations are on offer. Upshot: we have new evidence for KK. (shrink)

Kaufmann has recently argued that the thesis according to which the probability of an indicative conditional equals the conditional probability of the consequent given the antecedent under certain specifiable circumstances deviates from intuition. He presents a method for calculating the probability of a conditional that does seem to give the intuitively correct result under those circumstances. However, the present paper shows that Kaufmann’s method is inconsistent in that it may lead one to assign different probabilities to a single conditional at (...) the same time. (shrink)

Bradley has argued that a truth-conditional semantics for conditionals is incompatible with an allegedly very weak and intuitively compelling constraint on the interpretation of conditionals. I argue that the example Bradley offers to motivate this constraint can be explained along pragmatic lines that are compatible with the correctness of at least one popular truth-conditional semantics for conditionals.

According to what is now commonly referred to as “the Equation” in the literature on indicative conditionals, the probability of any indicative conditional equals the probability of its consequent of the conditional given the antecedent of the conditional. Philosophers widely agree in their assessment that the triviality arguments of Lewis and others have conclusively shown the Equation to be tenable only at the expense of the view that indicative conditionals express propositions. This study challenges the correctness of that assessment by (...) presenting data that cast doubt on an assumption underlying all triviality arguments. (shrink)

Test for the rational acceptance of conditionals and it still incites much of the interest in conditional reasoning. For instance, the test has been considered as a good starting point for several formal semantics for conditionals. Furthermore, its ramifications have important implications for several disciplines, from logic and artificial intelligence to decision theory and psychology. This volume presents a small but fine sample of the state of the art of such multifarious area of research.

This collection of essays is on the relation between probabilities, especially conditional probabilities, and conditionals. It provides negative results which sharply limit the ways conditionals can be related to conditional probabilities. There are also positive ideas and results which will open up areas of research. The collection is intended to honour Ernest W. Adams, whose seminal work is largely responsible for creating this area of inquiry. As well as describing, evaluating, and applying Adams's work the contributions extend his ideas in (...) directions he may or may not have anticipated, but that he certainly inspired. In addition to a wide range of philosophers of science, the volume should interest computer scientists and linguists. (shrink)

I defend a formulation of the Ramsey Test with a condition for accepting negations of conditionals. It is implicit in the assumptions of the triviality theorems of Gärdenfors, Harper, and Lewis; and it allows for a unified proof of those theorems, from weaker assumptions about belief revision. This leads to a proof of McGee’s thesis that iterated conditionals do not obey modus ponens. †To contact the author, please write to: Institute of Philosophy, University of Leuven, Kardinaal Mercierplein 2, B‐3000 Leuven, (...) Belgium; e‐mail: etlin@alum.mit.edu. (shrink)