Pascal’s Wager is simply too good to be true—or better, too good to be sound. There must be something wrong with Pascal’s argument that decision-theoretic reasoning shows that one must (resolve to) believe in God, if one is rational. No surprise, then, that critics of the argument are easily found, or that they have attacked it on many fronts. For Pascal has given them no dearth of targets.

Thanks to David Kaplan (1989a, 1989b), we all know how to handle indexicals like ‘I’. ‘I’ doesn’t refer to an object simpliciter; rather, it refers to an object only relative to a context. In particular, relative to a context C, ‘I’ refers to the agent of C. Since different contexts can have different agents, ‘I’ can refer to different objects relative to different contexts. For example, relative to a context cwhose agent is Gottlob Frege, ‘I’ refers to Frege; relative to (...) a context 0* whose agent is Alexius.. (shrink)

Thanks to David Kaplan, we all know how to handle indexicals like ‘I’. ‘I’ doesn’t refer to an object simpliciter; rather, it refers to an object only relative to a context. In particular, relative to a context C, ‘I’ refers to the agent of C. Since different contexts can have different agents, ‘I’ can refer to different objects relative to different contexts. For example, relative to a context c whose agent is Gottlob Frege, ‘I’ refers to Frege; relative to a (...) context c* whose agent is Alexius Meinong, ‘I’ refers to Meinong. (shrink)

This is a study in the meaning of natural language probability operators, sentential operators such as probably and likely. We ask what sort of formal structure is required to model the logic and semantics of these operators. Along the way we investigate their deep connections to indicative conditionals and epistemic modals, probe their scalar structure, observe their sensitivity to contex- tually salient contrasts, and explore some of their scopal idiosyncrasies.

We establish a probabilized version of modus tollens, deriving from p(E|H)=a and p()=b the best possible bounds on p(). In particular, we show that p() 1 as a, b 1, and also as a, b 0. Introduction Probabilities of conditionals Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities.

Suppose we wish to provide a naturalistic account of intentionality. Like several other philosophers, we focus on the intentionality of belief, hoping that we may later supplement our account to accommodate other intentional states like desires and fears. Now suppose that we also take partial beliefs or credences seriously. In cashing out our favoured theory of intentionality, we may for the sake of simplicity talk as if belief is merely binary or all-or-nothing. But we should be able to supplement or (...) modify our account to accommodate credences. I shall argue, however, that it is difficult to do so with respect to certain causal or teleological theories of intentionality-in particular, those advanced by the likes of Stalnaker (Inquiry, 1984) and Millikan (J Philos 86:281–297, 1989). I shall first show that such theories are tailor-made to account for the intentionality of binary beliefs. Then I shall argue that it is hard to extend or supplement such theories to accommodate credences. Finally, I shall offer some natural ways of modifying the theories that involve an appeal to objective probabilities. But unfortunately, such modifications face problems. (shrink)

What distinguishes indicative conditionals from subjunctive conditionals, according to one popular view, is that the so-called Adams’ thesis holds for the former kind of conditionals but the so-called Skyrms’ thesis for the latter. According to a plausible metaphysical view, both conditionals and chances supervene on non-modal facts. But since chances do not supervene on facts about particular events but facts about event-types, the past as well as the future is chancy. Some philosophers have worried that this metaphysical view is incompatible (...) with the aforementioned view on the probability of conditionals. This paper however shows that there is no need to worry, as these views can all be simultaneously satisfied within the so-called Multidimensional Possible World Semantics for conditionals. (shrink)

Two partition-theorems are proved for a particular causal decision theory. One is restricted to a certain kind of partition of circumstances, and analyzes the utility of an option in terms of its utilities in conjunction with circumstances in this partition. The other analyzes an option's utility in terms of its utilities conditional on circumstances and is quite unrestricted. While the first form seems more useful for applications, the second form may be of theoretical importance in foundational exercises. Comparisons are made (...) with theorems of Richard Jeffrey, Brad Armendt, and Peter Fishburn. (shrink)

