This paper defends an account of full belief, including an account of its relationship to credence. Along the way, I address several familiar and difficult questions about belief. Does fully believing a proposition require having maximal confidence in it? Are rational beliefs closed under entailment, or does the preface paradox show that rational agents can believe inconsistent propositions? Does whether you believe a proposition depend partly on your practical interests? My account of belief resolves the tension between conflicting answers to (...) these questions that have been defended in the literature. In addition, my account complements fruitful probabilistic theories of assertion and knowledge. (shrink)

I explore the logic of the conditional, using credence judgments to argue against Duality and in favor of Conditional Excluded Middle. I then explore how to give a theory of the conditional which validates the latter and not the former, developing a variant on Kratzer (1981)'s restrictor theory, as well as a proposal which combines Stalnaker (1968)'s theory of the conditional with the theory of epistemic modals I develop in Mandelkern 2019a. I argue that the latter approach fits naturally with (...) a conception of conditionals as referential devices which allow us to talk about particular worlds. (shrink)

This paper proposes a new model of graded modal judgment. It begins by problematizing the phenomenon: given plausible constraints on the logic of epistemic modality, it is impossible to model graded attitudes toward modal claims as judgments of probability targeting epistemically modal propositions. This paper considers two alternative models, on which modal operators are non-proposition-forming: (1) Moss (2015), in which graded attitudes toward modal claims are represented as judgments of probability targeting a “proxy” proposition, belief in which would underwrite belief (...) in the modal claim. (2) A model on which graded attitudes toward modal claims are represented as judgments of credence taking as their objects (non-propositional) modal representations (rather than proxy propositions). The second model, like Moss’ model, is shown to be semantically and mathematically tractable. The second model, however, can be straightforwardly integrated into a plausible model of the role of graded attitudes toward modal claims in cognition and normative epistemology. (shrink)

In recent years, a number of theorists have claimed that beliefs about probability are transparent. To believe probably p is simply to have a high credence that p. In this paper, I prove a variety of triviality results for theses like the above. I show that such claims are inconsistent with the thesis that probabilistic modal sentences have propositions or sets of worlds as their meaning. Then I consider the extent to which a dynamic semantics for probabilistic modals can capture (...) theses connecting belief, certainty, credence, and probability. I show that although a dynamic semantics for probabilistic modals does allow one to validate such theses, it can only do so at a cost. I prove that such theses can only be valid if probabilistic modals do not satisfy the axioms of the probability calculus. (shrink)

Philosophy and Phenomenological Research, EarlyView.

This book defends the view that any adequate account of rational decision making must take a decision maker's beliefs about causal relations into account. The early chapters of the book introduce the non-specialist to the rudiments of expected utility theory. The major technical advance offered by the book is a 'representation theorem' that shows that both causal decision theory and its main rival, Richard Jeffrey's logic of decision, are both instances of a more general conditional decision theory. The book solves (...) a long-standing problem for Jeffrey's theory by showing for the first time how to obtain a unique utility and probability representation for preferences and judgements of comparative likelihood. The book also contains a major new discussion of what it means to suppose that some event occurs or that some proposition is true. The most complete and robust defence of causal decision theory available. (shrink)

One thousand fair causally isolated coins will be independently flipped tomorrow morning and you know this fact. I argue that the probability, conditional on your knowledge, that any coin will land tails is almost 1 if that coin in fact lands tails, and almost 0 if it in fact lands heads. I also show that the coin flips are not probabilistically independent given your knowledge. These results are uncomfortable for those, like Timothy Williamson, who take these probabilities to play a (...) central role in their theorizing. (shrink)

