An adequate account of laws should satisfy at least five desiderata: it should provide a unified account of laws and chances, it should yield plausible relations between laws and chances, it should vindicate numerical chance assignments, it should accommodate dynamical and non-dynamical chances, and it should accommodate a plausible range of nomic possibilities. No extant account of laws satisfies these desiderata. This paper presents a non-Humean account of laws, the Nomic Likelihood Account, that does.

Events between which we have no epistemic reason to discriminate have equal epistemic probabilities. Bertrand’s chord paradox, however, appears to show this to be false, and thereby poses a general threat to probabilities for continuum sized state spaces. Articulating the nature of such spaces involves some deep mathematics and that is perhaps why the recent literature on Bertrand’s Paradox has been almost entirely from mathematicians and physicists, who have often deployed elegant mathematics of considerable sophistication. At the same time, the (...) philosophy of probability has been left out. In particular, left out entirely are the philosophical ground of the principle of indifference, the nature of the principle itself, the stringent constraint this places on the mathematical representation of the principle needed for its application to continuum sized event spaces, and what these entail for rigour in developing the paradox itself. This book puts the philosophy and its entailments back in and in so doing casts a new light on the paradox, giving original analyses of the paradox, its possible solutions, the source of the paradox, the philosophical errors we make in attempting to solve it and what the paradox proves for the philosophy of probability. The book finishes with the author’s proposed solution—a solution in the spirit of Bertrand’s, indeed—in which an epistemic principle more general than the principle of indifference offers a principled restriction of the domain of the principle of indifference. (shrink)

Imprecise probabilities are often modelled with representors, or sets of probability functions. In the recent literature, two ways of interpreting representors have emerged as especially prominent: vagueness interpretations, according to which each probability function in the set represents how the agent's beliefs would be if any vagueness were precisified away; and comparativist interpretations, according to which the set represents those comparative confidence relations that are common to all probability functions therein. I argue that these interpretations have some important limitations. I (...) also propose an alternative—the functional interpretation—according to which representors are best interpreted by reference to the roles they play in the theories that make use of them. (shrink)

My dissertation is about Bayesian rationality for non-ideal agents. I show how to derive subjective probabilities from preferences using much weaker rationality assumptions than other standard representation theorems. I argue that non-ideal agents might be uncertain about how they will update on new information and consider two consequences of this uncertainty: such agents should sometimes reject free information and make choices which, taken together, yield sure loss. The upshot is that Bayesian rationality for non-ideal agents makes very different normative demands (...) than ideal Bayesian rationality. (shrink)

While there are several arguments on either side, it is far from clear as to whether or not countable additivity is an acceptable axiom of subjective probability. I focus here on de Finetti's central argument against countable additivity and provide a new Dutch book proof of the principle, To argue that if we accept the Dutch book foundations of subjective probability, countable additivity is an unavoidable constraint.

An important suggestion of objective Bayesians is that the maximum entropy principle can replace a principle which is known to get into paradoxical difficulties: the principle of indifference. No one has previously determined whether the maximum entropy principle is better able to solve Bertrand’s chord paradox than the principle of indifference. In this paper I show that it is not. Additionally, the course of the analysis brings to light a new paradox, a revenge paradox of the chords, that is unique (...) to the maximum entropy principle. (shrink)

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This fact shows that being representable as having subjective probabilities is not necessarily the same as having subjective probabilities. Probabilism can be defended on the (...) basis of the representation theorems only if attributions of degrees of belief are understood either antirealistically or purely qualitatively, or if the representation theorems are supplemented by arguments based on other considerations (simplicity, consilience, and so on) that single out the representation of a person as having subjective probabilities as the only true representation of the mental state of any person whose preferences conform to the axioms of expected utility theory. (shrink)

Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage’s postulates in decision theory imply that subjective probability measures are not necessarily countably additive but finitely additive. In this paper, we formulate a probability logic Σ + that is strongly complete with respect to this class of type spaces with finitely additive probability measures, i.e. a set of formulas is consistent in Σ + iff (...) it is satisfied in a finitely additive type space. Although we can characterize Σ + -theories satisfiable in the class as maximally consistent sets of formulas, we prove that any canonical model of maximally consistent sets is not universal in the class of type spaces with finitely additive measures, and, moreover, it is not a type space. At the end of this paper, we show that even a minimal use of probability indices causes the failure of compactness in probability logics. (shrink)

