In this article, we address a major outstanding question of probabilistic Bayesian epistemology: how should a rational Bayesian agent update their beliefs upon learning an indicative conditional? A number of authors have recently contended that this question is fundamentally underdetermined by Bayesian norms, and hence that there is no single update procedure that rational agents are obliged to follow upon learning an indicative conditional. Here we resist this trend and argue that a core set of widely accepted Bayesian norms is (...) sufficient to identify a normatively privileged updating procedure for this kind of learning. Along the way, we justify a privileged formalization of the notion of ‘epistemic conservativity’, offer a new analysis of the Judy Benjamin problem, and emphasize the distinction between interpreting the content of new evidence and updating one’s beliefs on the basis of that content. (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)

I present two Triviality results for Kratzer's standard “restrictor” analysis of indicative conditionals. I both refine and undermine the common claim that problems of Triviality do not arise for Kratzer conditionals since they are not strictly conditionals at all.

This paper argues that several leading theories of subjunctive conditionals are incompatible with ordinary intuitions about what credences we ought to have in subjunctive conditionals. In short, our theory of subjunctives should intuitively display semantic humility, i.e. our semantic theory should deliver the truth conditions of sentences without pronouncing on whether those conditions actually obtain. In addition to describing intuitions about subjunctive conditionals, I argue that we can derive these ordinary intuitions from justified premises, and I answer a possible worry (...) for my derivation by refuting a subjunctive triviality result modeled on (Lewis 1976). I conclude that the debate over the correct theory of subjunctive conditionals requires settling meta-philosophical questions about the relative value of various virtues of first-order theories of subjunctive conditionals. (shrink)

We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

I argue that taking the Practical Conditionals Thesis seriously demands a new understanding of the semantics of such conditionals. Practical Conditionals Thesis: A practical conditional [if A][ought] expresses B’s conditional preferability given A Paul Weirich has argued that the conditional utility of a state of affairs B on A is to be identified as the degree to which it is desired under indicative supposition that A. Similarly, exploiting the PCT, I will argue that the proper analysis of indicative practical conditionals (...) is in terms of what is planned, desired, or preferred, given suppositional changes to an agent’s information. Implementing such a conception of conditional preference in a semantic analysis of indicative practical conditionals turns out to be incompatible with any approach which treats the indicative conditional as expressing non-vacuous universal quantification over some domain of relevant antecedent-possibilities. Such analyses, I argue, encode a fundamental misunderstanding of what it is to be best, given some condition. The analysis that does the best vis-à-vis the PCT is, instead, one that blends a Context-Shifty account of indicative antecedents with an Expressivistic, or non-propositional, treatment of their practical consequents. (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)

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)

According to the PCCP thesis, the probability of a conditional A → C is the conditional probability P. This claim is undermined by Lewis’ triviality results, which purport to show that apart from trivial cases, PCCP is not true. In the present article we show that the only rational, “Dutch Book-resistant” extension of the agent’s beliefs concerning non-conditional sentences A and C to the conditional A → C is by assuming that P = P. In other cases a diachronic Dutch (...) Book against the agent can be constructed. There is a tension between our findings and Lewis’ results, which needs to be explained. Therefore, we present a probability space which corresponds in a natural way to the diachronic Dutch Book—and which allows the conditional A → C to be interpreted as an event in a mathematically sound way. It also allows to formalize the notion of conditionalizing A → C on ¬C which plays a crucial role in Lewis’ proof. Our conclusion is that Lewis’ proof is circular, so it cannot be considered to be a sound argument against PCCP. (shrink)

One of central problems in the theory of conditionals is the construction of a probability space, where conditionals can be interpreted as events and assigned probabilities. The problem has been given a technical formulation by van Fraassen (23), who also discussed in great detail the solution in the form of Stalnaker Bernoulli spaces. These spaces are very complex – they have the cardinality of the continuum, even if the language is finite. A natural question is, therefore, whether a technically simpler (...) (in particular finite) partial construction can be given. In the paper we provide a new solution to the problem. We show how to construct a finite probability space $$\mathrm {S}^\#=\left(\mathrm\Omega^\#,\mathrm\Sigma^\#,\mathrm P^\#\right)$$ S # = Ω #, Σ #, P # in which simple conditionals and their Boolean combinations can be interpreted. The structure is minimal in terms of cardinality within a certain, naturally defined class of models – an interesting side-effect is an estimate of the number of non-equivalent propositions in the conditional language. We demand that the structure satisfy certain natural assumptions concerning the logic and semantics of conditionals and also that it satisfy PCCP. The construction can be easily iterated, producing interpretations for conditionals of arbitrary complexity. (shrink)

The chapter is devoted to the probability and acceptability of indicative conditionals. Focusing on three influential theses, the Equation, Adams’ thesis, and the qualitative version of Adams’ thesis, Sikorski argues that none of them is well supported by the available empirical evidence. In the most controversial case of the Equation, the results of many studies which support it are, at least to some degree, undermined by some recent experimental findings. Sikorski discusses the Ramsey Test, and Lewis’s triviality proof, with special (...) attention dedicated to the popular ways of blocking it. Sikorski concludes that the role of the three theses in future studies of conditionals should be re-thought, and he presents alternative proposals. (shrink)

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