We present and discuss a counterexample to the following plausible principle: if you know that a coin is fair, and for all you know it is going to be flipped, then for all you know it will land tails.

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 dynamic semantics for epistemically modalized sentences is an attractive alternative to the orthodox view that our best theory of meaning ascribes to such sentences truth-conditions relative to what is known. This essay demonstrates that a dynamic theory about might and must offers elegant explanations of a range of puzzling observations about epistemic modals. The first part of the story offers a unifying treatment of disputes about epistemic modality and disputes about matters of fact while at the same time avoiding (...) the complexities of alternative theories. The second part of the story extends the basic framework to cover some complicated data about retraction and the interaction between epistemic modality and tense. A comparison between the suggestion made in this essay and current versions of the orthodoxy is provided. (shrink)

We think we have lots of substantial knowledge about the future. But contemporary wisdom has it that indeterminism prevails in such a way that just about any proposition about the future has a non-zero objective chance of being false.2, 3 What should one do about this? One, pessimistic, reaction is scepticism about knowledge of the future. We think this should be something of a last resort, especially since this scepticism is likely to infect alleged knowledge of the present and past. (...) One anti-sceptical strategy is to pin our hopes on determinism, conceding that knowledge of the future is unavailable in an indeterministic world. This is not satisfying either: we would rather not be hostage to empirical fortune in the way that this strategy recommends. A final strategy, one that we shall explore in this paper, is one of reconciliation: knowledge of a proposition is compatible with a subject’s belief having a non-zero objective chance of error.4 Following Williamson, we are interested in tying knowledge to the presence or absence of error in close cases, and so we shall explore the connections between knowledge and objective chance within such a framework. We don’t want to get tangled up here in complications involved in attempting to formulate a necessary and sufficient condition for knowledge in terms of safety. Instead, we will assume the following rough and ready necessary condition: a subject knows P only if she could not easily have falsely believed P.5 Assuming that easiness is to be spelt.. (shrink)

We consider a paradox involving indicative conditionals (‘ifs’) and deontic modals (‘oughts’). After considering and rejecting several standard options for resolv- ing the paradox—including rejecting various premises, positing an ambiguity or hidden contextual sensitivity, and positing a non-obvious logical form—we offer a semantics for deontic modals and indicative conditionals that resolves the paradox by making modus ponens invalid. We argue that this is a result to be welcomed on independent grounds, and we show that rejecting the general validity of modus (...) ponens is compatible with vindicating most ordinary uses of modus ponens in reasoning. (shrink)

Suppose the world is chancy. The worry arises that most ordinary counterfactuals are false. This paper examines David Lewis' strategy for rescuing such counterfactuals, and argues that it is highly problematic.

Epistemic modal operators give rise to something very like, but also very unlike, Moore's paradox. I set out the puzzling phenomena, explain why a standard relational semantics for these operators cannot handle them, and recommend an alternative semantics. A pragmatics appropriate to the semantics is developed and interactions between the semantics, the pragmatics, and the definition of consequence are investigated. The semantics is then extended to probability operators. Some problems and prospects for probabilistic representations of content and context are explored.

In this paper, we develop a novel response to counterfactual scepticism, the thesis that most ordinary counterfactual claims are false. In the process we aim to shed light on the relationship between debates in the philosophy of science and debates concerning the semantics and pragmatics of counterfactuals. We argue that science is concerned with many domains of inquiry, each with its own characteristic entities and regularities; moreover, statements of scientific law often include an implicit ceteris paribus clause that restricts the (...) scope of the associated regularity to circumstances that are ‘fitting’ to the domain in question. This observation reveals a way of responding to scepticism while, at the same time, doing justice both to the role of counterfactuals in science and to the complexities inherent in ordinary counterfactual discourse and reasoning. (shrink)

On an influential line of thinking tracing back to Ramsey, conditionals are closely linked to the attitude of supposition. When applied to counterfactuals, this view suggests a subjunctive version of the so-called Ramsey test: the probability of a counterfactual If A, would B ought to be equivalent to the probability of B, under the subjunctive supposition that A. I present a collapse result for any view that endorses the subjunctive version of the Ramsey test. Starting from plausible assumptions, the result (...) shows that one’s rational credence in a would-counterfactual and in the corresponding might-counterfactual have to be identical. (shrink)

