An infinite lottery machine is used as a foil for testing the reach of inductive inference, since inferences concerning it require novel extensions of probability. Its use is defensible if there is some sense in which the lottery is physically possible, even if exotic physics is needed. I argue that exotic physics is needed and describe several proposals that fail and at least one that succeeds well enough.

We show that infinitesimal probabilities are much too small for modeling the individual outcome of a countably infinite fair lottery.

In this paper I argue that de Finetti provided compelling reasons for rejecting countable additivity. It is ironical therefore that the main argument advanced by Bayesians against following his recommendation is based on the consistency criterion, coherence, he himself developed. I will show that this argument is mistaken. Nevertheless, there remain some counter-intuitive consequences of rejecting countable additivity, and one in particular has all the appearances of a full-blown paradox. I will end by arguing that in fact it is no (...) paradox, and that what it shows is that conditionalisation, often claimed to be integral to the Bayesian canon, has to be rejected as a general rule in a finitely additive environment. (shrink)

Many have claimed that unspecific evidence sometimes demands unsharp, indeterminate, imprecise, vague, or interval-valued probabilities. Against this, a variant of the diachronic Dutch Book argument shows that perfectly rational agents always have perfectly sharp probabilities.

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

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

It has been claimed that, in response to certain kinds of evidence, agents ought to adopt imprecise credences: doxastic states that are represented by sets of credence functions rather than single ones. In this paper I argue that, given some plausible constraints on accuracy measures, accuracy-centered epistemologists must reject the requirement to adopt imprecise credences. I then show that even the claim that imprecise credences are permitted is problematic for accuracy-centered epistemology. It follows that if imprecise credal states are permitted (...) or required in the cases that their defenders appeal to, then the requirements of rationality can outstrip what would be warranted by an interest in accuracy. (shrink)

In this paper a theory of finitistic and frequentistic approximations — in short: f-approximations — of probability measures P over a countably infinite outcome space N is developed. The family of subsets of N for which f-approximations converge to a frequency limit forms a pre-Dynkin system $${{D\subseteq\wp(N)}}$$. The limiting probability measure over D can always be extended to a probability measure over $${{\wp(N)}}$$, but this measure is not always σ-additive. We conclude that probability measures can be regarded as idealizations of (...) limiting frequencies if and only if σ-additivity is not assumed as a necessary axiom for probabilities. We prove that σ-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full f-approximations. We also show that every non-σ-additive probability measure is f-approximable, though neither canonically nor fully f-approximable. Finally, we transfer our results to probability measures on open or closed formulas of first-order languages. (shrink)

The Continuum Problem has inspired set theorists and philosophers since the days of Cantorian set theory. In the last 15 years, W. Hugh Woodin, a leading set theorist, has not only taken it upon himself to engage in this question, he has also changed his mind about the answer. This paper illustrates Woodin’s solutions to the problem, starting in Sect. 3 with his 1999–2004 argument that Cantor’s hypothesis about the continuum was incorrect. From 2010 onwards, Woodin presents a very different (...) argument, an argument that Cantor’s hypothesis is in fact true. This argument is still incomplete, but according to Woodin, some of the philosophical issues surrounding the Continuum Problem have been reduced to precise mathematical questions, questions that are, unlike Cantor’s hypothesis, solvable from our current theory of sets. (shrink)

It is generally thought that objective chances for particular events different from 1 and 0 and determinism are incompatible. However, there are important scientific theories whose laws are deterministic but which also assign non-trivial probabilities to events. The most important of these is statistical mechanics whose probabilities are essential to the explanations of thermodynamic phenomena. These probabilities are often construed as 'ignorance' probabilities representing our lack of knowledge concerning the microstate. I argue that this construal is incompatible with the role (...) of probability in explanation and laws. This is the 'paradox of deterministic probabilities'. After surveying the usual list of accounts of objective chance and finding them inadequate I argue that an account of chance sketched by David Lewis can be modified to solve the paradox of deterministic probabilities and provide an adequate account of the probabilities in deterministic theories like statistical mechanics. (shrink)

We give a direct and elementary proof of the fact that every real-valued probability measure can be approximated—up to an infinitesimal—by a hyperreal-valued one which is regular and defined on the whole powerset of the sample space.

We argue that indeterminate probabilities are not only rationally permissible for a Bayesian agent, but they may even be rationally required . Our first argument begins by assuming a version of interpretivism: your mental state is the set of probability and utility functions that rationalize your behavioral dispositions as well as possible. This set may consist of multiple probability functions. Then according to interpretivism, this makes it the case that your credal state is indeterminate. Our second argument begins with our (...) describing a world that plausibly has indeterminate chances. Rationality requires a certain alignment of your credences with corresponding hypotheses about the chances. Thus, if you hypothesize the chances to be indeterminate, your will inherit their indeterminacy in your corresponding credences. Our third argument is motivated by a dilemma. Epistemic rationality requires you to stay open-minded about contingent matters about which your evidence has not definitively legislated. Practical rationality requires you to be able to act decisively at least sometimes. These requirements can conflict with each other-for thanks to your open-mindedness, some of your options may have undefined expected utility, and if you are choosing among them, decision theory has no advice to give you. Such an option is playing Nover and Hájek’s Pasadena Game , and indeed any option for which there is a positive probability of playing the Pasadena Game. You can serve both masters, epistemic rationality and practical rationality, with an indeterminate credence to the prospect of playing the Pasadena game. You serve epistemic rationality by making your upper probability positive-it ensures that you are open-minded. You serve practical rationality by making your lower probability 0-it provides guidance to your decision-making. No sharp credence could do both. (shrink)

