Isn't probability 1 certainty? If the probability is objective, so is the certainty: whatever has chance 1 of occurring is certain to occur. Equivalently, whatever has chance 0 of occurring is certain not to occur. If the probability is subjective, so is the certainty: if you give credence 1 to an event, you are certain that it will occur. Equivalently, if you give credence 0 to an event, you are certain that it will not occur. And so on for other (...) kinds of probability, such as evidential probability. The formal analogue of this picture is the regularity constraint: a probability distribution over sets of possibilities is regular just in case it assigns probability 0 only to the null set, and therefore probability 1 only to the set of all possibilities. (shrink)

In a recent paper, Yoaav Isaacs, Alan Hájek, and John Hawthorne argue for the rational permissibility of "credal imprecision" by appealing to certain propositions associated with non-measurable spatial regions: for example, the proposition that the pointer of a spinner will come to rest within a certain non-measurable set of points on its circumference. This paper rebuts their argument by showing that its premises lead to implausible consequences in cases where one is trying to learn, by making multiple observations, whether a (...) certain outcome is associated with a non-measurable region or a measurable one. (shrink)

Our evidence can be about different subject matters. In fact, necessarily equivalent pieces of evidence can be about different subject matters. Does the hyperintensionality of ‘aboutness’ engender any hyperintensionality at the level of rational credence? In this paper, I present a case which seems to suggest that the answer is ‘yes’. In particular, I argue that our intuitive notions of independent evidence and inadmissible evidence are sensitive to aboutness in a hyperintensional way. We are thus left with a paradox. While (...) there is strong reason to think that rational credence cannot make such hyperintensional distinctions, our intuitive judgements about certain cases seem to demand that it does. (shrink)

The Borel–Kolmogorov Paradox is typically taken to highlight a tension between our intuition that certain conditional probabilities with respect to probability zero conditioning events are well defined and the mathematical definition of conditional probability by Bayes’ formula, which loses its meaning when the conditioning event has probability zero. We argue in this paper that the theory of conditional expectations is the proper mathematical device to conditionalize and that this theory allows conditionalization with respect to probability zero events. The conditional probabilities (...) on probability zero events in the Borel–Kolmogorov Paradox also can be calculated using conditional expectations. The alleged clash arising from the fact that one obtains different values for the conditional probabilities on probability zero events depending on what conditional expectation one uses to calculate them is resolved by showing that the different conditional probabilities obtained using different conditional expectations cannot be interpreted as calculating in different parametrizations of the conditional probabilities of the same event with respect to the same conditioning conditions. We conclude that there is no clash between the correct intuition about what the conditional probabilities with respect to probability zero events are and the technically proper concept of conditionalization via conditional expectations—the Borel–Kolmogorov Paradox is just a pseudo-paradox. (shrink)

The standard treatment of conditional probability leaves conditional probability undefined when the conditioning proposition has zero probability. Nonetheless, some find the option of extending the scope of conditional probability to include zero-probability conditions attractive or even compelling. This article reviews some of the pitfalls associated with this move, and concludes that, for the most part, probabilities conditional on zero-probability propositions are more trouble than they are worth.

Philosophers typically rely on intuitions when providing a semantics for counterfactual conditionals. However, intuitions regarding counterfactual conditionals are notoriously shaky. The aim of this paper is to provide a principled account of the semantics of counterfactual conditionals. This principled account is provided by what I dub the Royal Rule, a deterministic analogue of the Principal Principle relating chance and credence. The Royal Rule says that an ideal doxastic agent’s initial grade of disbelief in a proposition \(A\) , given that the (...) counterfactual distance in a given context to the closest \(A\) -worlds equals \(n\) , and no further information that is not admissible in this context, should equal \(n\) . Under the two assumptions that the presuppositions of a given context are admissible in this context, and that the theory of deterministic alethic or metaphysical modality is admissible in any context, it follows that the counterfactual distance distribution in a given context has the structure of a ranking function. The basic conditional logic V is shown to be sound and complete with respect to the resulting rank-theoretic semantics of counterfactuals. (shrink)