It has recently been argued that indeterminacy and indeterminism make most ordinary counterfactuals false. I argue that a plausible way to avoid such counterfactual skepticism is to postulate the existence of primitive modal facts that serve as truth-makers for counterfactual claims. Moreover, I defend a new theory of ‘might’ counterfactuals, and develop assertability and knowledge criteria to suit such unobservable ‘counterfacts’.

There seem to be two ways of supposing a proposition: supposing “indicatively” that Shakespeare didn’t write Hamlet, it is likely that someone else did; supposing “subjunctively” that Shakespeare hadn’t written Hamlet, it is likely that nobody would have written the play. Let P be the probability of B on the subjunctive supposition that A. Is P equal to the probability of the corresponding counterfactual, A □→B? I review recent triviality arguments against this hypothesis and argue that they do not succeed. (...) On the other hand, I argue that even if we can equate P with P, we still need an account of how subjunctive conditional probabilities are related to unconditional probabilities. The triviality arguments reveal that the connection is not as straightforward as one might have hoped. (shrink)

Lewis (1973) gave a short argument against conditional excluded middle, based on his treatment of ‘might’ counterfactuals. Bennett (2003), with much of the recent literature, gives an alternative take on ‘might’ counterfactuals. But Bennett claims the might-argument against CEM still goes through. This turns on a specific claim I call Bennett’s Hypothesis. I argue that independently of issues to do with the proper analysis of might-counterfactuals, Bennett’s Hypothesis is inconsistent with CEM. But Bennett’s Hypothesis is independently objectionable, so we should (...) resolve this tension by dropping the Hypothesis, not by dropping CEM. (shrink)

I have argued for a kind of ‘counterfactual scepticism’: most counterfactuals ever uttered or thought in human history are false. I briefly rehearse my main arguments. Yet common sense recoils. Ordinary speakers judge most counterfactuals that they utter and think to be true. A common defence of such judgments regards counterfactuals as context-dependent: the proposition expressed by a given counterfactual can vary according to the context in which it is uttered. In normal contexts, the counterfactuals that we utter are typically (...) true, the defence insists, while granting that there may be more rarefied contexts in which they are false. I give a taxonomy of such contextualist replies. One could be a contextualist about the counterfactual connective, about its antecedent, or about its consequent. I offer some general concerns about all these varieties of contextualism. I then focus especially on antecedent-contextualism, as I call it. I firstly raise some high-level objections to it. Then, I look at such a contextualist account due to Sandgren and Steele. I think it has many virtues, but also some problems. I conclude with some avenues for future research. (shrink)

This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics (...) for modals into a dynamic semantics for modals with similar properties. (shrink)

Probabilities figure centrally in much of the literature on the semantics of conditionals. I find this surprising: it accords a special status to conditionals that other parts of language apparently do not share. I critically discuss two notable ‘probabilities first’ accounts of counterfactuals, due to Edgington and Leitgeb. According to Edgington, counterfactuals lack truth values but have probabilities. I argue that this combination gives rise to a number of problems. According to Leitgeb, counterfactuals have truth conditions-roughly, a counterfactual is true (...) when the corresponding conditional chance is sufficiently high. I argue that problems arise from the disparity between truth and high chance, between approximate truth and high chance, and from counterfactuals for which the corresponding conditional chances are undefined. However, Edgington, Leitgeb and I can unite in opposition to Stalnaker and Lewis-style ‘similarity’ accounts of counterfactuals. (shrink)

The pattern of credences we are inclined to assign to counterfactuals challenges standard accounts of counterfactuals. In response to this problem, the paper develops a semantics of counterfactuals in terms of the epsilon-operator. The proposed semantics stays close to the standard account: the epsilon-operator substitutes the universal quantifier present in standard semantics by arbitrarily binding the open world-variable. Various applications of the suggested semantics are explored including, in particular, an explanation of how the puzzling credences in counterfactuals come about.

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by representation theorems. (...) Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false. (shrink)

