The question of coherence of rules for changing degrees of belief in the light of new evidence is studied, with special attention being given to cases in which evidence is uncertain. Belief change by the rule of conditionalization on an appropriate proposition and belief change by "probability kinematics" on an appropriate partition are shown to have like status.

Theories of subjective probability are viewed as formal languages for analyzing evidence and expressing degrees of belief. This article focuses on two probability langauges, the Bayesian language and the language of belief functions (Shafer, 1976). We describe and compare the semantics (i.e., the meaning of the scale) and the syntax (i.e., the formal calculus) of these languages. We also investigate some of the designs for probability judgment afforded by the two languages.

Richard Jeffrey's generalization of Bayes' rule of conditioning follows, within the theory of belief functions, from Dempster's rule of combination and the rule of minimal extension. Both Jeffrey's rule and the theory of belief functions can and should be construed constructively, rather than normatively or descriptively. The theory of belief functions gives a more thorough analysis of how beliefs might be constructed than Jeffrey's rule does. The inadequacy of Bayesian conditioning is much more general than Jeffrey's examples of uncertain perception (...) might suggest. The ``parameter α '' that Hartry Field has introduced into Jeffrey's rule corresponds to the "weight of evidence" of the theory of belief functions. (shrink)

I defend a general rule for updating beliefs that takes into account both the impact of new evidence and changes in the subject’s location. The rule combines standard conditioning with a shifting operation that moves the center of each doxastic possibility forward to the next point where information arrives. I show that well-known arguments for conditioning lead to this combination when centered information is taken into account. I also discuss how my proposal relates to other recent proposals, what results it (...) delivers for puzzles like the Sleeping Beauty problem, and whether there are diachronic constraints on rational belief at all. (shrink)

A paper on how to adapt your probabilisitc beliefs when learning a conditional.

Conditionalization is a norm that governs the rational reallocation of credence. I distinguish between factive and non-factive formulations of Conditionalization. Factive formulations assume that the conditioning proposition is true. Non-factive formulations allow that the conditioning proposition may be false. I argue that non-factive formulations provide a better foundation for philosophical and scientific applications of Bayesian decision theory. I furthermore argue that previous formulations of Conditionalization, factive and non-factive alike, have almost universally ignored, downplayed, or mishandled a crucial causal aspect of (...) Conditionalization. To formulate Conditionalization adequately, one must explicitly address the causal structure of the transition from old credences to new credences. I offer a formulation of Conditionalization that takes these considerations into account, and I compare my preferred formulation with some prominent formulations found in the literature. (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)

Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using both the Shannon entropy measure (...) as well as the Hartley entropy measure, with an aim to avoid excessive loss of beliefs that full meet contraction entails. (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)

This paper focuses on radical pooling, or the question of how to aggregate credences when there is a fundamental disagreement about which is the relevant logical space for inquiry. The solution advanced is based on the notion of consensus as common ground, where agents can find it by suspending judgment on logical possibilities. This is exemplified with cases of scientific revolution. On a formal level, the proposal uses algebraic joins and imprecise probabilities; which is shown to be compatible with the (...) principles of marginalization, rigidity, reverse bayesianism, and minimum divergence commonly endorsed in these contexts. Furthermore, I extend results from previous work by to show that pooling sets of imprecise probabilities can satisfy important pooling axioms. (shrink)

In a recent paper, Pettigrew argues that the pragmatic and epistemic arguments for Bayesian updating are based on an unwarranted assumption, which he calls deterministic updating, and which says that your updating plan should be deterministic. In that paper, Pettigrew did not consider whether the symmetry arguments due to Hughes and van Fraassen make the same assumption Scientific inquiry in philosophical perspective. University Press of America, Lanham, pp. 183–223, 1987). In this note, I show that they do.

In this paper, we explore how we should aggregate the degrees of belief of a group of agents to give a single coherent set of degrees of belief, when at least some of those agents might be probabilistically incoherent. There are a number of ways of aggregating degrees of belief, and there are a number of ways of fixing incoherent degrees of belief. When we have picked one of each, should we aggregate first and then fix, or fix first and (...) then aggregate? Or should we try to do both at once? And when do these different procedures agree with one another? In this paper, we focus particularly on the final question. (shrink)

