The Principle of Indifference is a central element of the ‘classical’ conception of probability, but, for all its strong intuitive appeal, it is widely believed that it faces a devastating objection: the so-called (by Poincare´) ‘Bertrand paradoxes’ (in essence, cases in which the same probability question receives different answers). The puzzle has fascinated many since its discovery, and a series of clever solutions (followed promptly by equally clever rebuttals) have been proposed. However, despite the long-standing interest in this problem, an (...) important assumption, necessary for its generation, has been overlooked. My aim in this paper is to identify this assumption. Since what it claims turns out to be prima facie problematic, I will urge that the burden of proof now shifts to the objectors to PI; they have to provide reasons why this assumption holds. (shrink)

This article explores the connection between objective chance and the randomness of a sequence of outcomes. Discussion is focussed around the claim that something happens by chance iff it is random. This claim is subject to many objections. Attempts to save it by providing alternative theories of chance and randomness, involving indeterminism, unpredictability, and reductionism about chance, are canvassed. The article is largely expository, with particular attention being paid to the details of algorithmic randomness, a topic relatively unfamiliar to philosophers.

The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed. After indicating the ways in which these accounts are flawed, I propose that randomness is to be understood as a special case of the epistemic concept of the unpredictability of a process. This proposal arguably captures the intuitive desiderata for the concept of randomness; at least it should suggest (...) that the commonly accepted accounts cannot be the whole story and more philosophical attention needs to be paid. (shrink)

This is a 'state of the art' collection of essays on the relation between probabilities, especially conditional probabilities, and conditionals. It provides new negative results which sharply limit the ways conditionals can be related to conditional probabilities. There are also positive ideas and results which will open up new areas of research. The collection is intended to honour Ernest W. Adams, whose seminal work is largely responsible for creating this area of inquiry. As well as describing, evaluating, and applying Adams' (...) work the contributions extend his ideas in directions he may or may not have anticipated, but that he certainly inspired. In addition to a wide range of philosophers of science, the volume should interest computer scientists and linguists. (shrink)

- In decision theory, an agent is deciding how to value a gamble that results in different outcomes in different states. Each outcome gets a utility value for the agent.

The meaning of the wave function and its evolution are investigated. First, we argue that the wave function in quantum mechanics is a description of random discontinuous motion of particles, and the modulus square of the wave function gives the probability density of the particles being in certain locations in space. Next, we show that the linear non-relativistic evolution of the wave function of an isolated system obeys the free Schrödinger equation due to the requirements of spacetime translation invariance and (...) relativistic invariance. Thirdly, we argue that the random discontinuous motion of particles may lead to a stochastic, nonlinear collapse evolution of the wave function. A discrete model of energy-conserved wavefunction collapse is proposed and shown consistent with existing experiments and our macroscopic experience. Besides, we also give a critical analysis of the de Broglie-Bohm theory, the many-worlds interpretation and other dynamical collapse theories, and briefly discuss the issues of unifying quantum mechanics and relativity. (shrink)

This article analyzes the implications of protective measurement for the meaning of the wave function. According to protective measurement, a charged quantum system has mass and charge density proportional to the modulus square of its wave function. It is shown that the mass and charge density is not real but effective, formed by the ergodic motion of a localized particle with the total mass and charge of the system. Moreover, it is argued that the ergodic motion is not continuous but (...) discontinuous and random. This result suggests a new interpretation of the wave function, according to which the wave function is a description of random discontinuous motion of particles, and the modulus square of the wave function gives the probability density of the particles being in certain locations. It is shown that the suggested interpretation of the wave function disfavors the de Broglie-Bohm theory and the many-worlds interpretation but favors the dynamical collapse theories, and the random discontinuous motion of particles may provide an appropriate random source to collapse the wave function. (shrink)

We show that the physical meaning of the wave function can be derived based on the established parts of quantum mechanics. It turns out that the wave function represents the state of random discontinuous motion of particles, and its modulus square determines the probability density of the particles appearing in certain positions in space.

Clear-cut cases of decision-making under risk (known probabilities) are unusual in real life. The gambler’s decisions at the roulette table are as close as we can get to this type of decision-making. In contrast, decision-making under uncertainty (unknown probabilities) can be exemplified by a decision whether to enter a jungle that may contain unknown dangers. Life is usually more like an expedition into an unknown jungle than a visit to the casino. Nevertheless, it is common in decision-supporting disciplines to proceed (...) as if reasonably reliable probability estimates were available for all possible outcomes, i.e. as if the prevailing epistemic conditions were analogous to those of gambling at the roulette table. This mistake can be called the tuxedo fallacy . It is argued that traditional engineering practices such as safety factors and multiple safety barriers avoid this fallacy and that they therefore manage uncertainty better than probabilistic risk analysis (PRA). PRA is a useful tool, but it must be supplemented with other methods in order not to limit the analysis to dangers that can be assigned meaningful probability estimates. (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)

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)

I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, , in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, C->B holds just in case P[B|C] is greater than or equal (...) to r. Thus, each conditional in a given family behaves like conditional probability above some specific support level. (shrink)

An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if . . . , then . . . ” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is not necessarily equal to the unit interval (...) [0, 1]. Not all logically valid inference rules are probabilistically informative and vice versa. The relationship between logically valid and probabilistically informative inference rules is discussed and illustrated by examples such as the modus ponens or the affirming the consequent. We propose a method to evaluate the strength of CPL inference. (shrink)

Logical argument forms are investigated by second order probability density functions. When the premises are expressed by beta distributions, the conclusions usually are mixtures of beta distributions. If the shape parameters of the distributions are assumed to be additive (natural sampling), then the lower and upper bounds of the mixing distributions (P´olya-Eggenberger distributions) are parallel to the corresponding lower and upper probabilities in conditional probability logic.