Since the middle of this century, the dominant prescriptive approach to decision theory has been a deductive viewpoint which is concerned with axioms of rational preference and their consequences. After summarizing important problems with the preference primitive, this paper argues for a constructive approach in which information is the foundation for decision-making. This approach poses comparability of uncertain acts as a question rather than an assumption. It is argued that, in general, neither preference nor subjective probability can be assumed given, (...) and that these need to be generated by using the relevant information available to the decision-agent in a given situation. A specific constructive model is discussed and illustrated with a real example from this viewpoint. (shrink)

The focus of this study is cognitive choice: the selection of one cognitive option (a hypothesis, a theory, or an axiom, for instance) rather than another. The study proposes that cognitive choice should be based on the plausibilities of states posited by rival cognitive options and the utilities of these options' information outcomes. The proposal introduces a form of decision theory that is novel because comparative; it permits many choices among cognitive options to be based on merely comparative plausibilities and (...) utilities. This form of decision theory intersects with recommendations by advocates of decision theory for cognitive choice, on the one hand, and defenders of comparative evaluation of scientific hypotheses and theories, on the other. But it differs from prior decision-theoretic proposals because it requires no more than minimal precision in specifying plausibilities and utilities. And it differs from comparative proposals because none has shown how comparative evaluations can be carried out within a decision-theoretic framework. (shrink)

Where there are infinitely many possible [equiprobable] basic states of the world, a standard probability function must assign zero probability to each state—since any finite probability would sum to over one. This generates problems for any decision theory that appeals to expected utility or related notions. For it leads to the view that a situation in which one wins a million dollars if any of a thousand of the equally probable states is realized has an expected value of zero (since (...) each such state has probability zero). But such a situation dominates the situation in which one wins nothing no matter what (which also has an expected value of zero), and so surely is more desirable. I formulate and defend some principles for evaluating options where standard probability functions cannot strictly represent probability—and in particular for where there is an infinitely spread, uniform distribution of probability. The principles appeal to standard probability functions, but overcome at least some of their limitations in such cases. (shrink)

In the longstanding foundational debate whether to require that probability is countably additive, in addition to being finitely additive, those who resist the added condition raise two concerns that we take up in this paper. (1) _Existence_: Settings where no countably additive probability exists though finitely additive probabilities do. (2) _Complete Additivity_: Where reasons for countable additivity don’t stop there. Those reasons entail complete additivity—the (measurable) union of probability 0 sets has probability 0, regardless the cardinality of that union. Then (...) probability distributions are discrete, not continuous. We use Easwaran’s (Easwaran, Thought 2:53–61, 2013) advocacy of the _Comparative_ principle to illustrate these two concerns. Easwaran supports countable additivity, both for numerical probabilities and for finer, qualitative probabilities, by defending a condition he calls the _Comparative_ principle [ \({\mathcal{C}}\) ]. For numerical probabilities, principle \({\mathcal{C}}\) contrasts pairs, P 1 and P 2, defined over a common partition \(\prod\) = {a _i_ : _i_ ∈ I} of measurable events. \({\mathcal{C}}\) requires that no P 1 may be pointwise dominated, i.e., no (finitely additive) probability P 2 exists such that for each _i_ ∈ I, P 2 (a _i_ ) > P 1 (a _i_ ). By design, the cardinality of \(\prod\) is not limited in \({\mathcal{C}}\), which Easwaran asserts is important when arguing that the principle does not require more, or less, than that probability is countably additive. We agree that a numerical probability P satisfies principle \({\mathcal{C}}\) in all partitions just in case P is countably additive. However, we show that for numerical probabilities, by considering the size of the algebra of events to which probability is applied, principle \({\mathcal{C}}\) is subject to each of the above concerns, (1) and (2). Also, Easwaran considers principle \({\mathcal{C}}\) with non-numerical, qualitative probabilities, where a qualitative probability may be finer than an almost agreeing numerical probability P. A qualitative probability is regular if possible events are strictly more likely than impossible events. Easwaran motivates and illustrates regular qualitative probabilities using a continuous, almost agreeing quantitative probability that is uniform on the unit interval. We make explicit the conditions for applying principle \({\mathcal{C}}\) with qualitative probabilities and show that \({\mathcal{C}}\) restricts regular qualitative probabilities to those whose almost agreeing quantitative probabilities are completely additive. For instance, Easwaran’s motivating example of a regular qualitative probability is precluded by principle \({\mathcal{C}}\). (shrink)