Orthodox Bayesianism endorses revising by conditionalization. This paper investigates the zero-raising problem, or equivalently the certainty-dropping problem of orthodox Bayesianism: previously neglected possibilities remain neglected, although the new evidence might suggest otherwise. Yet, one may want to model open-minded agents, that is, agents capable of raising previously neglected possibilities. Different reasons can be given for open-mindedness, one of which is fallibilism. The paper proposes a family of open-minded propositional revisions depending on a parameter ϵ. The basic idea is this: first (...) extend the prior to the newly suggested possibilities by mixing the prior with the uniform probability on these possibilities, then conditionalize. This may put the agent back on the right track when her beliefs or evidence happen to be false. The paper justifies this family of equivocal epsilon-conditionalizations as minimal non-biased open-minded modifications of conditionalization. Several variations are discussed, such as mixing with an ad hoc or silent prior instead of the uniform prior, and a generalization to probabilistic information is given. The approach is compared to other accounts, such as Jeffrey’s Bayesianism, Gärdenfors’s probabilistic revision, maximizing entropy, and minimal revision. _1_ Introduction _2_ Downsides of Certainty Conservation _3_ Why Raise Zeros? _3.1_ Accuracy defects _3.2_ Fallibilism and dissolutions _3.3_ Weak fallibilism and partial solutions _4_ Epsilon-Conditionalization _4.1_ Definitions _4.2_ Revision types and information assumptions _4.3_ Epsilon interpretation and flavours _5_ Justifications _5.1_ Open-minded orthodox Bayesianism _5.2_ Minimal revision _5.3_ Transitivity _6_ Conclusion Appendix. (shrink)

The question I am addressing in this paper is the following: how is it possible to empirically test, or confirm, counterfactuals? After motivating this question in Section 1, I will look at two approaches to counterfactuals, and at how counterfactuals can be empirically tested, or confirmed, if at all, on these accounts in Section 2. I will then digress into the philosophy of probability in Section 3. The reason for this digression is that I want to use the way observable (...) absolute and relative frequencies, two empirical notions, are used to empirically test, or confirm, hypotheses about objective chances, a metaphysical notion, as a role-model. Specifically, I want to use this probabilistic account of the testing of chance hypotheses as a role-model for the account of the testing of counterfactuals, another metaphysical notion, that I will present in Sections 4 to 8. I will conclude by comparing my proposal to one non-probabilistic and one probabilistic alternative in Section 9. (shrink)

Branden Fitelson and Alan Hájek have suggested that it is finally time for a “revolution” in which we jettison Kolmogorov’s axiomatization of probability, and move to an alternative like Popper’s. According to these authors, not only did Kolmogorov fail to give an adequate analysis of conditional probability, he also failed to give an adequate account of another central notion in probability theory: probabilistic independence. This paper defends Kolmogorov, with a focus on this independence charge. I show that Kolmogorov’s sophisticated theory (...) of conditional distributions, advocated by authors such as Kenny Easwaran but often overlooked by philosophers, has the resources to define the notion of independence Fitelson and Hájek seek. I then argue that Kolmogorov’s original definition of independence, once suitably reinterpreted as capturing a slight logical weakening of this notion, is not so problematic after all. Indeed, rather than discarding Kolmogorov’s definition, we should make room for two distinct notions of probabilistic independence, one stronger and one weaker, which play different theoretical roles. (shrink)

Bayesians since Savage (1972) have appealed to asymptotic results to counter charges of excessive subjectivity. Their claim is that objectionable differences in prior probability judgments will vanish as agents learn from evidence, and individual agents will converge to the truth. Glymour (1980), Earman (1992) and others have voiced the complaint that the theorems used to support these claims tell us, not how probabilities updated on evidence will actually}behave in the limit, but merely how Bayesian agents believe they will behave, suggesting (...) that the theorems are too weak to underwrite notions of scientific objectivity and intersubjective agreement. I investigate, in a very general framework, the conditions under which updated probabilities actually converge to a settled opinion and the conditions under which the updated probabilities of two agents actually converge to the same settled opinion. I call this mode of convergence deterministic, and derive results that extend those found in Huttegger (2015b). The results here lead to a simple characterization of deterministic convergence for Bayesian learners and give rise to an interesting argument for what I call strong regularity, the view that probabilities of non-empty events should be bounded away from zero. (shrink)