This paper has three interdependent aims. The first is to make Reichenbach’s views on induction and probabilities clearer, especially as they pertain to his pragmatic justification of induction. The second aim is to show how his view of pragmatic justification arises out of his commitment to extensional empiricism and moots the possibility of a non-pragmatic justification of induction. Finally, and most importantly, a formal decision-theoretic account of Reichenbach’s pragmatic justification is offered in terms both of the minimax principle and the (...) dominance principle. (shrink)

The ontology of decision theory has been subject to considerable debate in the past, and discussion of just how we ought to view decision problems has revealed more than one interesting problem, as well as suggested some novel modifications of classical decision theory. In this paper it will be argued that Bayesian, or evidential, decision-theoretic characterizations of decision situations fail to adequately account for knowledge concerning the causal connections between acts, states, and outcomes in decision situations, and so they are (...) incomplete. Second, it will be argues that when we attempt to incorporate the knowledge of such causal connections into Bayesian decision theory, a substantial technical problem arises for which there is no currently available solution that does not suffer from some damning objection or other. From a broader perspective, this then throws into question the use of decision theory as a model of human or machine planning. (shrink)

This paper explores the possibility of supplementing the suppositional view of indicative conditionals with a corresponding view of epistemic modals. The most striking feature of the suppositional view consists in its claim that indicative conditionals are to be evaluated by conditional probabilities. On the basis of a natural link between indicative conditionals and epistemic modals, a corresponding thesis about the probabilities of statements governed by epistemic modals can be derived. The paper proceeds by deriving further consequences of this thesis, in (...) particular, the logic of epistemic modals and their logical interaction with indicative conditionals are studied. (shrink)

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)

There is a renewed debate about modus ponens. Strikingly, the recent counterexamples in Cantwell, Dreier and MacFarlane and Kolodny are generated by restricted readings of the ‘if’-clause. Moreover, it can be argued on general grounds that the restrictor view of conditionals developed in Kratzer and Lewis leads to counterexamples to modus ponens. This paper provides a careful analysis of modus ponens within the framework of the restrictor view. Despite appearances to the contrary, there is a robust sense in which modus (...) ponens is valid, owing to the fact that conditionals do not only allow for restricted readings but have bare interpretations, too. (shrink)

Three-valued accounts of conditionals frequently promise (a) to conform to the probabilistic view that conditionals are evaluated by conditional probabilities, and (b) to yield a plausible account of compounds of conditionals. However, McGee (1981) shows that probabilistic validity, the conception of validity most naturally associated with the probabilistic view, cannot be characterized by a finite matrix. Adams (1995) indicates a further generalization of this result. Nevertheless, Adams (1986) provides a description of probabilistic validity in three-valued terms by going beyond the (...) standard framework. Yet the language Adams considers is severely restricted: it does not contain compounds of conditionals. Thus, a natural question arises: Is there a plausible three-valued account of compounds of conditionals which agrees with probabilistic validity on the restricted language? In this note, I develop a general framework in which to address this question. The answer will be negative. (shrink)

Magnetism in meta-semantics is the view that the meaning of our words is determined in part by their use and in part by the objective naturalness of candidate meanings. This hypothesis is commonly attributed to David Lewis, and has been put to philosophical work by Brian Weatherson, Ted Sider and others. I argue that there is no evidence that Lewis ever endorsed the view, and that his actual account of language reveals good reasons against it.

Suppose you’re certain that a claim—say, ‘Frida is tall’—does not have a determinate truth value. What attitude should you take towards it? This is the question of the cognitive role of indeterminacy. This paper presents a puzzle for theories of cognitive role. Many of these theories vindicate a seemingly plausible principle: if you are fully certain that A, you are rationally required to be fully certain that A is determinate. Call this principle ‘Certainty’. We show that Certainty, in combination with (...) some minimal side premises, entails a very implausible claim: whenever you’re certain that it’s indeterminate whether A, it is rationally required that you reject A. This is a surprising result, which requires abandoning at least some intuitive views about indeterminacy and cognitive role. (shrink)

