Lewis proved a Dutch book theorem for Conditionalization. The theorem shows that an agent who follows any credal update rule other than Conditionalization is vulnerable to bets that inflict a sure loss. Lewis’s theorem is tailored to factive formulations of Conditionalization, i.e. formulations on which the conditioning proposition is true. Yet many scientific and philosophical applications of Bayesian decision theory require a non-factive formulation, i.e. a formulation on which the conditioning proposition may be false. I prove a Dutch book theorem (...) tailored to non-factive Conditionalization. I also discuss the theorem’s significance. (shrink)

The idea that the quantum probabilities are best construed as the personal/subjective degrees of belief of Bayesian agents is an old one. In recent years the idea has been vigorously pursued by a group of physicists who fly the banner of quantum Bayesianism. The present paper aims to identify the prospects and problems of implementing QBism, and it critically assesses the claim that QBism provides a resolution of some of the long-standing foundations issues in quantum mechanics, including the measurement problem (...) and puzzles of nonlocality. (shrink)

David Lewis' "Principal Principle" is a purported principle of rationality connecting credence and objective chance. Almost all of the discussion of the Principal Principle in the philosophical literature assumes classical probability theory, which is unfortunate since the theory of modern physics that, arguably, speaks most clearly of objective chance is the quantum theory, and quantum probabilities are not classical probabilities. Given the generally accepted updating rule for quantum probabilities, there is a straight forward sense in which the Principal Principle is (...) a theorem of quantum probability theory for any credence function satisfying a suitable additivity requirement. No additional principle of rationality is needed to bring credence into line with objective chance. (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.

The discussion of different principles of additivity for probability functions has been largely focused on the personalist interpretation of probability. Very little attention has been given to additivity principles for physical probabilities. The form of additivity for quantum probabilities is determined by the algebra of observables that characterize a physical system and the type of quantum state that is realizable and preparable for that system. We assess arguments designed to show that only normal quantum states are realizable and preparable and, (...) therefore, quantum probabilities satisfy the principle of complete additivity. We underscore the little remarked fact that unless the dimension of the Hilbert space is incredibly large, complete additivity in ordinary non-relativistic quantum mechanics reduces to countable additivity. We then turn to ways in which knowledge of quantum probabilities may constrain rational credence about quantum events and, thereby, constrain the additivity principle satisfied by rational credence functions. (shrink)

This paper discusses how to update one’s credences based on evidence that has initial probability 0. I advance a diachronic norm, Kolmogorov Conditionalization, that governs credal reallocation in many such learning scenarios. The norm is based upon Kolmogorov’s theory of conditional probability. I prove a Dutch book theorem and converse Dutch book theorem for Kolmogorov Conditionalization. The two theorems establish Kolmogorov Conditionalization as the unique credal reallocation rule that avoids a sure loss in the relevant learning scenarios.