Bayesian epistemology has close connections to inductive reasoning, accepting the view that inductive inferences should be analyzed in terms of epistemic probabilities. An important precept of Bayesian epistemology is the dynamics of belief change, with change in belief resulting from updating procedures based on new evidence. The inductive relations between evidence E and hypotheses or theories H are essential, particularly the notions of plausibility, confirmation, and acceptability, which are critical but subject to several difficulties. As a non-deductive process, Bayesian reasoning (...) cannot itself be subjected to strict deductive logic, but it can take advantage of an enabling logical environment. The present paper proposes that paraconsistent and paracomplete logics can be helpful for some questions of Bayesian epistemology, even to the point of being relevant in developing a legitimate paraconsistent Bayesian epistemology. By developing a novel probability theory based on the Logic of Evidence and Truth ( $${LET}_{F}$$ ), a logic that deals with evidence for or against a judgment, including contradictory or missing evidence, we allow for the possibility of quantifying the degree of evidence attributed to a proposition through novel probability measures. We illustrate, through examples, some ways to address challenging problems in the area by using paraconsistent and paracomplete paradigms. This topic is of significant interest not only in the philosophy of science but also in Artificial Intelligence and other emerging trends such as probabilistic networks and related models (see Haenni et al. Probabilistic logics and probabilistic networks, volume 350, Springer, Berlin, 2010). (shrink)

Rational agents seem more confident in any possible event than in an impossible event. But if rational credences are real-valued, then there are some possible events that are assigned 0 credence nonetheless. How do we differentiate these events from impossible events then when we order events? de Finetti (1975), Hájek (2012) and Easwaran (2014) suggest that when ordering events, conditional credences and subset relations are as relevant as unconditional credences. I present a counterexample to all their proposals in this paper. (...) While their proposals order possible and impossible events correctly, they deliver the wrong verdict for disjoint possible events assigned equal positive credence. (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)

Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of “probabilistic” semantics are often motivated by their ability to explain intuitions about inferences involving “likely” and “probably”—intuitions that Angelika Kratzer’s canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to (...) undercut this motivation: they present a world-ordering semantics that yields essentially the same logic as probabilistic semantics. In this paper, I argue that the challenge remains: defenders of world-ordering semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood. Holliday & Icard’s semantics yields an adequate logic only if models are restricted to Noetherian pre-orders. But I argue that the Noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities. As a result, probabilistic semantics remains the better explanation of the data. (shrink)

Consider a language SL having as its primitive signs one or more atomic statements, the two connectives ‘∼’ and ‘&,’ and the two parentheses ‘’; and presume the extra connectives ‘V’ and ‘≡’ defined in the customary manner. With the statements of SL substituting for sets, and the three connectives ‘∼,’ ‘&,’and ‘V’ substituting for the complementation, intersection, and union signs, the constraints that Kolmogorov places in [1] on probability functions come to read:K1. 0 ≤ P,K2. P) = 1,K3. If (...) ⊦ ∼, then P = P + P,K4. If ⊦ A ≡ B, then P = P.2. (shrink)

Probability and logic are two branches of mathematics that have important philosophical applications. This article discusses several areas of intersection between them. Several involve the role for probability in giving semantics for logic or the role of logic in governing assignments of probability. Some involve probability over non-classical logic or self-referential sentences.

One hears increasingly from philosophers that statistical inference is a technical study that is well in control by statisticians and should be left to them; and one hears, increasingly, from mathematical statisticians that all this talk about interpretations of probability is so much philosophical frosting that is utterly irrelevant to the serious business of producing mathematical statistics. "The more interpretations of probability there are, the wider the scope of applications of our purely mathematical theories." The point of this paper is (...) to present, in detail, a situation in which an individual with given degrees of belief, given evidence, and given values, will have three different and contrary courses of action recommended to him, each according to one of the three most popular interpretations of probability. (shrink)

The logical independence of two statements is tantamount to their probabilistic independence, the latter understood in a sense that derives from stochastic independence. And analogous logical and probabilistic senses of having the same factual content similarly coincide. These results are extended to notions of non-symmetrical independence and independence among more than two statements.

This essay describes a variety of contributions which relate to the connection of probability with logic. Some are grand attempts at providing a logical foundation for probability and inductive inference. Others are concerned with probabilistic inference or, more generally, with the transmittance of probability through the structure (logical syntax) of language. In this latter context probability is considered as a semantic notion playing the same role as does truth value in conventional logic. At the conclusion of the essay two fully (...) elaborated semantically based constructions of probability logic are presented. (shrink)