Traditional procedures for rational updating fail when it comes to self-locating opinions, such as your credences about where you are and what time it is. This paper develops an updating procedure for rational agents with self-locating beliefs. In short, I argue that rational updating can be factored into two steps. The first step uses information you recall from your previous self to form a hypothetical credence distribution, and the second step changes this hypothetical distribution to reflect information you have genuinely (...) learned as time has passed. While the second step resembles traditional procedures of updating by conditionalization, the first is best understood by analogy to traditional models of how agents transmit self-locating opinions through ordinary interpersonal communication. (shrink)

This paper discusses simultaneous belief updates. I argue here that modeling such belief updates using the Principle of Minimum Information can be regarded as applying Jeffrey conditionalization successively, and so that, contrary to what many probabilists have thought, the simultaneous belief updates can be successfully modeled by means of Jeffrey conditionalization.

This paper argues that just as full beliefs can constitute knowledge, so can properties of your credence distribution. The resulting notion of probabilistic knowledge helps us give a natural account of knowledge ascriptions embedding language of subjective uncertainty, and a simple diagnosis of probabilistic analogs of Gettier cases. Just like propositional knowledge, probabilistic knowledge is factive, safe, and sensitive. And it helps us build knowledge-based norms of action without accepting implausible semantic assumptions or endorsing the claim that knowledge is interest-relative.

Jeffrey conditionalization is a rule for updating degrees of belief in light of uncertain evidence. It is usually assumed that the partitions involved in Jeffrey conditionalization are finite and only contain positive-credence elements. But there are interesting examples, involving continuous quantities, in which this is not the case. Q1 Can Jeffrey conditionalization be generalized to accommodate continuous cases? Meanwhile, several authors, such as Kenny Easwaran and Michael Rescorla, have been interested in Kolmogorov’s theory of regular conditional distributions as a possible (...) framework for conditional probability which handles probability-zero events. However the theory faces a major shortcoming: it seems messy and ad hoc. Q2 Is there some axiomatic theory which would justify and constrain the use of rcds, thus serving as a possible foundation for conditional probability? These two questions appear unrelated, but they are not, and this paper answers both. We show that when one appropriately generalizes Jeffrey conditionalization as in Q1, one obtains a framework which necessitates the use of rcds. It is then a short step to develop a general theory which addresses Q2, which we call the theory of extensions. The theory is a formal model of conditioning which recovers Bayesian conditionalization, Jeffrey conditionalization, and conditionalization via rcds as special cases. (shrink)

Richard Jeffrey developed the formula for probability kinematics with the intent that it would show that strong foundations are epistemologically unnecessary. But the reasons that support strong foundationalism are considerations of dynamics rather than kinematics. The strong foundationalist is concerned with the origin of epistemic force; showing how epistemic force is propagated therefore cannot undermine his position. The weakness of personalism is evident in the difficulty the personalist has in giving a principled answer to the question of when the conditions (...) for the application of the kinematic formula—the rigidity of the posteriors—are fulfilled, a problem made intractable by the personalist commitment to treating changes in intermediate probability as unexplained surds. Because the strong foundationalist admits changes in the intermediate probability of propositions only when there is some change in the foundations, he can avail himself of ananswer to the problem of the rigidity of the posteriors which the personalist cannot regard as complete. While probability kinematics does not make certain foundations unnecessary, the possession of certain foundations also does not make the probability kinematics formula superfluous. The formula allowsus to model the indirect routes by which the foundations influence various non-foundational propositions in the probability distribution. (shrink)

Sometimes we receive evidence in a form that standard conditioning (or Jeffrey conditioning) cannot accommodate. The principle of maximum entropy (MAXENT) provides a unique solution for the posterior probability distribution based on the intuition that the information gain consistent with assumptions and evidence should be minimal. Opponents of objective methods to determine these probabilities prominently cite van Fraassen’s Judy Benjamin case to undermine the generality of maxent. This article shows that an intuitive approach to Judy Benjamin’s case supports maxent. This (...) is surprising because based on independence assumptions the anticipated result is that it would support the opponents. It also demonstrates that opponents improperly apply independence assumptions to the problem. (shrink)

