– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

We construct a causal-modeling semantics for both indicative and counterfactual conditionals. As regards counterfactuals, we adopt the orthodox view that a counterfactual conditional is true in a causal model M just in case its consequent is true in the submodel M∗, generated by intervening in M, in which its antecedent is true. We supplement the orthodox semantics by introducing a new manipulation called extrapolation. We argue that an indicative conditional is true in a causal model M just in case its (...) con- sequent is true in certain submodels M∗, generated by extrapolating M, in which its antecedent is true. We show that the proposed semantics can account for some important minimal pairs nicely and naturally. We also prove a theorem showing under what conditions intervention and extrapolation will yield the same result, and thus explain how counterfactual and indicative conditionals would behave in a causal-modeling semantics. (shrink)

The material account proposes that indicative conditionals are material, but it is widely believed that this account cannot be applied to subjunctive conditionals. There are three reasons for this consensus: (1) the concern that most subjunctive conditionals would be vacuously true if they were material, which seems implausible; (2) the inconsistency with Adams pair, which suggests that indicative and subjunctive conditionals have different truth conditions; and (3) the belief that the possible world theories are a superior alternative to the material (...) account. In this paper, I will argue against (1) by showing that the counterintuitive aspects of vacuously true conditionals can be explained away in a consistent manner, regardless of whether they are indicative or subjunctive. I will support this argument by demonstrating that the positive arguments for the material account of indicatives also apply to subjunctives. I will counter (2) by explaining the Adams pair as logically equivalent conditionals that may be appropriate at different times, depending on the speaker’s epistemic situation. Finally, I will challenge (3) by arguing that the possible world account faces insurmountable issues and that a comprehensive material account of both indicatives and subjunctives is ultimately a more elegant solution. (shrink)

There is strong disagreement about whether indicative conditionals have truth values. In this paper, I present a new argument for the conclusion that indicative conditionals have truth values based on the claim that some true statements entail indicative conditionals. I then address four arguments that conclude that indicative conditionals lack truth values, showing them to be inadequate. Finally, I present further benefits to having a worldly view of conditionals, which supports the assignment of truth values to indicative conditionals. I conclude (...) that certain types of account of indicative conditionals, which have been ignored in the literature partly on the basis of assigning truth values to indicative conditionals, deserve consideration. (shrink)

I argue that the suppositional view of conditionals, which is quite popular for indicative conditionals, extends also to subjunctive or counterfactual conditionals. According to this view, conditional judgements should not be construed as factual, categorical judgements, but as judgements about the consequent under the supposition of the antecedent. The strongest evidence for the view comes from focusing on the fact that conditional judgements are often uncertain; and conditional uncertainty, which is a well-understood notion, does not function like uncertainty about matters (...) of fact. I argue that the evidence for this view is as strong for subjunctives as it is for indicatives. (shrink)

The paper describes a new way of thinking about conditionals, in terms of information transfer between worlds. This way of looking at things provides an answer to some of the standard problems concerning conditionals, and undercuts the claim that indicative and subjunctive conditionals are distinct.

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (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.

Weak ontic necessity is the ontic necessity expressed by “should” or “ought to”. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds is irrelevant to whether its underlying proposition holds. This necessity essentially involves time. This paper presents a logic for conditional weak ontic necessity in branching time. The logic’s language includes the next instant operator, the last instant operator, and the operator for conditional weak ontic necessity. Formulas (...) are evaluated at tuples consisting of a tree-based model, a context, a timeline, and an instant. A context is a set of ordered ontic laws determining expected timelines. When evaluating conditional weak ontic necessity, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We discuss some consequences of the formalization and compare it to some related work. We study the logic’s expressivity and axiomatize a special validity of it. (shrink)

V.H. Dudman has argued that a better semantic account of the conditional emerges from placing grammar ‘in the driver's seat’. His account of their grammar identifies two main categories, which differ from those postulated by traditional theorists, and which he claims correspond to two very different and deep‐rooted styles of thought. I show that it is unlikely that a perfect match exists between styles of thought and grammatical categories in the way that Dudman postulates. I consider arguments by Dale and (...) Edgington in this context. More importantly, however, I also show that even if there were a perfect match, Dudman's account would still obscure semantic similarities between ‘if’‐sentences which are arguably of greater importance than the ones he highlights. This, I suggest, has implications extending far beyond Dudman's work. (shrink)

Weak ontic necessity is the ontic necessity expressed by “should/ought to” in English. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds at the present world is irrelevant to whether its prejacent holds at the present world. In this paper, by combining premise semantics and update semantics for conditionals, we present a logical theory for conditional weak ontic necessity based on context update. A context is a set of (...) ordered defaults, determining expected possible states of the present world. Sentences are evaluated with respect to contexts. When evaluating the conditional weak ontic necessity with respect to a context, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We compare this theory to some related works. The logic’s expressivity is studied. (shrink)

Received doctrine has an 'antecedent' message encoded within a conditional clause, such as the string comprising the first five words of the sentence 'If the bough had broken the cradle would have fallen'. Criticisms of mine of this tenet were recently challenged by Stephen Barker. In the course of responding to his examination, I venture a snappy demonstration that the 'conditionals' such sentences encode can have neither 'antecedents' nor 'consequents'. Also, less happily, I urge a binary outermost structure for these (...) conditionals. (shrink)

Section 1 briefly examines three theories of indicative conditionals. The Suppositional Theory is defended, and shown to be incompatible with understanding conditionals in terms of truth conditions. Section 2 discusses the psychological evidence about conditionals reported by Over and Evans (this volume). Section 3 discusses the syntactic grounds offered by Haegeman (this volume) for distinguishing two sorts of conditional.

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)

According to so-called epistemic theories of conditionals, the assertability/acceptability/acceptance of a conditional requires the existence of an epistemically significant relation between the conditional’s antecedent and its consequent. This paper points to some linguistic data that our current best theories of the foregoing type appear unable to explain. Further, it presents a new theory of the same type that does not have that shortcoming. The theory is then defended against some seemingly obvious objections.