Famous results by David Lewis show that plausible-sounding constraints on the probabilities of conditionals or evaluative claims lead to unacceptable results, by standard probabilistic reasoning. Existing presentations of these results rely on stronger assumptions than they really need. When we strip these arguments down to a minimal core, we can see both how certain replies miss the mark, and also how to devise parallel arguments for other domains, including epistemic “might,” probability claims, claims about comparative value, and so on. A (...) popular reply to Lewis's results is to claim that conditional claims, or claims about subjective value, lack truth conditions. For this strategy to have a chance of success, it needs to give up basic structural principles about how epistemic states can be updated—in a way that is strikingly parallel to the commitments of the project of dynamic semantics. (shrink)

I present some counterexamples to Adams's Thesis and explain how they undermine arguments that indicative conditionals cannot be truth-evaluable propositions.

Barristers in England are obliged to follow the ‘cab rank rule’, according to which they must take any case offered to them, as long as they have time in their.

IntroductionThe project of giving an account of meaning in natural languages goes largely by assigning truth-conditional content to sentences. I will call the view that sentences have truth-conditional content propositionalism as it is common to identify the truth-conditional content of a sentence with the proposition it expresses. This content plays an important role in our explanations of the speech-acts, attitude ascriptions, and the meaning of sentences when they appear as parts of longer sentences. Much work in philosophy of language and (...) linguistics semantics over the last half-century has aimed to characterize the truth-conditional content of different aspects of language.There are different kinds of worries one might have about this project. There are general methodological worries about truth-conditional semantics that have had some currency in the philosophical literature. In my view, the enormous progress in semantics made in its brief history suggests these are misplaced. Ho .. (shrink)

In this paper we propose a semantic analysis of Lewis' counterfactuals. By exploiting the structural properties of the recently introduced boolean algebras of conditionals, we show that counterfactuals can be expressed as formal combinations of a conditional object and a normal necessity modal operator. Specifically, we introduce a class of algebras that serve as modal expansions of boolean algebras of conditionals, together with their dual relational structures. Moreover, we show that Lewis' semantics based on sphere models can be reconstructed in (...) this framework. As a consequence, we establish the soundness and completeness of a slightly stronger variant of Lewis' logic for counterfactuals with respect to our algebraic models. In the second part of the paper, we present a novel approach to the probability of counterfactuals showing that it aligns with the uncertainty degree assigned by a belief function, as per Dempster-Shafer theory, to its associated conditional formula. Furthermore, we characterize the probability of a counterfactual in terms of Gärdenfors' imaging rule for the probabilistic update. (shrink)

Toni Rønnow-Rasmussen | : This paper explores a novel metaethical theory according to which value judgments express conditional beliefs held by those who make them. Each value judgment expresses the belief that something is the case on condition that something else is the case. The paper aims to reach a better understanding of this view and to highlight some of the challenges that lie ahead. The most pressing of these revolves around the correct understanding of the nature of the relevant (...) cognitive attitudes. It is suggested that the distinction between “dormant attitudes” and “occurrent attitudes” helps us to understand these conditional beliefs. | : Cet article explore une nouvelle théorie méta-éthique selon laquelle les jugements de valeur expriment les croyances conditionnelles des sujets qui les font. Chaque jugement de valeur exprimerait la croyance selon laquelle quelque chose est le cas à la condition que quelque chose d’autre le soit. L’objectif de cet article est de parvenir à une meilleure compréhension de ce point de vue et de souligner certaines de ses difficultés. La plus urgente d’entre elles concerne la compréhension adéquate de la nature des attitudes cognitives pertinentes. Nous suggérons que la distinction entre « attitudes dormantes » et « attitudes occurrentes » permettrait de mieux comprendre les croyances conditionnelles. (shrink)

