This paper discusses conditional probability $$P$$ P , or the probability of A given B. When $$P>0$$ P > 0 , the ratio formula determines $$P$$ P . When $$P=0$$ P = 0 , the ratio formula breaks down. The Borel–Kolmogorov paradox suggests that conditional probabilities in such cases are indeterminate or ill-posed. To analyze the paradox, I explore the relation between probability and intensionality. I argue that the paradox is a Frege case, similar to those that arise in many (...) probabilistic and non-probabilistic contexts. The paradox vividly illustrates how an agent’s way of representing an entity can rationally influence her credal assignments. I deploy my analysis to defend Kolmogorov’s relativistic treatment of conditional probability. (shrink)

This paper discusses how to update one’s credences based on evidence that has initial probability 0. I advance a diachronic norm, Kolmogorov Conditionalization, that governs credal reallocation in many such learning scenarios. The norm is based upon Kolmogorov’s theory of conditional probability. I prove a Dutch book theorem and converse Dutch book theorem for Kolmogorov Conditionalization. The two theorems establish Kolmogorov Conditionalization as the unique credal reallocation rule that avoids a sure loss in the relevant learning scenarios.

It is shown that by realizing the isomorphism features of the frequency and geometric interpretations of probability, Reichenbach comes very close to the idea of identifying mathematical probability theory with measure theory in his 1949 work on foundations of probability. Some general features of Reichenbach’s axiomatization of probability theory are pointed out as likely obstacles that prevented him making this conceptual move. The role of isomorphisms of Kolmogorovian probability measure spaces is specified in what we call the “Maxim of Probabilism”, (...) which states that a necessary condition for a concept to be probabilistic is its invariance with respect to measure-theoretic isomorphisms. The functioning of the Maxim of Probabilism is illustrated by the example of conditioning via conditional expectations. (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)

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

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)

We investigate the general properties of general Bayesian learning, where “general Bayesian learning” means inferring a state from another that is regarded as evidence, and where the inference is conditionalizing the evidence using the conditional expectation determined by a reference probability measure representing the background subjective degrees of belief of a Bayesian Agent performing the inference. States are linear functionals that encode probability measures by assigning expectation values to random variables via integrating them with respect to the probability measure. If (...) a state can be learned from another this way, then it is said to be Bayes accessible from the evidence. It is shown that the Bayes accessibility relation is reflexive, antisymmetric and non-transitive. If every state is Bayes accessible from some other defined on the same set of random variables, then the set of states is called weakly Bayes connected. It is shown that the set of states is not weakly Bayes connected if the probability space is standard. The set of states is called weakly Bayes connectable if, given any state, the probability space can be extended in such a way that the given state becomes Bayes accessible from some other state in the extended space. It is shown that probability spaces are weakly Bayes connectable. Since conditioning using the theory of conditional expectations includes both Bayes’ rule and Jeffrey conditionalization as special cases, the results presented generalize substantially some results obtained earlier for Jeffrey conditionalization. (shrink)

Philosophers cannot agree on whether the rule of Countable Additivity should be an axiom of probability. Edwin T. Jaynes attacks the problem in a way which is original to him and passed over in the current debate about the principle: he says the debate only arises because of an erroneous use of mathematical infinity. I argue that this solution fails, but I construct a different argument which, I argue, salvages the spirit of the more general point Jaynes makes. I argue (...) that in Jaynes’s objective Bayesianism we might have good reasons to adopt Countable Additivity, and some of the major problems this adoption is known to entail need not worry us. In particular, I propose to adopt this new angle on Countable Additivity in Jon Williamson’s version of objective Bayesianism. (shrink)

David Builes presents a paradox concerning how confident you should be that any given member of an infinite collection of fair coins landed heads, conditional on the information that they were all flipped and only finitely many of them landed heads. We argue that if you should have any conditional credence at all, it should be 1/2.

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)