This paper seeks to defend the following conclusions: The program advanced by Carnap and other necessarians for probability logic has little to recommend it except for one important point. Credal probability judgments ought to be adapted to changes in evidence or states of full belief in a principled manner in conformity with the inquirer’s confirmational commitments—except when the inquirer has good reason to modify his or her confirmational commitment. Probability logic ought to spell out the constraints on rationally coherent confirmational (...) commitments. In the case where credal judgments are numerically determinate confirmational commitments correspond to Carnap’s credibility functions mathematically represented by so—called confirmation functions. Serious investigation of the conditions under which confirmational commitments should be changed ought to be a prime target for critical reflection. The necessarians were mistaken in thinking that confirmational commitments are immune to legitimate modification altogether. But their personalist or subjectivist critics went too far in suggesting that we might dispense with confirmational commitments. There is room for serious reflection on conditions under which changes in confirmational commitments may be brought under critical control. Undertaking such reflection need not become embroiled in the anti inductivism that has characterized the work of Popper, Carnap and Jeffrey and narrowed the focus of students of logical and methodological issues pertaining to inquiry. (shrink)

One of the fundamental problems of epistemology is to say when the evidence in an agent’s possession justifies the beliefs she holds. In this paper and its prequel, we defend the Bayesian solution to this problem by appealing to the following fundamental norm: Accuracy An epistemic agent ought to minimize the inaccuracy of her partial beliefs. In the prequel, we made this norm mathematically precise; in this paper, we derive its consequences. We show that the two core tenets of Bayesianism (...) follow from the norm, while the characteristic claim of the Objectivist Bayesian follows from the norm along with an extra assumption. Finally, we consider Richard Jeffrey’s proposed generalization of conditionalization. We show not only that his rule cannot be derived from the norm, unless the requirement of Rigidity is imposed from the start, but further that the norm reveals it to be illegitimate. We end by deriving an alternative updating rule for those cases in which Jeffrey’s is usually supposed to apply. (shrink)

Rédei and Gyenis recently displayed strong constraints of Bayesian learning. However, they also presented a positive result for Bayesianism. Despite the limited significance of this positive result, I find it useful to discuss its two possible strengthenings to present new results and open new questions about the limits of Bayesianism. First, I will show that one cannot strengthen the positive result by restricting the evidence to so-called “certain evidence”. Secondly, strengthening the result by restricting the partitions—as parts of one’s evidence—to (...) Jeffrey-independent partitions requires additional constraints on one’s evidence to preserve its commutativity. So, my results provide additional grounds for caution and support for the limitations of Bayesian learning. (shrink)

Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of cross-entropy minimization. To adequately formalize inductive probabilistic reasoning is an interesting topic for artificial intelligence, as an autonomous system (...) acting in a complex environment may have to base its actions on a probabilistic model of its environment, and the probabilities needed to form this model can often be obtained by combining statistical background information with particular observations made, i.e., by inductive probabilistic reasoning. In this paper a formal framework for inductive probabilistic reasoning is developed: syntactically it consists of an extension of the language of first-order predicate logic that allows to express statements about both statistical and subjective probabilities. Semantics for this representation language are developed that give rise to two distinct entailment relations: a relation ⊨ that models strict, probabilistically valid, inferences, and a relation that models inductive probabilistic inferences. The inductive entailment relation is obtained by implementing cross-entropy minimization in a preferred model semantics. A main objective of our approach is to ensure that for both entailment relations complete proof systems exist. This is achieved by allowing probability distributions in our semantic models that use non-standard probability values. A number of results are presented that show that in several important aspects the resulting logic behaves just like a logic based on real-valued probabilities alone. (shrink)

An agent who receives information in the form of an indicative conditional statement and who trusts her source will modify her credences to bring them in line with the conditional. I will argue that the agent, upon the acquisition of such information, should, in general, expand her prior credence function to an indeterminate posterior one; that is, to a set of credence functions. Two different ways the agent might interpret the conditional will be presented, and the properties of the resulting (...) indeterminate posteriors compared. The cause of the expansion from a single prior credence function to a set of credence functions forming the indeterminate posterior one will be explained. The expansion undermines the Bayesian dogma that the result of assimilating new information into a determinate prior credence functions is always a determinate posterior one. (shrink)

My title is intended to recall Terence Fine's excellent survey, Theories of Probability [1973]. I shall consider some developments that have occurred in the intervening years, and try to place some of the theories he discussed in what is now a slightly longer perspective. Completeness is not something one can reasonably hope to achieve in a journal article, and any selection is bound to reflect a view of what is salient. In a subject as prone to dispute as this, there (...) will inevitably be many who will disagree with any author's views, and I take the opportunity to apologize in advance to all such people for what they will see as the narrowness and distortion of mine. (shrink)

