10.12.2012 Views

Online Papers - Brian Weatherson

Online Papers - Brian Weatherson

Online Papers - Brian Weatherson

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

David Lewis 57<br />

part of natural language and it is philosophically interesting to figure out how they<br />

work. But counterfactuals would play a large role in Lewis’s metaphysics. Many of<br />

Lewis’s attempted reductions of nomic or mental concepts would be either directly<br />

in terms of counterfactuals, or in terms of concepts (such as causation) that he in turn<br />

defined in terms of counterfactuals. And the analysis of counterfactuals, which uses<br />

possible worlds, would in turn provide motivation for believing in possible worlds.<br />

We will look at these two metaphysical motivations in more detail in section 4, where<br />

we discuss the relationship between counterfactuals and laws, causation and other<br />

high-level concepts, and in section 5, where we discuss the motivations for Lewis’s<br />

modal metaphysics.<br />

3.1 Background<br />

To the extent that there was a mid-century orthodoxy about counterfactual conditionals,<br />

it was given by the proposal in Nelson Goodman (1955). Goodman proposed<br />

that counterfactual conditionals were a particular variety of strict conditional.<br />

To a first approximation, If it were the case that p, it would be the case that q (hereafter<br />

p � q) is true just in case Necessarily, either p is false or q is true, i.e. �(p ⊃<br />

q). Goodman realised that this wouldn’t work if the modal ‘necessarily’ was interpreted<br />

unrestrictedly. He first suggested that we needed to restrict attention to those<br />

possibilities where all facts ‘co-tenable’ with p were true. More formally, if S is the<br />

conjunction of all the co-tenable facts, then p � q is true iff �((p ∧ S) ⊃ q).<br />

Lewis argued that this could not be the correct set of truth conditions for p �<br />

q in general. His argument was that strict conditionals were in a certain sense indefeasible.<br />

If a strict conditional is true, then adding more conjuncts to the antecedent<br />

cannot make it false. But intuitively, adding conjuncts to the antecedent of a counterfactual<br />

can change it from being true to false. Indeed, intuitively we can have long<br />

sequences of counterfactuals of ever increasing strength in the antecedent, but with<br />

the same consequent, that alternate in truth value. So we can imagine that (3.1) and<br />

(3.3) are true, while (3.2) and (3.4) are false.<br />

(3.1) If Smith gets the most votes, he will be the next mayor.<br />

(3.2) If Smith gets the most votes but is disqualified due to electoral fraud, he will be<br />

the next mayor.<br />

(3.3) If Smith gets the most votes, but is disqualified due to electoral fraud, then<br />

launches a military coup that overtakes the city government, he will be the<br />

next mayor.<br />

(3.4) If Smith gets the most votes, but is disqualified due to electoral fraud, then<br />

launches a military coup that overtakes the city government, but dies during<br />

the coup, he will be the next mayor.<br />

If we are to regard p � q as true iff �((p ∧ S) ⊃ q), then the S must vary for<br />

different values of p. More seriously, we have to say something about how S varies<br />

with variation in p. Goodman’s own attempts to resolve this problem had generally<br />

been regarded as unsuccessful, for reasons discussed in Bennett (1984). So a new<br />

solution was needed.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!