Objective Bayesianism has been criticised on the grounds that objective Bayesian updating, which on a finite outcome space appeals to the maximum entropy principle, differs from Bayesian conditionalisation. The main task of this paper is to show that this objection backfires: the difference between the two forms of updating reflects negatively on Bayesian conditionalisation rather than on objective Bayesian updating. The paper also reviews some existing criticisms and justifications of conditionalisation, arguing in particular that the diachronic Dutch book justification fails (...) because diachronic Dutch book arguments are subject to a reductio: in certain circumstances one can Dutch book an agent however she changes her degrees of belief . One may also criticise objective Bayesianism on the grounds that its norms are not compulsory but voluntary, the result of a stance. It is argued that this second objection also misses the mark, since objective Bayesian norms are tied up in the very notion of degrees of belief. (shrink)

Bayesian probability is normally defined over a fixed language or eventspace. But in practice language is susceptible to change, and thequestion naturally arises as to how Bayesian degrees of belief shouldchange as language changes. I argue here that this question poses aserious challenge to Bayesianism. The Bayesian may be able to meet thischallenge however, and I outline a practical method for changing degreesof belief over changes in finite propositional languages.

. The uniform prior distribution is often seen as a mathematical description of noninformativeness. This paper uses the well-known Three Prisoners Paradox to examine the impossibility of maintaining noninformativeness throughout hierarchization. The Paradox has been solved by Bayesian conditioning over the choice made by the Warder when asked to name a prisoner who will be shot. We generalize the paradox to situations of N prisoners, k executions and m announcements made by the Warder. We then extend the consequences of hierarchically (...) placing uniform and symmetrical priors for the probability p of the Warder naming Prisoner B, say. We prove that breaks of indifference and neutrality caused by assignment of uniform and symmetrical priors in lieu of degenerate indifference probabilities hold in general. Speaking of unknown probabilities or of probability of a probability must be forbidden as meaningless. Bruno de Finetti, 1977 I regard the use of hierarchical chains as a technique helping you to sharpen your subjective probabilities. I. J. Good, 1981. (shrink)

The Bayes Blind Spot of a Bayesian Agent is, by definition, the set of probability measures on a Boolean σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}-algebra that are absolutely continuous with respect to the background probability measure of a Bayesian Agent on the algebra and which the Bayesian Agent cannot learn by a single conditionalization no matter what evidence he has about the elements in the Boolean σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma (...) $$\end{document}-algebra. It is shown that if the Boolean algebra is finite, then the Bayes Blind Spot is a very large set: it has the same cardinality as the set of all probability measures ; it has the same measure as the measure of the set of all probability measures ; and is a “fat” set in topological sense in the set of all probability measures taken with its natural topology. Features of the Bayes Blind Spot are determined from the perspective of repeated Bayesian learning when the Boolean algebra is finite. Open problems about the Bayes Blind Spot are formulated in probability spaces with infinite Boolean σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}-algebras. The results are discussed from the perspective of Bayesianism. (shrink)

We consider here an important family of conditional bets, those that proceed to settlement if and only if some agreed evidence is received that a condition has been met. Despite an opinion widespread in the literature, we observe that when the evidence is strong enough to generate certainty as to whether the condition has been met or not, using traditional conditional probabilities for such bets will NOT preserve a gambler from having a synchronic Dutch Book imposed upon him. On the (...) contrary (I show) the gambler can be Dutch-Booked if his betting ratios ever depart from a rather different probability, one that involves the probability of the agreed evidence being provided. We note furthermore that this same alternative probability assessment is necessary if the evidence is weaker (i.e. if it fails to provide knowledge whether or not the condition has been met.) By contrast, some of the (rather different) probability assessments proposed by Jeffrey, precisely for such situations, still expose the gambler to a Dutch-Book. (shrink)

This paper argues that Ramsey's view of the calculus of subjective probabilities as, in effect, logical axioms is the correct view, with powerful heuristic value. This heuristic value is seen particularly in the analysis of the role of conditionalization in the Bayesian theory, where a semantic criterion of synchronic coherence is employed as the test of soundness, which the traditional formulation of conditionalization fails. On the other hand, there is a generally sound rule which supports conditionalization in appropriate contexts, though (...) these contexts are not universal. This sound Bayesian rule is seen to be analogous in certain respects to the deductive rule of modus ponens. (shrink)

Several leading topics outstanding after John Earman's Bayes or Bust? are investigated further, with emphasis on the relevance of Bayesian explication in epistemology of science, despite certain limitations. (1) Dutch Book arguments are reformulated so that their independence from utility and preference in epistemic contexts is evident. (2) The Bayesian analysis of the Quine-Duhem problem is pursued; the phenomenon of a "protective belt" of auxiliary statements around reasonably successful theories is explicated. (3) The Bayesian approach to understanding the superiority of (...) variety of evidence is pursued; a recent challenge (by Wayne) is converted into a positive result on behalf of the Bayesian analysis, potentially with far-reaching consequences. (4) The condition for applying the merger-of-opinion results and the thesis of underdetermination of theories are compared, revealing significant limitations in applicability of the former. (5) Implications concerning "diachronic Dutch Book" arguments and "non-Bayesian shifts" are drawn, highlighting the incompleteness, but not incorrectness, of Bayesian analysis. (shrink)

