The article offers a rigorous truth condition for subjunctively conditional statements. The theory is framed in the system of transparent intensional logic and takes connections (especially the cause-Effect relation) as basic. Counterexamples are given to rival theories based on the notion of world similarity.

The aim of the paper is to draw a connection between a semantical theory of conditional statements and the theory of conditional probability. First, the probability calculus is interpreted as a semantics for truth functional logic. Absolute probabilities are treated as degrees of rational belief. Conditional probabilities are explicitly defined in terms of absolute probabilities in the familiar way. Second, the probability calculus is extended in order to provide an interpretation for counterfactual probabilities--conditional probabilities where the condition has zero probability. (...) Third, conditional propositions are introduced as propositions whose absolute probability is equal to the conditional probability of the consequent on the antecedent. An axiom system for this conditional connective is recovered from the probabilistic definition. Finally, the primary semantics for this axiom system, presented elsewhere, is related to the probabilistic interpretation. (shrink)

Conditionals give rise to stand-offs that have become well known from Gibbard’s initial Sly Pete example. The stand-offs can be seen as evidence for the context-sensitivity of conditionals and arguably do not involve disagreement. I claim that the latter feature lends credibility to an indexical treatment of indicatives.

How should a group with different opinions (but the same values) make decisions? In a Bayesian setting, the natural question is how to aggregate credences: how to use a single credence function to naturally represent a collection of different credence functions. An extension of the standard Dutch-book arguments that apply to individual decision-makers recommends that group credences should be updated by conditionalization. This imposes a constraint on what aggregation rules can be like. Taking conditionalization as a basic constraint, we gather (...) lessons from the established work on credence aggregation, and extend this work with two new impossibility results. We then explore contrasting features of two kinds of rules that satisfy the constraints we articulate: one kind uses fixed prior credences, and the other uses geometric averaging, as opposed to arithmetic averaging. We also prove a new characterisation result for geometric averaging. Finally we consider applications to neighboring philosophical issues, including the epistemology of disagreement. (shrink)

One very popular kind of semantics for subjunctive conditionals is aclosest-worlds account along the lines of theories given by David Lewisand Robert Stalnaker. If we could give the same sort of semantics forindicative conditionals, we would have a more unified account of themeaning of ``if ... then ...'' statements, one with manyadvantages for explaining the behaviour of conditional sentences. Such atreatment of indicative conditionals, however, has faced a battery ofobjections. This paper outlines a closest-worlds account of indicativeconditionals that does better (...) than some of its cousins in explaining thebehaviour of such conditionals. The paper then discusses objectionsoffered by Dorothy Edgington and Frank Jackson to closest-worldsaccounts of indicative conditionals, and shows that these objections canbe met by the account outlined. (shrink)

The fact that the standard probabilistic calculus does not define probabilities for sentences with embedded conditionals is a fundamental problem for the probabilistic theory of conditionals. Several authors have explored ways to assign probabilities to such sentences, but those proposals have come under criticism for making counterintuitive predictions. This paper examines the source of the problematic predictions and proposes an amendment which corrects them in a principled way. The account brings intuitions about counterfactual conditionals to bear on the interpretation of (...) indicatives and relies on the notion of causal (in)dependence. (shrink)

I present a puzzle concerning counterfactual reasoning and argue that it should be solved by giving up the principle of substitution for logical equivalents.

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)

This discussion note examines a recent argument for the principle that any counterfactual with true components is itself true. That argument rests upon two widely accepted principles of counterfactual logic to which the paper presents counterexamples. The conclusion speculates briefly upon the wider lessons that philosophers should draw from these examples for the semantics of counterfactuals.