This paper defends a counterexample to Modus Tollens, and uses it to draw some conclusions about the logic and semantics of indicative conditionals and probability operators in natural language. Along the way we investigate some of the interactions of these expressions with 'knows', and we call into question the thesis that all knowledge ascriptions have truth-conditions.

The score was tied in the bottom of the ninth, I was on third base, and there was only one out when Bubba hit a towering fly ball to deep left-center. Although I’m no speed-demon, the ball was hammered so far that I easily could have scored the winning run if I had tagged up. But I didn’t. I got caught up in the excitement and stupidly played it half way, standing between third and home until I saw the center (...) fielder make his spectacular catch, after which I had to return sheepishly to third. The next batter grounded out, and we lost the game in extra innings. (shrink)

This paper motivates and develops a novel semantics for several epistemic expressions, including possibility modals and indicative conditionals. The semantics I defend constitutes an alternative to standard truth conditional theories, as it assigns sets of probability spaces as sentential semantic values. I argue that what my theory lacks in conservatism is made up for by its strength. In particular, my semantics accounts for the distinctive behavior of nested epistemic modals, indicative conditionals embedded under probability operators, and instances of constructive dilemma (...) containing epistemic vocabulary. (shrink)

We will present a new lottery-style paradox on counterfactuals and chance. The upshot will be: combining natural assumptions on the truth values of ordinary counterfactuals, the conditional chances of possible but non-actual events, the manner in which and relate to each other, and a fragment of the logic of counterfactuals leads to disaster. In contrast with the usual lottery-style paradoxes, logical closure under conjunction—that is, in this case, the rule of Agglomeration of counterfactuals—will not play a role in the derivation (...) and will not be entailed by our premises either. We will sketch four obvious but problematic ways out of the dilemma, and we will end up with a new resolution strategy that is non-obvious but less problematic: contextualism about what counts as a proposition. This proposal will not just save us from the paradox, it will also save each premise in at least some context, and it will be motivated by independent considerations from measure theory and probability theory. (shrink)

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) Moore sentence unsuccessful, it is self-refuting, for it never remains true as described. We show that in logics of knowledge and belief for a single agent (extended by S5), Moorean phenomena are the source of all self-refutation; moreover, in logics for an introspective agent (extending KD45), Moorean phenomena are the source of all unsuccessfulness as well. This is a distinctive feature of such logics, for with a non-introspective agent or multiple agents, non-Moorean unsuccessful formulas appear. We also consider how successful and self-refuting formulas relate to the Cartesian and learnable formulas, which have been discussed in connection with Fitch’s “paradox of knowability.” We show that the Cartesian formulas are exactly the formulas that are not eventually self-refuting and that not all learnable formulas are successful. In an appendix, we give syntactic characterizations of the successful and the self-refuting formulas. (shrink)

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

‘If I were to toss a coin 1000 times, then it would land heads exactly n times’. Is there a specific value of n that renders this counterfactual true? According to an increasingly influential view, there is. A precursor of the view goes back to the Molinists; more recently it has been inspired by Stalnaker, and versions of it have been advocated by Hawthorne, Bradley, Moss, Schulz, and Stefánsson. More generally, I attribute to these authors what I call Counterfactual Plenitude:For (...) any antecedent A, there is a world wisuch that A ☐→ wiis true.Moreover, some of these authors are also committed to Primitive Counterfacts Realism:There exist primitive modal facts that serve as truth-makers for counterfactual claims.Call the conjunction of these italicized theses counterfactism. I clarify it and suggest some of its virtues, while ultimately rejecting it.Stefánsson’s counterfactism is motivated by and targeted at my “counterfactual skepticism”—I argue that most counterfactuals are false—and counterfactism has various other sources of support. I briefly defend that skepticism, and I seek to undercut those sources of support. I then argue more directly against counterfactism, especially on grounds of its ontological profligacy, and its leading to another kind of skepticism about counterfactuals that I believe is more problematic than my kind. In the process, I discuss how Bradley’s multidimensional semantics bears on counterfactism; I offer some new considerations against some central theses regarding conditionals ; and I reflect more generally on the epistemology of modality and the choice of primitives in our theorizing. (shrink)