This paper discusses the Bayesian updating rules of ordinary and Jeffrey conditionalisation. Their justification has been a topic of interest for the last quarter century, and several strategies proposed. None has been accepted as conclusive, and it is argued here that this is for a good reason; for by extending the domain of the probability function to include propositions describing the agent's present and future degrees of belief one can systematically generate a class of counterexamples to the rules. Dynamic Dutch (...) Book and other arguments for them are examined critically. A concluding discussion attempts to put these results in perspective within the Bayesian approach. (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)

I re-examine Coherence Arguments (Dutch Book Arguments, No Arbitrage Arguments) for diachronic constraints on Bayesian reasoning. I suggest to replace the usual game–theoretic coherence condition with a new decision–theoretic condition ('Diachronic Sure Thing Principle'). The new condition meets a large part of the standard objections against the Coherence Argument and frees it, in particular, from a commitment to additive utilities. It also facilitates the proof of the Converse Dutch Book Theorem. I first apply the improved Coherence Argument to van Fraassen's (...) (1984) Reflection principle. I then point out the failure of a Coherence Argument that is intended to support Conditionalization as a naive, universal, update rule. I also point out that Reflection is incompatible with the universal use of Conditionalization thus interpreted. The Coherence Argument therefore defeats the naive view on Bayesian learning that it was originally designed to justify. (shrink)

Jeffrey updating is a natural extension of Bayesian updating to cases where the evidence is uncertain. But, the resulting degrees of belief appear to be sensitive to the order in which the uncertain evidence is acquired, a rather un-Bayesian looking effect. This order dependence results from the way in which basic Jeffrey updating is usually extended to sequences of updates. The usual extension seems very natural, but there are other plausible ways to extend Bayesian updating that maintain order-independence. I will (...) explore three models of sequential updating, the usual extension and two alternatives. I will show that the alternative updating schemes derive from extensions of the usual rigidity requirement, which is at the heart of Jeffrey updating. Finally, I will establish necessary and sufficient conditions for order-independent updating, and show that extended rigidity is closely related to these conditions. (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)

A handful of well-known arguments (the 'diachronic Dutch book arguments') rely upon theorems establishing that, in certain circumstances, you are immune from sure monetary loss (you are not 'diachronically Dutch bookable') if and only if you adopt the strategy of conditionalizing (or Jeffrey conditionalizing) on whatever evidence you happen to receive. These theorems require non-trivial assumptions about which evidence you might acquire---in the case of conditionalization, the assumption is that, if you might learn that e, then it is not the (...) case that you might learn something else that is consistent with e. These assumptions may not be relaxed. When they are, not only will non-(Jeffrey) conditionalizers be immune from diachronic Dutch bookability, but (Jeffrey) conditionalizers will themselves be diachronically Dutch bookable. I argue: 1) that there are epistemic situations in which these assumptions are violated; 2) that this reveals a conflict between the premise that susceptibility to sure monetary loss is irrational, on the one hand, and the view that rational belief revision is a function of your prior beliefs and the acquired evidence alone, on the other; and 3) that this inconsistency demonstrates that diachronic Dutch book arguments for (Jeffrey) conditionalization are invalid. (shrink)

In this paper, we investigate various possible (Bayesian) precisifications of the (somewhat vague) statements of “the equal weight view” (EWV) that have appeared in the recent literature on disagreement. We will show that the renditions of (EWV) that immediately suggest themselves are untenable from a Bayesian point of view. In the end, we will propose some tenable (but not necessarily desirable) interpretations of (EWV). Our aim here will not be to defend any particular Bayesian precisification of (EWV), but rather to (...) raise awareness about some of the difficulties inherent in formulating such precisifications. (shrink)

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)

According to the Bayesian paradigm in the psychology of reasoning, the norms by which everyday human cognition is best evaluated are probabilistic rather than logical in character. Recently, the Bayesian paradigm has been applied to the domain of argumentation, where the fundamental norms are traditionally assumed to be logical. Here, we present a major generalisation of extant Bayesian approaches to argumentation that utilizes a new class of Bayesian learning methods that are better suited to modelling dynamic and conditional inferences than (...) standard Bayesian conditionalization, is able to characterise the special value of logically valid argument schemes in uncertain reasoning contexts, greatly extends the range of inferences and argumentative phenomena that can be adequately described in a Bayesian framework, and undermines some influential theoretical motivations for dual function models of human cognition. We conclude that the probabilistic norms given by the Bayesian approach to rationality are not necessarily at odds with the norms given by classical logic. Rather, the Bayesian theory of argumentation can be seen as justifying and enriching the argumentative norms of classical logic. (shrink)