Knowledge-first epistemology includes a knowledge norm of action: roughly, act only on what you know. This norm has been criticized, especially from the perspective of so-called standard decision theory. Mueller and Ross provide example decision problems which seem to show that acting properly cannot require knowledge. I argue that this conclusion depends on applying a particular decision theory which is ill-motivated in this context. Agents’ knowledge is often most plausibly formalized as an ambiguous epistemic state, and the theory of decision (...) under ambiguity is then the appropriate modeling tool. I show how to model agents as acting rationally on the basis of their knowledge according to such a theory. I conclude that the tension between the knowledge norm of action and formal decision theory is illusory; the knowledge-first paradigm should be used to actively select the decision-theoretical tools that can best capture the knowledge-based decisions in any given situation. (shrink)

As an application of his Material Theory of Induction, Norton (2018; manuscript) argues that the correct inductive logic for a fair infinite lottery, and also for evaluating eternal inflation multiverse models, is radically different from standard probability theory. This is due to a requirement of label independence. It follows, Norton argues, that finite additivity fails, and any two sets of outcomes with the same cardinality and co-cardinality have the same chance. This makes the logic useless for evaluating multiverse models based (...) on self-locating chances, so Norton claims that we should despair of such attempts. However, his negative results depend on a certain reification of chance, consisting in the treatment of inductive support as the value of a function, a value not itself affected by relabeling. Here we define a purely comparative infinite lottery logic, where there are no primitive chances but only a relation of ‘at most as likely’ and its derivatives. This logic satisfies both label independence and a comparative version of additivity as well as several other desirable properties, and it draws finer distinctions between events than Norton's. Consequently, it yields better advice about choosing between sets of lottery tickets than Norton's, but it does not appear to be any more helpful for evaluating multiverse models. Hence, the limitations of Norton's logic are not entirely due to the failure of additivity, nor to the fact that all infinite, co-infinite sets of outcomes have the same chance, but to a more fundamental problem: We have no well-motivated way of comparing disjoint countably infinite sets. (shrink)

While there is no universal logic of induction, the probability calculus succeeds as a logic of induction in many contexts through its use of several notions concerning inductive inference. They include Addition, through which low probabilities represent disbelief as opposed to ignorance; and Bayes property, which commits the calculus to a ‘refute and rescale’ dynamics for incorporating new evidence. These notions are independent and it is urged that they be employed selectively according to needs of the problem at hand. It (...) is shown that neither is adapted to inductive inference concerning some indeterministic systems. (shrink)

Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions or between (...) two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable. [NB: There is a transcription error in (A6), the quantification “∀(Y,c₂)” should be applied within the large parentheses to the proposition on the third row. You have my apologies!]. (shrink)

Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions or between (...) two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable. (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)

While pragmatic arguments for numerical probability axioms have received much attention, justifications for axioms of qualitative probability have been less discussed. We offer an argument for the requirement that an agent’s qualitative judgments be probabilistically representable, inspired by, but importantly different from, the Money Pump argument for transitivity of preference and Dutch book arguments for quantitative coherence. The argument is supported by a theorem, to the effect that a subject is systematically susceptible to dominance given her preferred acts, if and (...) only if the subject’s comparative judgments preclude representation by a standard probability measure. (shrink)

A possible event always seems to be more probable than an impossible event. Although this constraint, usually alluded to as regularity , is prima facie very attractive, it cannot hold for standard probabilities. Moreover, in a recent paper Timothy Williamson has challenged even the idea that regularity can be integrated into a comparative conception of probability by showing that the standard comparative axioms conflict with certain cases if regularity is assumed. In this note, we suggest that there is a natural (...) weakening of the standard comparative axioms. It is shown that these axioms are consistent both with the regularity condition and with the essential feature of Williamson’s example. (shrink)

It is a consequence of the theory of imprecise credences that there exist situations in which rational agents inevitably become less opinionated toward some propositions as they gather more evidence. The fact that an agent's imprecise credal state can dilate in this way is often treated as a strike against the imprecise approach to inductive inference. Here, we show that dilation is not a mere artifact of this approach by demonstrating that opinion loss is countenanced as rational by a substantially (...) broader class of normative theories than has been previously recognised. Specifically, we show that dilation-like phenomena arise even when one abandons the basic assumption that agents have (precise or imprecise) credences of any kind, and follows directly from bedrock norms for rational comparative confidence judgements of the form `I am at least as confident in p as I am in q'. We then use the comparative confidence framework to develop a novel understanding of what exactly gives rise to dilation-like phenomena. By considering opinion loss in this more general setting, we are able to provide a novel assessment of the prospects for an account of inductive inference that is not saddled with the inevitability of rational opinion loss. (shrink)