According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...) other known representations of conditional doxastic states. The paper proves Lewis’ triviality for quasi probabilities and discusses how this has implications for three other prominent strategies to avoid Lewis’ triviality: Adams’ thesis, where the probability function on the left in is replaced by a probability-like function, abandoning conditionalisation, where probability conditionalisation on the right in is replaced by another propositional update procedure and the approximation thesis, where equality in is replaced by approximation. The paper also shows that Lewis’ triviality result is really about ‘additiveness’ and ‘conditionality’. (shrink)

The Adams Thesis holds for a conditional → and a probability assignment P if and only if P=P whenever P>0. The restriction ensures that P is well defined by the classical formula P=P/P. Drawing on deep results of Maharam on measure algebras, it is shown that, notwithstanding well-known triviality results, any probability space can be extended to a probability space with a new conditional satisfying the Adams Thesis and satisfying a number of axioms for conditionals. This puts significant limits on (...) how far triviality results can go. (shrink)

In this paper, I propose and defend a pair of necessary conditions on evidence-based knowledge which bear resemblance to the troubled sensitivity principles defended in the philosophical literature. We can think of the traditional principles as simple but inaccurate approximations of the new proposals. Insofar as the old principles are intuitive and used in scientific and philosophical contexts, but are plausibly false, there’s a real need to develop precise and correct formulations. These new renditions turned out to be more cautious, (...) so they won’t be able to do everything the old principled promised they could. For example, they respect closure for knowledge. But these sober formulations, or something like them, might be the best that we can do with respect to sensitivity. And there’s value in understanding the limits to these types of principles. (shrink)

I introduce a mathematical account of expectation based on a qualitative criterion of coherence for qualitative comparisons between gambles (or random quantities). The qualitative comparisons may be interpreted as an agent’s comparative preference judgments over options or more directly as an agent’s comparative expectation judgments over random quantities. The criterion of coherence is reminiscent of de Finetti’s quantitative criterion of coherence for betting, yet it does not impose an Archimedean condition on an agent’s comparative judgments, it does not require the (...) binary relation reflecting an agent’s comparative judgments to be reflexive, complete or even transitive, and it applies to an absolutely arbitrary collection of gambles, free of structural conditions (e.g., closure, measurability, etc.). Moreover, unlike de Finetti’s criterion of coherence, the qualitative criterion respects the principle of weak dominance, a standard of rational decision making that obliges an agent to reject a gamble that is possibly worse and certainly no better than another gamble available for choice. Despite these weak assumptions, I establish a qualitative analogue of de Finetti’s Fundamental Theorem of Prevision, from which it follows that any coherent system of comparative expectations can be extended to a weakly ordered coherent system of comparative expectations over any collection of gambles containing the initial set of gambles of interest. The extended weakly ordered coherent system of comparative expectations satisfies familiar additivity and scale invariance postulates (i.e., independence) when the extended collection forms a linear space. In the course of these developments, I recast de Finetti’s quantitative account of coherent prevision in the qualitative framework adopted in this article. I show that comparative previsions satisfy qualitative analogues of de Finetti’s famous bookmaking theorem and his Fundamental Theorem of Prevision.The results of this article complement those of another article (Pedersen, Strictly coherent preferences, no holds barred, Manuscript, 2013). I explain how those results entail that any coherent weakly ordered system of comparative expectations over a unital linear space can be represented by an expectation function taking values in a (possibly non-Archimedean) totally ordered field extension of the system of real numbers. The ordered field extension consists of formal power series in a single infinitesimal, a natural and economical representation that provides a relief map tracing numerical non-Archimedean features to qualitative non-Archimedean features. (shrink)