We continue the investigations initiated in the recent papers where Bayes logics have been introduced to study the general laws of Bayesian belief revision. In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using the Bayes rule. In this paper we take the more general Jeffrey formula as a conditioning device and study the corresponding modal logics that we call Jeffrey logics, focusing mainly on the countable case. The containment relations among (...) these modal logics are determined and it is shown that the logic of Bayes and Jeffrey updating are very close. It is shown that the modal logic of belief revision determined by probabilities on a finite or countably infinite set of elementary propositions is not finitely axiomatizable. The significance of this result is that it clearly indicates that axiomatic approaches to belief revision might be severely limited. (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)

According to Stalnaker’s Hypothesis, the probability of an indicative conditional, $\Pr(\varphi \rightarrow \psi),$ equals the probability of the consequent conditional on its antecedent, $\Pr(\psi | \varphi)$ . While the hypothesis is generally taken to have been conclusively refuted by Lewis’ and others’ triviality arguments, its descriptive adequacy has been confirmed in many experimental studies. In this paper, we consider some possible ways of resolving the apparent tension between the analytical and the empirical results relating to Stalnaker’s Hypothesis and we argue (...) that none offer a satisfactory resolution. (shrink)

Richard Jeffrey regarded the version of Bayesian decision theory he floated in ‘The Logic of Decision’ and the idea of a probability kinematics—a generalisation of Bayesian conditioning to contexts in which the evidence is ‘uncertain’—as his two most important contributions to philosophy. This paper aims to connect them by developing kinematical models for the study of preference change and practical deliberation. Preference change is treated in a manner analogous to Jeffrey’s handling of belief change: not as mechanical outputs of combinations (...) of intrinsic desires plus information, but as a matter of judgement and of making up one’s mind. In the first section Jeffrey’s probability kinematics is motivated and extended to the treatment of changes in conditional belief. In the second, analogous kinematical models are developed for preference change and in particular belief-induced change that depends on an invariance condition for conditional preference. The two are the brought together in the last section in a tentative model of pratical deliberation. (shrink)

Richard Jeffrey espoused an antifoundationalist variant of Bayesian thinking that he termed ‘Radical Probabilism’. Radical Probabilism denies both the existence of an ideal, unbiased starting point for our attempts to learn about the world and the dogma of classical Bayesianism that the only justified change of belief is one based on the learning of certainties. Probabilistic judgment is basic and irreducible. Bayesian conditioning is appropriate when interaction with the environment yields new certainty of belief in some proposition but leaves one’s (...) conditional beliefs untouched (the ‘Rigidity’ condition). Although Richard Jeffrey denied the general applicability of this condition, one of his main contributions to probabilistic thinking is a form of belief updating—now typically called ‘Jeffrey conditioning’ or ‘probability kinematics’—that is appropriate in circumstances in which Rigidity is satisfied, but where the interaction causes one to reevaluate one’s probability judgments over some partition of the possibility space without conferring certainty on any particular element. The most familiar occasion for Jeffrey conditioning is receipt of uncertain evidence: things partially perceived or remembered. But it also serves to illuminate belief updating occasioned by a change in one’s degrees of conditional belief, a kind of belief change largely ignored by classical Bayesianism. I argue that such changes in conditional belief can also be basic (in the sense of not being analyzable as a consequence of conditioning on factual information) and offer a kinematical model for a particular kind change in conditional belief. Both are applied to changes in preference. Finally, I argue that Rigidity can fail when changes of belief give inferential grounds for changes in conditional belief (and vice versa). These failures show that conditioning methods are properly regarded, not as valid rules of inference, but as tools in the ‘art of judgment’. (shrink)

Bayesian Epistemology is a general framework for thinking about agents who have beliefs that come in degrees. Theories in this framework give accounts of rational belief and rational belief change, which share two key features: (i) rational belief states are represented with probability functions, and (ii) rational belief change results from the acquisition of evidence. This dissertation focuses specifically on the second feature. I pose the Evidence Question: What is it to have evidence? Before addressing this question we must have (...) an understanding of Bayesian Epistemology. The first chapter argues that we should understand Bayesian Epistemology as giving us theories that are evaluative and not action-guiding. I reach this verdict after considering the popular ‘ought’-implies-‘can’ objection to Bayesian Epistemology. The second chapter argues that it is important for theories in Bayesian Epistemology to answer the Evidence Question, and distinguishes between internalist and externalist answers. The third and fourth chapters present and defend a specific answer to the Evidence Question. The account is inspired by reliabilist accounts of justification, and attempts to understand what it is to have evidence by appealing solely to considerations of reliability. Chapter 3 explains how to understand reliability, and how the account fits with Bayesian Epistemology, in particular, the requirement that an agent’s evidence receive probability 1. Chapter 4 responds to objections, which maintain that the account gives the wrong verdict in a variety of situations including skeptical scenarios, lottery cases, scientific cases, and cases involving inference. After slight modifications, I argue that my account has the resources to answer the objections. The fifth chapter considers the possibility of losing evidence. I show how my account can model these cases. To do so, however, we require a modification to Conditionalization, the orthodox principle governing belief change. I present such a modification. The sixth and seventh chapters propose a new understanding of Dutch Book Arguments, historically important arguments for Bayesian principles. The proposal shows that the Dutch Book Arguments for implausible principles are defective, while the ones for plausible principles are not. The final chapter is a conclusion. (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)