Philosophy and Phenomenological Research, EarlyView.

The role of causation and counterfactuals in causal decision theory is vexed and disputed. Recently, Brian Hedden (2023) argues that we should abandon causal decision theory in favour of an alternative: counterfactual decision theory. I argue that, pace Hedden, counterfactual decision theory is not a competitor to, but rather a version of, causal decision theory – the most popular version by far. I provide textual evidence that the founding fathers of causal decision theory (Stalnaker, Gibbard, Harper, Lewis, Skyrms, Sobel, and (...) Joyce) all endorse counterfactual decision theories. I additionally discuss why these theories came to be called ‘causal’, rather than ‘counterfactual’. And I argue that, properly understood, causal decision theory escapes Hedden's objections. (shrink)

If the laws are deterministic, then standard theories of counterfactuals are forced to reject at least one of the following conditionals: 1) had you chosen differently, there would not have been a violation of the laws of nature; and 2) had you chosen differently, the initial conditions of the universe would not have been different. On the relevant readings—where we hold fixed factors causally independent of your choice—both of these conditionals appear true. And rejecting either one leads to trouble for (...) philosophical theories which rely upon counterfactual conditionals—like, for instance, causal decision theory. Here, I outline a semantics for counterfactual conditionals which allows us to accept both (1) and (2). And I discuss how this semantics deals with objections to causal decision theory from Arif Ahmed. (shrink)

This paper develops a formal theory of non-monotonic consequence which differs from most extant theories in that it assumes Contraposition as a basic principle of defeasible reasoning. We define a minimal logic that combines Contraposition with three uncontroversial inference rules, and we prove some key results that characterize this logic and its possible extensions.

On the received view, counterfactuals are analysed using the concept of closeness between possible worlds: the counterfactual 'If it had been the case that p, then it would have been the case that q' is true at a world w just in case q is true at all the possible p-worlds closest to w. The degree of closeness between two worlds is usually thought to be determined by weighting different respects of similarity between them. The question I consider in the (...) paper is which weights attach to different respects of similarity. I start by considering Lewis's answer to the question and argue against it by presenting several counterexamples. I use the same examples to motivate a general principle about closeness: if a fact obtains in both of two worlds, then this similarity is relevant to the closeness between them if and only if the fact has the same explanation in the two worlds. I use this principle and some ideas of Lewis's to formulate a general account of counterfactuals, and I argue that this account can explain the asymmetry of counterfactual dependence. The paper concludes with a discussion of some examples that cannot be accommodated by the present version of the account and therefore necessitate further work on the details. (shrink)

In this paper I urge friends of truth-value gaps and truth-value gluts – proponents of paracomplete and paraconsistent logics – to consider theories not merely as sets of sentences, but as pairs of sets of sentences, or what I call ‘bitheories,’ which keep track not only of what holds according to the theory, but also what fails to hold according to the theory. I explain the connection between bitheories, sequents, and the speech acts of assertion and denial. I illustrate the (...) usefulness of bitheories by showing how they make available a technique for characterising different theories while abstracting away from logical vocabulary such as connectives or quanti- fiers, thereby making theoretical commitments independent of the choice of this or that particular non-classical logic. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

I discuss three observations about backtracking counterfactuals not predicted by existing theories, and then motivate a theory of counterfactuals that does predict them. On my theory, counterfactuals quantify over a suitably restricted set of historical possibilities from some contextually relevant past time. I motivate each feature of the theory relevant to predicting our three observations about backtracking counterfactuals. The paper concludes with replies to three potential objections.

Max Cresswell and Hilary Putnam seem to hold the view, often shared by classical logicians, that paraconsistent logic has not been made sense of, despite its well-developed mathematics. In this paper, I examine the nature of logic in order to understand what it means to make sense of logic. I then show that, just as one can make sense of non-normal modal logics (as Cresswell demonstrates), we can make `sense' of paraconsistent logic. Finally, I turn the tables on classical logicians (...) and ask what sense can be made of explosive reasoning. While I acknowledge a bias on this issue, it is not clear that even classical logicians can answer this question. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

We here attempt to address certain criticisms of the philosophical import of the so-called Brazilian approach to paraconsistency by providing some epistemic elucidations of the whole enterprise of the logics of formal inconsistency. In the course of this discussion, we substantiate the view that difficulties in reasoning under contradictions in both the Buddhist and the Aristotelian traditions can be accommodated within the precepts of the Brazilian school of paraconsistency.

The last several decades of research on counterfactual conditionals in the fields of philosophy and linguistics have yielded a predominant paradigm according to which the notion of similarity plays the starring role. Roughly, a counterfactual of the form A > C is true iff the closest A-worlds are all C-worlds, where the closeness of a world is a function of its similarity, in a certain sense, to the actual world. I argue that this is deeply misguided. In some cases we (...) may only care about the closest A-worlds, but quite often we care about some broader variety of A-worlds varying in closeness. After presenting several problem cases for the similarity-based paradigm, some new and some known, I propose an alternative paradigm for the semantics of counterfactuals, which introduces the notion of A-scenarios, understood roughly as different ways of making A true. According to this view, A > C is true iff all the contextually relevant ways of making A true also make C true. I then more carefully spell out a working view that formalizes this idea with greater precision, and explore the consequences of that version of the view. (shrink)

Reductionists say things like: all mental properties are physical properties; all normative properties are natural properties. I argue that the only way to resist reductionism is to deny that causation is difference making (thus making the epistemology of causation a mystery) or to deny that properties are individuated by their causal powers (thus making properties a mystery). That is to say, unless one is happy to deny supervenience, or to trivialize the debate over reductionism. To show this, I argue that (...) if properties are individuated by their causal powers then, surprisingly, properties are individuated by necessary co-exemplification. (shrink)

Substructural pluralism about the meaning of logical connectives is best understood as the view that natural language connectives have all (and only) the properties conferred by classical logic, but that particular occurrences of these connectives cannot simultaneously exhibit all these properties. This is just a more sophisticated way of saying that while natural language connectives are ambiguous, they are not so in the way classical logic intends them to be. Since this view is usually framed as a means to resolve (...) paradoxes, little attention is paid to the logical properties of the ambiguous connectives themselves. The present paper sets out to fill this gap. First, I argue that substructural logicians should care about these connectives; next, I describe a consequence relation between a set of ambiguous premises and an ambiguous conclusion, and review the logical properties of ambiguous connectives; and finally, I highlight how ambiguous connectives can explain our intuitions about logical rivalry. (shrink)