According to a standard assumption in epistemology, if one only partially believes that p , then one cannot thereby have knowledge that p. For example, if one only partially believes that that it is raining outside, one cannot know that it is raining outside; and if one only partially believes that it is likely that it will rain outside, one cannot know that it is likely that it will rain outside. Many epistemologists will agree that epistemic agents are capable of (...) partial beliefs in addition to full beliefs and that partial beliefs can be epistemically assessed along some dimensions. However, it has been generally assumed that such doxastic attitudes cannot possibly amount to knowledge. In Probabilistic Knowledge, Moss challenges this standard assumption and provides a formidable defense of the claim that probabilistic beliefs—a class of doxastic attitudes including credences and degrees of beliefs—can amount to knowledge too. Call this the probabilistic knowledge claim . Throughout the book, Moss goes to great lengths to show that probabilistic knowledge can be fruitfully applied to a variety of debates in epistemology and beyond. My goal in this essay is to explore a further application for probabilistic knowledge. I want to look at the role of probabilistic knowledge within a “knowledge-centered” psychology—a kind of psychology that assigns knowledge a central stage in explanations of intentional behavior. My suggestion is that Moss’s notion of probabilistic knowledge considerably helps further both a knowledge-centered psychology and a broadly intellectualist picture of action and know-how that naturally goes along with it. At the same time, though, it raises some interesting issues about the notion of explanation afforded by the resulting psychology. (shrink)

This article begins by outlining some of the history—beginning with brief remarks of Quine's—of work on conditional assertions and conditional events. The upshot of the historical narrative is that diverse works from various starting points have circled around a nexus of ideas without convincingly tying them together. Section 3 shows how ideas contained in a neglected article of de Finetti's lead to a unified treatment of the topics based on the identification of conditional events as the objects of conditional bets. (...) The penultimate section explores some of the consequences of the resulting logic of conditional events while the last defends it. (shrink)

Uncertainty and vagueness/imprecision are not the same: one can be certain about events described using vague predicates and about imprecisely specified events, just as one can be uncertain about precisely specified events. Exactly because of this, a question arises about how one ought to assign probabilities to imprecisely specified events in the case when no possible available evidence will eradicate the imprecision (because, say, of the limits of accuracy of a measuring device). Modelling imprecision by rough sets over an approximation (...) space presents an especially tractable case to help get one’s bearings. Two solutions present themselves: the first takes as upper and lower probabilities of the event X the (exact) probabilities assigned X ’s upper and lower rough-set approximations; the second, motivated both by formal considerations and by a simple betting argument, is to treat X ’s rough-set approximation as a conditional event and assign to it a point-valued (conditional) probability. (shrink)

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic (...) completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, Łukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates. (shrink)

On the basis of impossibility results on probability, belief revision, and conditionals, it is argued that conditional beliefs differ from beliefs in conditionals qua mental states. Once this is established, it will be pointed out in what sense conditional beliefs are still conditional, even though they may lack conditional contents, and why it is permissible to still regard them as beliefs, although they are not beliefs in conditionals. Along the way, the main logical, dispositional, representational, and normative properties of conditional (...) beliefs are studied, and it is explained how the failure of not distinguishing conditional beliefs from beliefs in conditionals can lead philosophical and empirical theories astray. (shrink)

Lewis argued that ‘there is no way to interpret a conditional connective so that, with sufficient generality, the probabilities of conditionals will equal the appropriate conditional probabilities’. However, as Lewis and others have subsequently recognized, Lewis' triviality results go through only on the assumption that ‘if’ is not context-sensitive. This leaves a question that has not been adequately addressed: what are the prospects of a context-sensitive theory of ‘if’ that complies with Stalnaker's thesis? I offer one interesting constraint on any (...) such theory. I argue that no context-sensitive theory satisfies Stalnaker's thesis if it satisfies three plausible assumptions: first, that the truth of an indicative is determined by the world of evaluation and by the set of worlds in the relevant epistemic context in which the antecedent is true; second, that one can learn an indicative conditional without learning that the antecedent and consequent are both true; third, that belief revision is conservative in the sense that it does not reduce the probabilities to zero unnecessarily. The result gives us a clearer picture of the real costs of a truth-conditional context-sensitive Stalnaker's thesis-compliant semantics. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation into conditional connectives may (...) show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