We propose probability logic as an appropriate standard of reference for evaluating human inferences. Probability logical accounts of nonmonotonic reasoning with system p, and conditional syllogisms (modus ponens, etc.) are explored. Furthermore, we present categorical syllogisms with intermediate quantifiers, like the “most . . . ” quantifier. While most of the paper is theoretical and intended to stimulate psychological studies, we summarize our empirical studies on human nonmonotonic reasoning.

Newcomb problems turn on a tension between two principles of choice: roughly, a principle sensitive to the causal features of the relevant situation, and a principle sensitive only to evidential factors. Two-boxers give priority to causal beliefs, and one-boxers to evidential beliefs. A similar issue can arise when the modality in question is chance, rather than causation. In this case, the conflict is between decision rules based on credences guided solely by chances, and rules based on credences guided by other (...) sorts of probabilistic evidence. Far from excluding cases of the latter kind, Lewis’s Principal Principle explicitly allows for them, in the form of the caveat that credences should only follow beliefs about chances in the absence of "inadmissible evidence". In this paper I exhibit a tension in Lewis’s views on these two matters. I present a class of decision problems –- actually, I argue, a species of Newcomb problem –- in which Lewis’s view of the relevance of inadmissible evidence seems to recommend one-boxing, while his causal decision theory recommends two-boxing. I propose a diagnosis for this dilemma, and suggest a remedy, based on an extension of a proposal due to Ned Hall and others from the case of chance to that of causation. The remedy dissolves many apparent Newcomb problems, and makes one-boxing non-controversial in those that remain. (shrink)

Normative judgments involve two gradable features. First, the judgments themselves can come in degrees; second, the strength of reasons represented in the judgments can come in degrees. Michael Smith has argued that non-cognitivism cannot accommodate both of these gradable dimensions. The degrees of a non-cognitive state can stand in for degrees of judgment, or degrees of reason strength represented in judgment, but not both. I argue that (a) there are brands of noncognitivism that can surmount Smith’s challenge, and (b) any (...) brand of non-cognitivism that has even a chance of solving the Frege–Geach Problem and some related problems involving probabilistic consistency can also thereby solve Smith’s problem. Because only versions of non-cognitivism that can solve the Frege–Geach Problem are otherwise plausible, all otherwise plausible versions of noncognitivism can meet Smith’s challenge. (shrink)

In this paper the strategy for the eliminative reduction of the alethic modalities suggested by John Venn is outlined and it is shown to anticipate certain related contemporary empiricistic and nominalistic projects. Venn attempted to reduce the alethic modalities to probabilities, and thus suggested a promising solution to the nagging issue of the inclusion of modal statements in empiricistic philosophical systems. However, despite the promise that this suggestion held for laying the ‘ghost of modality’ to rest, this general approach, tempered (...) modal eliminativism, is shown to be inadequate for that task.

. (shrink)

A successful theory of the language of subjective uncertainty would meet several important constraints. First, it would explain how use of the language of subjective uncertainty affects addressees’ states of subjective uncertainty. Second, it would explain how such use affects what possibilities are treated as live for purposes of conversation. Third, it would accommodate 'quantifying in' to the scope of epistemic modals. Fourth, it would explain the norms governing the language of subjective uncertainty, and the differences between them and the (...) norms governing the language of subjective certainty. Neither truth conditional nor traditional force modfier theories of the language of subjective uncertainty look adequate to the task of satisfying all four of these constraints. (shrink)

Ex ante predicted outcomes should be interpreted as counterfactuals (potential histories), with errors as the spread between outcomes. But error rates have error rates. We reapply measurements of uncertainty about the estimation errors of the estimation errors of an estimation treated as branching counterfactuals. Such recursions of epistemic uncertainty have markedly different distributial properties from conventional sampling error, and lead to fatter tails in the projections than in past realizations. Counterfactuals of error rates always lead to fat tails, regardless of (...) the probability distribution used. A mere .01% branching error rate about the STD (itself an error rate), and .01% branching error rate about that error rate, etc. (recursing all the way) results in explosive (and infinite) moments higher than 1. Missing any degree of regress leads to the underestimation of small probabilities and concave payoffs (a standard example of which is Fukushima). The paper states the conditions under which higher order rates of uncertainty (expressed in spreads of counterfactuals) alters the shapes the of final distribution and shows which a priori beliefs about conterfactuals are needed to accept the reliability of conventional probabilistic methods (thin tails or mildly fat tails). (shrink)

Joyce (1998) gives an argument for probabilism: the doctrine that rational credences should conform to the axioms of probability. In doing so, he provides a distinctive take on how the normative force of probabilism relates to the injunction to believe what is true. But Joyce presupposes that the truth values of the propositions over which credences are defined are classical. I generalize the core of Joyce’s argument to remove this presupposition. On the same assumptions as Joyce uses, the credences of (...) a rational agent should always be weighted averages of truth value assignments. In the special case where the truth values are classical, the weighted averages of truth value assignments are exactly the probability functions. But in the more general case, probabilistic axioms formulated in terms of classical logic are violated—but we will show that generalized versions of the axioms formulated in terms of non-classical logics are satisfied. (shrink)

This is a study in the meaning of natural language probability operators, sentential operators such as probably and likely. We ask what sort of formal structure is required to model the logic and semantics of these operators. Along the way we investigate their deep connections to indicative conditionals and epistemic modals, probe their scalar structure, observe their sensitivity to contex- tually salient contrasts, and explore some of their scopal idiosyncrasies.