Comparativism is the view that comparative confidences (e.g., being more confident that P than that Q) are more fundamental than degrees of belief (e.g., believing that P with some strength x). In this paper, I outline the basis for a new, non-probabilistic version of comparativism inspired by a suggestion made by Frank Ramsey in `Probability and Partial Belief'. I show how, and to what extent, `Ramseyan comparativism' might be used to weaken the (unrealistically strong) probabilistic coherence conditions that comparativism traditionally (...) relies on. (shrink)

According to comparativism, degrees of belief are reducible to a system of purely ordinal comparisons of relative confidence. (For example, being more confident that P than that Q, or being equally confident that P and that Q.) In this paper, I raise several general challenges for comparativism, relating to (i) its capacity to illuminate apparently meaningful claims regarding intervals and ratios of strengths of belief, (ii) its capacity to draw enough intuitively meaningful and theoretically relevant distinctions between doxastic states, and (...) (iii) its capacity to handle common instances of irrationality. (shrink)

A probability function is non-conglomerable just in case there is some proposition E and partition \ of the space of possible outcomes such that the probability of E conditional on any member of \ is bounded by two values yet the unconditional probability of E is not bounded by those values. The paradox of non-conglomerability is the counterintuitive—and controversial—claim that a rational agent’s subjective probability function can be non-conglomerable. In this paper, I present a qualitative analogue of the paradox. I (...) show that, under antecedently plausible assumptions, an analogue of the paradox arises for rational comparative confidence. As I show, the qualitative paradox raises its own distinctive set of philosophical issues. (shrink)

A number of philosophers have thought that fair lotteries over countably infinite sets of outcomes are conceptually incoherent by virtue of violating countable additivity. In this article, I show that a qualitative analogue of this argument generalizes to an argument against the conceptual coherence of a much wider class of fair infinite lotteries—including continuous uniform distributions. I argue that this result suggests that fair lotteries over countably infinite sets of outcomes are no more conceptually problematic than continuous uniform distributions. Along (...) the way, I provide a novel argument for a weak qualitative, epistemic version of regularity. (shrink)

We recast subjective probabilities by rejecting behaviourist accounts of belief by explicitly distinguishing between judgements of uncertainty and expressions of those judgements. We argue that this entails rejecting that orderings of uncertainty be complete. This in turn leads naturally to several generalizations of the probability calculus. We define probability-like functions over incomplete algebras that reflect a subject’s incomplete judgements of uncertainty. These functions can be further generalized to inner and outer measures that reflect approximate elicitations.

Standard accuracy-based approaches to imprecise credences have the consequence that it is rational to move between precise and imprecise credences arbitrarily, without gaining any new evidence. Building on the Educated Guessing Framework of Horowitz (2019), we develop an alternative accuracy-based approach to imprecise credences that does not have this shortcoming. We argue that it is always irrational to move from a precise state to an imprecise state arbitrarily, however it can be rational to move from an imprecise state to a (...) precise state arbitrarily. (shrink)

This paper introduces the likelihood method for decision under uncertainty. The method allows the quantitative determination of subjective beliefs or decision weights without invoking additional separability conditions, and generalizes the Savage–de Finetti betting method. It is applied to a number of popular models for decision under uncertainty. In each case, preference foundations result from the requirement that no inconsistencies are to be revealed by the version of the likelihood method appropriate for the model considered. A unified treatment of subjective decision (...) weights results for most of the decision models popular today. Savage’s derivation of subjective expected utility can now be generalized and simplified. In addition to the intuitive and empirical contributions of the likelihood method, we provide a number of technical contributions: We generalize Savage’s nonatomiticy condition (“P6”) and his assumption of (sigma) algebras of events, while fully maintaining his flexibility regarding the outcome set. Derivations of Choquet expected utility and probabilistic sophistication are generalized and simplified similarly. The likelihood method also reveals a common intuition underlying many other conditions for uncertainty, such as definitions of ambiguity aversion and pessimism. (shrink)