The Ramseyan thesis that the probability of an indicative conditional is equal to the corresponding conditional probability of its consequent given its antecedent is both widely confirmed and subject to attested counterexamples (e.g., McGee 2000, Kaufmann 2004). This raises several puzzling questions. For instance, why are there interpretations of conditionals that violate this Ramseyan thesis in certain contexts, and why are they otherwise very rare? In this paper, I raise some challenges to Stefan Kaufmann's account of why the Ramseyan thesis (...) sometimes fails, and motivate my own theory. On my theory, the proposition expressed by an indicative conditional is partially determined by a background partition, and hence its probability depends on the choice of such a partition. I hold that this background partition is contextually determined, and in certain conditions is set by a salient question under discussion in the context. I show how the resulting theory offers compelling answers to the puzzling questions raised by failures of the Ramseyan thesis. (shrink)

This paper discusses and relates two puzzles for indicative conditionals: a puzzle about indeterminacy and a puzzle about triviality. Both puzzles arise because of Ramsey's Observation, which states that the probability of a conditional is equal to the conditional probability of its consequent given its antecedent. The puzzle of indeterminacy is the problem of reconciling this fact about conditionals with the fact that they seem to lack truth values at worlds where their antecedents are false. The puzzle of triviality is (...) the problem of reconciling Ramsey's Observation with various triviality proofs which establish that Ramsey's Observation cannot hold in full generality. In the paper, I argue for a solution to the indeterminacy puzzle and then apply the resulting theory to the triviality puzzle. On the theory I defend, the truth conditions of indicative conditionals are highly context dependent and such that an indicative conditional may be indeterminate in truth value at each possible world throughout some region of logical space and yet still have a nonzero probability throughout that region. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

Conditionals with conditional constituents pose challenges for _the Thesis_, the idea that the probability of a conditional is the corresponding conditional probability. This note is concerned with two proposals for overcoming those challenges, both inspired by early work of van Fraassen: the _Bernoulli Semantics_ associated with Stalnaker and Jeffrey, and augmented with a mechanism for obtaining “local probabilities” by Kaufmann; and a proposal by Bacon which I dub _Ordinal Semantics_. Despite differences in mathematical details and emphasis of presentation, both proposals (...) lend themselves for use as a basis for a modal-theoretic interpretation of embedded conditionals. The goal of this note is to compare the two frameworks by implementing a model for the interpretation of conditionals in each, based on the same underlying probability model for non-conditional sentences. I show that in the Ordinal model, certain sentences are assigned probabilities that do not accord with intuitions. This problem is familiar from the literature on Bernoulli models and can be addressed by introducing Kaufmann-style local probabilities into Ordinal models. I then show that Bernoulli Semantics has other limitations, in that it assigns probabilities in violation of the Thesis to certain very complex formulas. The upshot is that a fusion of the theories may be our best shot at getting the predictions right. (shrink)

In The Logic of Decision Richard Jeffrey defends a version of expected utility theory that advises agents to choose acts with an eye to securing evidence for thinking that desirable results will ensue. Proponents of "causal" decision theory have argued that Jeffrey's account is inadequate because it fails to properly discriminate the causal features of acts from their merely evidential properties. Jeffrey's approach has also been criticized on the grounds that it makes it impossible to extract a unique probability/utility representation (...) from a sufficiently rich system of preferences (given a zero and unit for measuring utility). The existence of these problems should not blind us to the fact that Jeffrey's system has advantages that no other decision theory can match: it can be underwritten by a particularly compelling representation theorem proved by Ethan Bolker; and it has a property called partition invariance that every reasonable theory of rational choice must possess. I shall argue that the non-uniqueness problem can be finessed, and that it is impossible to adequately formulate causal decision theory, or any other, without using Jeffrey's theory as one's basic analysis of rational desire. (shrink)

