Wierenga on theism and counterpossibles

Several theists, including Linda Zagzebski, have claimed that theism is somehow committed to nonvacuism about counterpossibles. Even though Zagzebski herself has rejected vacuism, she has offered an argument in favour of it, which Edward Wierenga has defended as providing strong support for vacuism that is independent of the orthodox semantics for counterfactuals, mainly developed by David Lewis and Robert Stalnaker. In this paper I show that argument to be sound only relative to the orthodox semantics, which entails vacuism, and give an example of a semantics for counterfactuals countenancing impossible worlds for which it fails

Impossibility and Impossible Worlds

Possible worlds have found many applications in contemporary philosophy: from theories of possibility and necessity, to accounts of conditionals, to theories of mental and linguistic content, to understanding supervenience relationships, to theories of properties and propositions, among many other applications. Almost as soon as possible worlds started to be used in formal theories in logic, philosophy of language, philosophy of mind, metaphysics, and elsewhere, theorists started to wonder whether impossible worlds should be postulated as well. In many applications, possible worlds face limitations that can be dealt with through postulating impossible worlds as well. This chapter examines some of the uses of impossible worlds, and philosophical challenges theories of impossible worlds face

What if God commanded something horrible? A pragmatics-based defence of divine command metaethics

The objection of horrible commands claims that divine command metaethics is doomed to failure because it is committed to the extremely counterintuitive assumption that torture of innocents, rape, and murder would be morally obligatory if God commanded these acts. Morriston, Wielenberg, and Sinnott-Armstrong have argued that formulating this objection in terms of counterpossibles is particularly forceful because it cannot be simply evaded by insisting on God’s necessary perfect moral goodness. I show that divine command metaethics can be defended even against this counterpossible version of the objection of horrible commands because we can explain the truth-value intuitions about the disputed counterpossibles as the result of conversational implicatures. Furthermore, I show that this pragmatics-based defence of divine command metaethics has several advantages over Pruss’s reductio counterargument against the counterpossible version of the objection of horrible commands

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

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

The End of Mystery

Tim travels back in time and tries to kill his grandfather before his father was born. Tim fails. But why? Lewis's response was to cite "coincidences": Tim is the unlucky subject of gun jammings, banana peels, sudden changes of heart, and so on. A number of challenges have been raised against Lewis's response. The latest of these focuses on explanation. This paper diagnoses the source of this new disgruntlement and offers an alternative explanation for Tim's failure, one that Lewis would not have liked. The explanation is an obvious one but controversial, so it is defended against all the objections that can be mustered

Higher-order knowledge and sensitivity

It has recently been argued that a sensitivity theory of knowledge cannot account for intuitively appealing instances of higher-order knowledge. In this paper, we argue that it can once careful attention is paid to the methods or processes by which we typically form higher-order beliefs. We base our argument on what we take to be a well-motivated and commonsensical view on how higher-order knowledge is typically acquired, and we show how higher-order knowledge is possible in a sensitivity theory once this view is adopted

Counterpossibles in Science: The Case of Relative Computability

I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models

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

The Necessity of Mathematics

Some have argued for a division of epistemic labor in which mathematicians supply truths and philosophers supply their necessity. We argue that this is wrong: mathematics is committed to its own necessity. Counterfactuals play a starring role