In this paper I argue that there is a preface paradox for intention. The preface paradox for intention shows that intentions do not obey an agglomeration norm, requiring one to intend conjunctions of whatever else one intends. But what norms do intentions obey? I will argue that intentions come in degrees. These partial intentions are governed by the norms of the probability calculus. First, I will give a dispositional theory of partial intention, on which degrees of intention are the degrees (...) to which one possesses the dispositions characteristic of full intention. I will use this dispositional theory to defend probabilism about intention. Next, I will offer a more general argument for probabilism about intention. To do so, I will generalize recent decision theoretic arguments for probabilism from the case of belief to the case of intention. (shrink)

Many of the motivations in favor of contextualism about knowledge apply also to a contextualist approach to counterfactuals. I motivate and articulate such an approach, in terms of the context-sensitive 'all cases', in the spirit of David Lewis's contextualist view about knowledge. The resulting view explains intuitive data, resolves a puzzle parallel to the skeptical paradox, and renders safety and sensitivity, construed as counterfactuals, necessary conditions on knowledge.

Moore's paradox pits our intuitions about semantic oddnessagainst the concept of truth-functional consistency. Most solutions tothe problem proceed by explaining away our intuitions. But``consistency'' is a theory-laden concept, having different contours indifferent semantic theories. Truth-functional consistency is appropriateonly if the semantic theory we are using identifies meaning withtruth-conditions. I argue that such a framework is not appropriate whenit comes to analzying epistemic modality. I show that a theory whichaccounts for a wide variety of semantic data about epistemic modals(Update Semantics) buys (...) us a solution to Moore's paradox as a corollary.It turns out that Moorean propositions, when looked at through the lenseof an appropriate semantic theory, are inconsistent after all. (shrink)

Counterfactuals are typically thought--given the force of Sobel sequences--to be variably strict conditionals. I go the other way. Sobel sequences and (what I call) Hegel sequences push us to a strict conditional analysis of counterfactuals: counterfactuals amount to some necessity modal scoped over a plain material conditional, just which modal being a function of context. To make this worth saying I need to say just how counterfactuals and context interact. No easy feat, but I have something to say on the (...) matter. (shrink)

I offer a novel solution to the problem of counterfactual skepticism: the worry that all contingent counterfactuals without explicit probabilities in the consequent are false. I argue that a specific kind of contextualist semantics and pragmatics for would- and might-counterfactuals can block both central routes to counterfactual skepticism. One, it can explain the clash between would- and might-counterfactuals as in: If you had dropped that vase, it would have broken. and If you had dropped that vase, it might have safely (...) quantum tunneled to China. Two, it can explain why counterfactuals like can be true despite the fact that quantum tunneling worlds are among the most similar worlds. I further argue that this brand of contextualism accounts for the data better than other existing solutions to the problem. (shrink)

The general verificationist thesis says that What is true can be known or formally: φ → ◊Kφ VT Fitch's argument trivializes this principle. It uses a weak modal epistemic logic to show that VT collapses truth and knowledge, by taking a clever substitution instance for φ: P ∧ ¬KP → ◊ K(P ∧ ¬KP) Then we have the following chain of three conditionals (a) ◊ K(P ∧ ¬KP) → ◊ (KP ∧ K¬KP) in the minimal modal logic for the knowledge (...) operator K, (b) ◊ (KP ∧ K¬KP) → ◊ (KP ∧¬KP) in the modal logic T, and finally (c) ◊ (KP ∧¬KP) → ⊥ in the minimal modal logic for. (shrink)

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

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)