‘Bayesian epistemology’ became an epistemological movement in the 20th century, though its two main features can be traced back to the eponymous Reverend Thomas Bayes (c. 1701-61). Those two features are: (1) the introduction of a formal apparatus for inductive logic; (2) the introduction of a pragmatic self-defeat test (as illustrated by Dutch Book Arguments) for epistemic rationality as a way of extending the justification of the laws of deductive logic to include a justification for the laws of inductive logic. (...) The formal apparatus itself has two main elements: the use of the laws of probability as coherence constraints on rational degrees of belief (or degrees of confidence) and the introduction of a rule of probabilistic inference, a rule or principle of conditionalization. (shrink)

Proponents of Bayesian confirmation theory believe that they have the solution to a significant, recalcitrant problem in philosophy of science. It is the identification of the logic that governs evidence and its inductive bearing in science. That is the logic that lets us say that our catalog of planetary observations strongly confirms Copernicus’ heliocentric hypothesis; or that the fossil record is good evidence for the theory of evolution; or that the 3oK cosmic background radiation supports big bang cosmology. The definitive (...) solution to this problem would be a significant achievement. The problem is of central importance to philosophy of science, for, in the end, what distinguishes science from myth making is that we have good evidence for the content of science, or at least of mature sciences, whereas myths are evidentially ungrounded fictions. The core ideas shared by all versions of Bayesian confirmation theory are, at a good first approximation, that a scientist’s beliefs are or should conform to a probability measure; and that the incorporation of new evidence is through conditionalization using Bayes’ theorem. While the burden of this chapter will be to inventory why critics believe this theory may not be the solution after all, it is worthwhile first to summarize here the most appealing virtues of this simple account. There are three. First, the theory reduces the often nebulous notion of a logic of.. (shrink)

Epistemic decision theory (EDT) employs the mathematical tools of rational choice theory to justify epistemic norms, including probabilism, conditionalization, and the Principal Principle, among others. Practitioners of EDT endorse two theses: (1) epistemic value is distinct from subjective preference, and (2) belief and epistemic value can be numerically quantified. We argue the first thesis, which we call epistemic puritanism, undermines the second.

In this paper, we explore semantics for comparative epistemic modals that avoid the entailment problems shown to result from Kratzer’s (1991) semantics by Yalcin (2006, 2009, 2010). In contrast to the alternative semantics presented by Yalcin and Lassiter (2010, 2011), based on finitely additive probability measures, we introduce semantics based on qualitatively additive measures, as well as semantics based on purely qualitative orderings, including orderings on propositions derived from orderings on worlds in the tradition of Kratzer (1991). All of these (...) semantics avoid the entailment problems that result from Kratzer’s semantics. Our discussion focuses on methodological issues concerning the choice between different semantics. (shrink)

According to the traditional Bayesian view of credence, its structure is that of precise probability, its objects are descriptive propositions about the empirical world, and its dynamics are given by conditionalization. Each of the three essays that make up this thesis deals with a different variation on this traditional picture. The first variation replaces precise probability with sets of probabilities. The resulting imprecise Bayesianism is sometimes motivated on the grounds that our beliefs should not be more precise than the evidence (...) calls for. One known problem for this evidentially motivated imprecise view is that in certain cases, our imprecise credence in a particular proposition will remain the same no matter how much evidence we receive. In the first essay I argue that the problem is much more general than has been appreciated so far, and that it’s difficult to avoid without compromising the initial evidentialist motivation. The second variation replaces descriptive claims with moral claims as the objects of credence. I consider three standard arguments for probabilism with respect to descriptive uncertainty—representation theorem arguments, Dutch book arguments, and accuracy arguments—in order to examine whether such arguments can also be used to establish probabilism with respect to moral uncertainty. In the second essay, I argue that by and large they can, with some caveats. First, I don’t examine whether these arguments can be given sound non-cognitivist readings, and any conclusions therefore only hold conditional on cognitivism. Second, decision-theoretic representation theorems are found to be less convincing in the moral case, because there they implausibly commit us to thinking that intertheoretic comparisons of value are always possible. Third and finally, certain considerations may lead one to think that imprecise probabilism provides a more plausible model of moral epistemology. The third variation considers whether, in addition to conditionalization, agents may also change their minds by becoming aware of propositions they had not previously entertained, and therefore not previously assigned any probability. More specifically, I argue that if we wish to make room for reflective equilibrium in a probabilistic moral epistemology, we must allow for awareness growth. In the third essay, I sketch the outline of such a Bayesian account of reflective equilibrium. Given that this account gives a central place to awareness growth, and that the rationality constraints on belief change by awareness growth are much weaker than those on belief change by conditionalization, it follows that the rationality constraints on the credences of agents who are seeking reflective equilibrium are correspondingly weaker. (shrink)