On the Substitution of Identicals in Counterfactual Reasoning

It is widely held that counterfactuals, unlike attitude ascriptions, preserve the referential transparency of their constituents, i.e., that counterfactuals validate the substitution of identicals when their constituents do. The only putative counterexamples in the literature come from counterpossibles, i.e., counterfactuals with impossible antecedents. Advocates of counterpossibilism, i.e., the view that counterpossibles are not all vacuous, argue that counterpossibles can generate referential opacity. But in order to explain why most substitution inferences into counterfactuals seem valid, counterpossibilists also often maintain that counterfactuals with possible antecedents are transparency‐preserving. I argue that if counterpossibles can generate opacity, then so can ordinary counterfactuals with possible antecedents. Utilizing an analogy between counterfactuals and attitude ascriptions, I provide a counterpossibilist‐friendly explanation for the apparent validity of substitution inferences into counterfactuals. I conclude by suggesting that the debate over counterpossibles is closely tied to questions concerning the extent to which counterfactuals are more like attitude ascriptions and epistemic operators than previously recognized

Counterfactual Logic and the Necessity of Mathematics

This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A were true then C would be true’ to ‘If A and B were true then C would be true’—which many reject. Second, the system they develop is provably equivalent to appending Deduction Theorem to a T modal logic. It is unsurprising that the combination of Deduction Theorem with T results in necessitation; indeed, it is precisely for this reason that many logicians reject Deduction Theorem in modal contexts. If Deduction Theorem is unacceptable for modal logic, it cannot be assumed to derive the necessity of mathematic

Counteridenticals

A counteridentical is a counterfactual with an identity statement in the antecedent. While counteridenticals generally seem non-trivial, most semantic theories for counterfactuals, when combined with the necessity of identity and distinctness, attribute vacuous truth conditions to such counterfactuals. In light of this, one could try to save the orthodox theories either by appealing to pragmatics or by denying that the antecedents of alleged counteridenticals really contain identity claims. Or one could reject the orthodox theory of counterfactuals in favor of a hyperintensional semantics that accommodates non-trivial counterpossibles. In this paper, I argue that none of these approaches can account for all the peculiar features of counteridenticals. Instead, I propose a modified version of Lewis’s counterpart theory, which rejects the necessity of identity, and show that it can explain all the peculiar features of counteridenticals in a satisfactory way. I conclude by defending the plausibility of contingent identity from objections

How Strong Is a Counterfactual?

The literature on counterfactuals is dominated by strict accounts and variably strict accounts. Counterexamples to the principle of Antecedent Strengthening were thought to be fatal to SA; but it has been shown that by adding dynamic resources to the view, such examples can be accounted for. We broaden the debate between VSA and SA by focusing on a new strengthening principle, Strengthening with a Possibility. We show dynamic SA classically validates this principle. We give a counterexample to it and show that extra dynamic resources cannot help SA. We then show VSA accounts for the counterexample if it allows for orderings on worlds that are not almost-connected, and that such an ordering naturally falls out of a Kratzerian ordering source semantics. We conclude that the failure of Strengthening with a Possibility tells strongly against Dynamic SA and in favor of an ordering source-based version of VSA

Counterfactuals without Possible Worlds? A Difficulty for Fine’s Exact Semantics for Counterfactuals

In this paper I argue that there is a difficulty for Fine's exact semantics for counterfactuals. The difficulty undermines Fine's reasons for preferring exact semantics to possible worlds semantics

Morgenbesser's Coin and Counterfactuals with True Components

Is A & C sufficient for the truth of ‘if A were the case, C would be the case’? Jonathan Bennett thinks not, although the counterexample he gives is inconsistent with his own account of counterfactuals. In any case, I argue that anyone who accepts the case of Morgenbesser's coin, as Bennett does, should reject Bennett’s counterexample. Moreover, I show that the principle underlying his counterexample is unmotivated and indeed false. More generally, I argue that Morgenbesser’s coin commits us to the sufficiency of A & C for the truth of the corresponding counterfactual

Counterfactuals as Strict Conditionals

This paper defends the thesis that counterfactuals are strict conditionals. Its purpose is to show that there is a coherent view according to which counterfactuals are strict conditionals whose antecedent is stated elliptically. Section 1 introduces the view. Section 2 outlines a response to the main argument against the thesis that counterfactuals are strict conditionals. Section 3 compares the view with a proposal due to Aqvist, which may be regarded as its direct predecessor. Sections 4 and 5 explain how the view diers from the theories of counterfactuals advocated by Stalnaker and Lewis, and from some contextualist strict conditional accounts of counterfactuals that have emerged recently. Finally, section 6 addresses the thorny issue of disjunctive antecedents

Conditional Heresies

Philosophy and Phenomenological Research, EarlyView

If P, Then P!

The Identity principle says that conditionals with the form 'If p, then p' are logical truths. Identity is overwhelmingly plausible, and has rarely been explicitly challenged. But a wide range of conditionals nonetheless invalidate it. I explain the problem, and argue that the culprit is the principle known as Import-Export, which we must thus reject. I then explore how we can reject Import-Export in a way that still makes sense of the intuitions that support it, arguing that the differences between indicative and subjunctive conditionals play a key role in solving this puzzle