This paper clarifies the relationship between the Triviality Results for the conditional and the Restrictor Theory of the conditional. On the understanding of Triviality proposed here, it is implausible—pace many proponents of the Restrictor Theory—that Triviality rests on a syntactic error. As argued here, Triviality arises from simply mistaking the feature a claim has when that claim is logically unacceptable for the feature a claim has when that claim is unsatisfiable. Triviality rests on a semantic confusion—one which some semantic theories, (...) but not others, are prone to making. On the interpretation proposed here, Triviality Results thus play a theoretically constructive role in the project of natural language semantics. (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)

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)

In my article, I present a new version of a probabilistic truth prescribing semantics for natural language indicative conditionals. The proposed truth conditions can be paraphrased as follows: an indicative conditional is true if the corresponding conditional probability is high and the antecedent is positively probabilistically relevant for the consequent or the probability of the antecedent of the conditional equals 0. In the paper, the truth conditions are defended and some of the logical properties of the proposed semantics are described.

This thesis is about indicative conditionals and apparent counterexamples to classically valid argument forms. Specifically, it applies the following four theories: - material (inspired by Grice (1961, 1975 and 1989)); - possible-worlds (inspired by Stalnaker (1981); Lewis (1976); and Kratzer (2012)), - suppositional (inspired by Adams (1975) and Edgington (1995 and 2014)); and - hybrid (inspired by Jackson (1987)) to try and solve the following two counterexamples: - Vann McGee’s to modus ponens (1985); and - Lewis Carroll’s to modus tollens (...) (1894). I argue that none of the theories I consider can explain – without facing any problems – the three individually plausible but jointly inconsistent theses that give rise to the apparent counterexamples. The three theses of the trilemma are the following: (1) the argument is invalid; (2) the argument is an instance of modus ponens or modus tollens; and (3) modus ponens or modus tollens is valid. (shrink)

The use of probability theory is widespread in our daily life as well as in scientific theories. In virtually all cases, calculations can be carried out within the framework of classical probability theory. A special exception is given by quantum mechanics, which gives rise to a new probability theory: quantum probability theory. This dissertation deals with the question of how this formalism can be understood from a philosophical and physical perspective. The dissertation is divided into three parts. In the first (...) part, the formalism of quantum probability theory and its relation to quantum mechanics is presented. The second part considers the possibility of reformulating quantum probability theory to embed it within classical probability. Mathematically, this possibility overlaps with the possibility of the existence of hidden variables theories of quantum mechanics: theories that attempt to solve fundamental problems in quantum mechanics by introducing additional physical properties of systems. The conclusion of this part is that, although classical reformulations of quantum probability theory are formally possible, they offer little insight into the formalism of quantum probability theory itself. The third part regards a more direct investigation of quantum probability theory. A reformulation of quantum probability theory is obtained by constructing a quantum logic on the basis of empirical non-probabilistic predictions of quantum mechanics. In this reformulation quantum probability functions are conditional probability functions on an algebra of propositions about measurements and measurement outcomes. (shrink)

In the paper, we provide a general formalism for computing probabilities of indicative conditionals. Our model is based on the idea of constructing a (labeled) Markov graph G(α), which models the sentence α, containing an arbitrarily complex conditional (exhibiting in particular its structure). The formalism makes computing these probabilities an easy task—it consists of solving simple systems of linear equations. The graph G(α) generates a canonical probability space S(α) = (Ωα, Σα, Pα), where α is given an interpretation as an (...) event so that the probability can be computed mathematically. We present a general inductive definition of the graph G(α) for a sentence α of arbitrary complexity. It is based on the idea of defining graph-building operations which correspond to the negation and conjunction and the non-Boolean conditional connective →. The definition enables the construction of graphs and the corresponding systems of equations for arbitrarily complex conditionals in an algorithmic and efficient manner. (shrink)

It is commonly believed that the role of context cannot be ignored in the analysis of conditionals, and counterfactuals in particular. On truth conditional accounts involving possible worlds semantics, conditionals have been analysed as expressions of relative necessity: “If A, then B” is true at some world w if B is true at all the A-worlds deemed relevant to the evaluation of the conditional at w. A drawback of this approach is that for the evaluation of conditionals with the same (...) antecedents at some world, the same worlds are deemed as relevant for all occasions of utterance. But surely this is inadequate, if shifts of contexts between occasions are to be accounted for. Both the linguistic and logical implications of this defect are discussed, and in order to overcome it a modification of David Lewis’ ordering semantics for counterfactuals is developed for a modified language. I follow Lewis by letting contexts determine comparative similarity assignments, and show that the addition of syntactic context parameters (context indices) to the language gives the freedom required to switch between sets of relevant antecedent worlds from occasion to occasion by choosing the corresponding similarity assignment accordingly. Thus an account that extends Lewis’ analysis of a language containing a single counterfactual connective > to a language containing infinitely many counterfactual connectives >_c, each indexed by a different context name c, overcomes the limitations of traditional analyses. Finally it is also shown that these traditional accounts can be recovered from the modified account if certain contextual restrictions are in place. -/- . (shrink)