Are counterfactuals with true antecedents and consequents trivially true? The principle of Conjunction Conditionalization →) is highly controversial. Many philosophers view it as an attractive feature of Lewis’s semantics for counterfactuals that it can easily be modified to avoid this principle. However, Walters and Williams beg to differ. They argue that Conjunction Conditionalization is an indispensable ingredient of any Lewisian semantics, since CC is entailed by standard Lewisian theorems and a plausible semantic claim about irrelevant semifactuals. If this is true, (...) the entire tradition of revisionist counterfactual semantics is misguided, and so are many philosophical theories in which counterfactuals play a role. We argue, in defense of the revisionist tradition, that Walters and Williams’ ‘plausible semantic claim’ is in fact anything but plausible. It turns out to entail semantic principles far more controversial than Conjunction Conditionalization. (shrink)

The standard semantics for counterfactuals ensures that any counterfactual with a true antecedent and true consequent is itself true. There have been many recent attempts to amend the standard semantics to avoid this result. I show that these proposals invalidate a number of further principles of the standard logic of counterfactuals. The case against the automatic truth of counterfactuals with true components does not extend to these further principles, however, so it is not clear that rejecting the latter should be (...) a consequence of rejecting the former. Instead I consider how one might defuse putative counterexamples to the truth of true-true counterfactuals. (shrink)

This paper advances the debate over the question whether false beliefs may nevertheless have warrant, the property that yields knowledge when conjoined with true belief. The paper’s first main part—which spans Sections 2–4—assesses the best argument for Warrant Infallibilism, the view that only true beliefs can have warrant. I show that this argument’s key premise conflicts with an extremely plausible claim about warrant. Sections 5–6 constitute the paper’s second main part. Section 5 presents an overlooked puzzle about warrant, and uses (...) that puzzle to generate a new argument for Warrant Fallibilism, the view that false beliefs can have warrant. Section 6 evaluates this pro-Fallibilism argument, finding ultimately that it defeats itself in a surprising way. I conclude that neither Infallibilism nor Fallibilism should now constrain theorizing about warrant. (shrink)

The standard Lewis–Stalnaker semantics of counterfactuals, given the Strong Centering Thesis, implies that all true–true counterfactuals are trivially true. McGlynn developed a theory, based on Penczek, to rehabilitate the non-triviality of true–true counterfactuals. I show here that counterfactuals with true but irrelevant components are counterexamples to McGlynn’s account. I argue that an extended version of the connection hypothesis is sustainable, and grounds a full theory of counterfactuals explicable in a broadly standard way, if an indispensable asymmetry between semifacuals and other (...) counterfactuals is acknowledged. (shrink)

Are counterfactuals with true antecedents and consequents automatically true? That is, is Conjunction Conditionalization: if (X & Y), then (X > Y) valid? Stalnaker and Lewis think so, but many others disagree. We note here that the extant arguments for Conjunction Conditionalization are unpersuasive, before presenting a family of more compelling arguments. These arguments rely on some standard theorems of the logic of counterfactuals as well as a plausible and popular semantic claim about certain semifactuals. Denying Conjunction Conditionalization, then, requires (...) rejecting other aspects of the standard logic of counterfactuals, or else our intuitive picture of semifactuals. (shrink)

Early commentators on David Lewis's account of counterfactuals noted that certain examples suggest that some counterfactuals with true antecedents and true consequents are false. Lewis's account has the consequence that all such counterfactuals are true, leaving us to choose between explaining away our intuitions about the examples in question or offering an alternative to Lewis's account. Here I argue that a simple modification of the familiar Lewisian truth conditions yields the intuitively correct verdicts about these examples, and so we can (...) take our intuitions about these examples at face value without any major departure from Lewis's approach to counterfactuals. (shrink)

A number of recent authors (Galles and Pearl, Found Sci 3 (1):151–182, 1998; Hiddleston, Noûs 39 (4):232–257, 2005; Halpern, J Artif Intell Res 12:317–337, 2000) advocate a causal modeling semantics for counterfactuals. But the precise logical significance of the causal modeling semantics remains murky. Particularly important, yet particularly under-explored, is its relationship to the similarity-based semantics for counterfactuals developed by Lewis (Counterfactuals. Harvard University Press, 1973b). The causal modeling semantics is both an account of the truth conditions of counterfactuals, and (...) an account of which inferences involving counterfactuals are valid. As an account of truth conditions, it is incomplete. While Lewis's similarity semantics lets us evaluate counterfactuals with arbitrarily complex antecedents and consequents, the causal modeling semantics makes it hard to ascertain the truth conditions of all but a highly restricted class of counterfactuals. I explain how to extend the causal modeling language to encompass a wider range of sentences, and provide a sound and complete axiomatization for the extended language. Extending the truth conditions for counterfactuals has serious consequences concerning valid inference. The extended language is unlike any logic of Lewis's: modus ponens is invalid, and classical logical equivalents cannot be freely substituted in the antecedents of conditionals. (shrink)

According to the Simple Conditional Analysis of disposition ascriptions, disposition ascriptions are to be analyzed in terms of counterfactual conditionals. The Simple Conditional Analysis is notoriously vulnerable to counterexamples. In this paper, I introduce a new sort of counterexample to the Simple Conditional Analysis of disposition ascriptions, which I call ‘tricks’. I then explore a number of possible strategies to modify the Simple Conditional Analysis so as to avoid tricks and conclude that, in order to avoid tricks, the associated counterfactual (...) should be evaluated at the closest possible world at which the manifestation of the disposition does not obtain. (shrink)

Many have accepted that ordinary counterfactuals and might counterfactuals are duals. In this paper, I show that this thesis leads to paradoxical results when combined with a few different unorthodox yet increasingly popular theses, including the thesis that counterfactuals are strict conditionals. Given Duality and several other theses, we can quickly infer the validity of another paradoxical principle, ‘The Counterfactual Direct Argument’, which says that ‘A> ’ entails ‘A> ’. First, I provide a collapse theorem for the ‘counterfactual direct argument’. (...) The counterfactual direct argument entails the logical equivalence of the subjunctive and material conditional, given a variety of assumptions. Second, I provide a semantics that validates the counterfactual direct argument without collapse. This theory further develops extant dynamic accounts of conditionals. I give a new semantics for disjunction, on which A or B is only true in a context when A and B are both unsettled. The resulting framework validates CDA while invalidating other commonly accepted principles concerning the conditional and disjunction. (shrink)

In this note I discuss what seems to be a new kind of counterexample to Lewis’s account of counterfactuals. A coin is to be tossed twice. I bet on ‘Two heads’, and I win. Common sense says that (1) is false. But Lewis’s theory says that it is true. (1) If at least one head had come up, I would have won.

In a recent paper Lee Walters criticizes a number of philosophers – including Gundersen – for committing a ‘failure in the argumentative strategy’ when they attempt to amend the standard Lewis semantics for counterfactuals in order to avoid the so‐called principle of Conjunction Conditionalization. In this article we defend a Gundersen‐style probability‐based semantics against Walter's major misgivings: that it is not logically conservative, that it is committed to the Connection Hypothesis, and that it cannot deal satisfactory with irrelevant semi‐factuals.

Standard accounts of semantics for counterfactuals confront the true–true problem: when the antecedent and consequent of a counterfactual are both actually true, the counterfactual is automatically true. This problem presents a challenge to safety-based accounts of knowledge. In this paper, drawing on work by Angelika Kratzer, Alan Penczek, and Duncan Pritchard, we propose a revised understanding of semantics for counterfactuals utilizing machinery from generalized quantifier theory which enables safety theorists to meet the challenge of the true–true problem.