The authors outline a theory of conditionals of the form If A then C and If A then possibly C. The 2 sorts of conditional have separate core meanings that refer to sets of possibilities. Knowledge, pragmatics, and semantics can modulate these meanings. Modulation can add information about temporal and other relations between antecedent and consequent. It can also prevent the construction of possibilities to yield 10 distinct sets of possibilities to which conditionals can refer. The mental representation of a (...) conditional normally makes explicit only the possibilities in which its antecedent is true, yielding other possibilities implicitly. Reasoners tend to focus on the explicit possibilities. The theory predicts the major phenomena of understanding and reasoning with conditionals. (shrink)

The thesis of this paper is that we can justify induction deductively relative to one end, and deduction inductively relative to a different end. I will begin by presenting a contemporary variant of Hume ’s argument for the thesis that we cannot justify the principle of induction. Then I will criticize the responses the resulting problem of induction has received by Carnap and Goodman, as well as praise Reichenbach ’s approach. Some of these authors compare induction to deduction. Haack compares (...) deduction to induction, and I will critically discuss her argument for the thesis that we cannot justify the principles of deduction next. In concluding I will defend the thesis that we can justify induction deductively relative to one end, and deduction inductively relative to a different end, and that we can do so in a non-circular way. Along the way I will show how we can understand deductive and inductive logic as normative theories, and I will briefly sketch an argument to the effect that there are only hypothetical, but no categorical imperatives. (shrink)

‘Probability logic’ might seem like an oxymoron. Logic traditionally concerns matters immutable, necessary and certain, while probability concerns the uncertain, the random, the capricious. Yet our subject has a distinguished pedigree. Ramsey begins his classic “Truth and Probability” with the words: “In this essay the Theory of Probability is taken as a branch of logic. … “speaks of “the logic of the probable.” And more recently, regards probabilities as estimates of truth values, and thus probability theory as a natural outgrowth (...) of two‐valued logic—what he calls “probability logic.” However the point is put, probability theory and logic are clearly intimately related. This chapter explores some of the multifarious connections between probability and logic, and focuses on various philosophical issues in the foundations of probability theory. (shrink)

The so-called ‘Adams’ Thesis’ is often understood as the claim that the assertibility of an indicative conditional equals the corresponding conditional probability—schematically: $${({\rm AT})}\qquad\qquad\quad As(A\rightarrow B)=P({B|A}),{\rm provided}\quad P(A)\neq 0.$$ The Thesis is taken by many to be a touchstone of any theorizing about indicative conditionals. Yet it is unclear exactly what the Thesis is . I suggest some precise statements of it. I then rebut a number of arguments that have been given in its favor. Finally, I offer a new (...) argument against it. I appeal to an old triviality result of mine against ‘Stalnaker’s Thesis’ that the probability of a conditional equals the corresponding conditional probability. I showed that for all finite-ranged probability functions, there are strictly more distinct values of conditional probabilities than there are distinct values of probabilities of conditionals, so they cannot all be paired up as Stalnaker’s Thesis promises. Conditional probabilities are too fine-grained to coincide with probabilities of conditionals across the board. If the assertibilities of conditionals are to coincide with conditional probabilities across the board, then assertibilities must be finer-grained than probabilities. I contend that this is implausible—it is surely the other way round. I generalize this argument to other interpretations of ‘ As ’, including ‘acceptability’ and ‘assentability’. I find it hard to see how any such figure of merit for conditionals can systematically align with the corresponding conditional probabilities. (shrink)

The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas various reasons, old and new, why the thesis seems plausible, and why we should care about its fate. I will (...) look at some objections to Lewis’s famous triviality results, and thus some reasons for the pursuit of further triviality results. I will generalize Lewis’s results in ways that meet the objections. I will conclude with some reflections on the demise of the thesis—or otherwise. (shrink)

Kolmogorov''s axiomatization of probability includes the familiarratio formula for conditional probability: 0).$$ " align="middle" border="0">.