Bayesianism is a collection of positions in several related fields, centered on the interpretation of probability as something like degree of belief, as contrasted with relative frequency, or objective chance. However, Bayesianism is far from a unified movement. Bayesians are divided about the nature of the probability functions they discuss; about the normative force of this probability function for ordinary and scientific reasoning and decision making; and about what relation (if any) holds between Bayesian and non-Bayesian concepts.

We explore the question of whether cost-free uncertain evidence is worth waiting for in advance of making a decision. A classical result in Bayesian decision theory, known as the value of evidence theorem, says that, under certain conditions, when you update your credences by conditionalizing on some cost-free and certain evidence, the subjective expected utility of obtaining this evidence is never less than the subjective expected utility of not obtaining it. We extend this result to a type of update method, (...) a variant of Judea Pearl’s virtual conditionalization, where uncertain evidence is represented as a set of likelihood ratios. Moreover, we argue that focusing on this method rather than on the widely accepted Jeffrey conditionalization enables us to show that, under a fairly plausible assumption, gathering uncertain evidence not only maximizes expected pragmatic utility, but also minimizes expected epistemic disutility. (shrink)

We present a general framework for representing belief-revision rules and use it to characterize Bayes's rule as a classical example and Jeffrey's rule as a non-classical one. In Jeffrey's rule, the input to a belief revision is not simply the information that some event has occurred, as in Bayes's rule, but a new assignment of probabilities to some events. Despite their differences, Bayes's and Jeffrey's rules can be characterized in terms of the same axioms: "responsiveness", which requires that revised beliefs (...) incorporate what has been learnt, and "conservativeness", which requires that beliefs on which the learnt input is "silent" do not change. To illustrate the use of non-Bayesian belief revision in economic theory, we sketch a simple decision-theoretic application. (shrink)

Many welfarists wish to assign to each possible state of the world a numerical value that measures something like its moral goodness. How are we to determine this quantity? This paper proposes a contractualist approach: a legitimate measure of moral goodness is one that could be justified to each member of the population in question. How do we justify a measure of moral goodness to each individual? Each individual recognises the measure of moral goodness must be a compromise between the (...) different levels of well-being within the population. Some compromises are more reasonable than others; and some are better justifiable to a given member of the population than others. Each member recognises that the social chooser's measure of moral goodness is going to have to deviate from the well-being function of at least some of the members of the population. But we can nonetheless justify it to each of them if it doesn't deviate more than is necessary, and if the deviations from each member are given equal weighting in whatever process we use to determine it. This paper proposes that we begin with a measure of the distance from a proposed compromise to an individual's level of well-being, and then say that the moral goodness is the candidate compromise that minimizes the sum of distances from it to the individuals' levels of well-being. I describe a range of such measures of distance and show that some give utilitarianism, others different versions of prioritarianism. (shrink)

The Institute Vienna Circle held a conference in Vienna in 2003, Cambridge and Vienna a?

This paper develops a trivalent semantics for indicative conditionals and extends it to a probabilistic theory of valid inference and inductive learning with conditionals. On this account, (i) all complex conditionals can be rephrased as simple conditionals, connecting our account to Adams's theory of p-valid inference; (ii) we obtain Stalnaker's Thesis as a theorem while avoiding the well-known triviality results; (iii) we generalize Bayesian conditionalization to an updating principle for conditional sentences. The final result is a unified semantic and probabilistic (...) theory of conditionals with attractive results and predictions. (shrink)

Bayes nets are a powerful tool for researchers in statistics and artificial intelligence. This chapter demonstrates that they are also of much use for philosophers and psychologists interested in (Bayesian) rationality. To do so, we outline the general methodology of Bayes nets modeling in rationality research and illustrate it with several examples from the philosophy and psychology of reasoning and argumentation. Along the way, we discuss the normative foundations of Bayes nets modeling and address some of the methodological problems it (...) raises. (shrink)

The scope of Aumann’s (1976) Agreement Theorem is needlessly limited by its restriction to Conditioning as the update rule. Here we prove the theorem in a more comprehensive framework, in which the evolution of probabilities is represented directly, without deriving new probabilities from new certainties. The framework allows arbitrary update rules subject only to Goldstein’s (1983) requirement that current expectations agree with current expectations of future expectations.