The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous range of set-theoretic possibilities, a phenomenon that challenges the universe (...) view. In particular, I argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for. (shrink)

The dream solution of the continuum hypothesis would be a solution by which we settle the continuum hypothesis on the basis of a newly discovered fundamental principle of set theory, a missing axiom, widely regarded as true. Such a dream solution would indeed be a solution, since we would all accept the new axiom along with its consequences. In this article, however, I argue that such a dream solution to $\mathrm {CH}$ is unattainable.

I argue that there are non-trivial objective chances (that is, objective chances other than 0 and 1) even in deterministic worlds. The argument is straightforward. I observe that there are probabilistic special scientific laws even in deterministic worlds. These laws project non-trivial probabilities for the events that they concern. And these probabilities play the chance role and so should be regarded as chances as opposed, for example, to epistemic probabilities or credences. The supposition of non-trivial deterministic chances might seem to (...) land us in contradiction. The fundamental laws of deterministic worlds project trivial probabilities for the very same events that are assigned non-trivial probabilities by the special scientific laws. I argue that any appearance of tension is dissolved by recognition of the level-relativity of chances. There is therefore no obstacle to accepting non-trivial chance-role-playing deterministic probabilities as genuine chances. (shrink)

We will give a simple philosophical "proof" of the negation of Cantor's continuum hypothesis (CH). (A formal proof for or against CH from the axioms of ZFC is impossible; see Cohen [1].) We will assume the axioms of ZFC together with intuitively clear axioms which are based on some intuition of Stuart Davidson and an old theorem of Sierpinski and are justified by the symmetry in a thought experiment throwing darts at the real number line. We will in fact show (...) why there must be an infinity of cardinalities between the integers and the reals. We will also show why Martin's Axiom must be false, and we will prove the extension of Fubini's Theorem for Lebesgue measure where joint measurability is not assumed. Following the philosophy--if you reject CH you are only two steps away from rejecting the axiom of choice (AC)--we will point out along the way some extensions of our intuition which contradict AC. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

It is sometimes alleged that arguments that probability functions should be countably additive show too much, and that they motivate uncountable additivity as well. I show this is false by giving two naturally motivated arguments for countable additivity that do not motivate uncountable additivity.

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

The Eternal Coin is a fair coin has existed forever, and will exist forever, in a region causally isolated from you. It is tossed every day. How confident should you be that the Coin lands heads today, conditional on (i) the hypothesis that it has landed Heads on every past day, or (ii) the hypothesis that it will land Heads on every future day? I argue for the extremely counterintuitive claim that the correct answer to both questions is 1.

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

The rise of the field of “ experimental mathematics” poses an apparent challenge to traditional philosophical accounts of mathematics as an a priori, non-empirical endeavor. This paper surveys different attempts to characterize experimental mathematics. One suggestion is that experimental mathematics makes essential use of electronic computers. A second suggestion is that experimental mathematics involves support being gathered for an hypothesis which is inductive rather than deductive. Each of these options turns out to be inadequate, and instead a third suggestion is (...) considered according to which experimental mathematics involves calculating instances of some general hypothesis. The paper concludes with the examination of some philosophical implications of this characterization. (shrink)

We pose and resolve several vexing decision theoretic puzzles. Some are variants of existing puzzles, such as 'Trumped' (Arntzenius and McCarthy 1997), 'Rouble trouble' (Arntzenius and Barrett 1999), 'The airtight Dutch book' (McGee 1999), and 'The two envelopes puzzle' (Broome 1995). Others are new. A unified resolution of the puzzles shows that Dutch book arguments have no force in infinite cases. It thereby provides evidence that reasonable utility functions may be unbounded and that reasonable credence functions need not be countably (...) additive. The resolution also shows that when infinitely many decisions are involved, the difference between making the decisions simultaneously and making them sequentially can be the difference between riches and ruin. Finally, the resolution reveals a new way in which the ability to make binding commitments can save perfectly rational agents from sure losses. (shrink)

Classic analysis of the subject and the development of personal probability; one of the greatest controversies in modern statistcal thought.

the symmetry of our evidential situation. If our confidence is best modeled by a standard probability function this means that we are to distribute our subjective probability or credence sharply and evenly over possibilities among which our evidence does not discriminate. Once thought to be the central principle of probabilistic reasoning by great..

We propose an alternative approach to probability theory closely related to the framework of numerosity theory: non-Archimedean probability (NAP). In our approach, unlike in classical probability theory, all subsets of an infinite sample space are measurable and only the empty set gets assigned probability zero (in other words: the probability functions are regular). We use a non-Archimedean field as the range of the probability function. As a result, the property of countable additivity in Kolmogorov’s axiomatization of probability is replaced by (...) a different type of infinite additivity. (shrink)