In the middle of the 1980s, logical tools were discovered that make it possible to model changes in belief and knowledge in entirely new ways. These logical tools turned out to be applicable both to human beliefs and to the contents of databases. This is the first textbook in this new area. It contains both discursive chapters with a minimum of formalism and formal chapters in which proofs and proof methods are presented. By using different selections from the formal section (...) the book can be used on all levels of University education. (shrink)

Conditionalization and Jeffrey Conditionalization cannot simultaneously satisfy two widely held desiderata on rules for empirical learning. The first desideratum is confirmational holism, which says that the evidential import of an experience is always sensitive to our background assumptions. The second desideratum is commutativity, which says that the order in which one acquires evidence shouldn't affect what conclusions one draws, provided the same total evidence is gathered in the end. (Jeffrey) Conditionalization cannot satisfy either of these desiderata without violating the other. (...) This is a surprising problem, and I offer a diagnosis of its source. I argue that (Jeffrey) Conditionalization is inherently anti-holistic in a way that is just exacerbated by the requirement of commutativity. The dilemma is thus a superficial manifestation of (Jeffrey) Conditionalization's fundamentally anti-holistic nature. (shrink)

This is a discussion of the problem of extending the basic AGM belief revision theory to iterated belief revision: the problem of formulating rules, not only for revising a basic belief state in response to potential new information, but also for revising one’s revision rules in response to potential new information. The emphasis in the paper is on foundational questions about the nature of and motivation for various constraints, and about the methodology of the evaluation of putative counterexamples to proposed (...) constraints. Some specific constraints that have been proposed are criticized. The paper emphasizes the importance of meta-information—information about one’s sources of information—and argues that little of substance can be said about constraints on iterated belief revision at a level of abstraction that lacks the resources for explicit representation of meta-information. (shrink)

[Philip Percival] I aim to illuminate foundational epistemological issues by reflecting on 'epistemic consequentialism'-the epistemic analogue of ethical consequentialism. Epistemic consequentialism employs a concept of cognitive value playing a role in epistemic norms governing belief-like states that is analogous to the role goodness plays in act-governing moral norms. A distinction between 'direct' and 'indirect' versions of epistemic consequentialism is held to be as important as the familiar ethical distinction on which it is based. These versions are illustrated, respectively, by cognitive (...) decision-theory and reliabilism. Cognitive decision-theory is defended, and various conceptual issues concerning it explored. A simple dilemma suggests that epistemic consequentialism has radical consequences. /// [Robert Stalnaker] After reviewing the general ideas of the consequentialist framework, I take a critical look at two of the epistemic consequentialist projects that Philip Percival considers in his paper: the first assumes that there is a notion of acceptance that contrasts with belief and that can be evaluated by its expected epistemic utility. The second uses epis utility to evaluate beliefs and partial beliefs themselves, as well as actions, such as gathering information in the course of an inquiry. I express scepticism about the notion of acceptance required for the first project, and argue that the second kind of project can be fruitful only with a richer notion of epistemic utility than has yet been developed. (shrink)

Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set of laws of iterated contraction it specifies amend the laws hitherto discussed in the literature.

In 1985 Alchourrón, Gärdenfors and Makinson presented their now classic theory of theory change . In 1988 Adam Grove, generalizing David Lewis's theory of counterfactuals, presented a model theory suitable for the AGM theory. Although AGM and Grove mentioned object languages, neither used them. But recently, Maarten de Rijke has shown how object languages can be brought into the picture. In the present paper we take de Rijke's idea further, addressing the question whether there is a particular doxastic or epistemic (...) logic implicit in AGM. (shrink)

I aim to illuminate foundational epistemological issues by reflecting on ‘epistemic consequentialism’—the epistemic analogue of ethical consequentialism. Epistemic consequentialism employs a concept of cognitive value playing a role in epistemic norms governing belief-like states that is analogous to the role goodness plays in act-governing moral norms. A distinction between ‘direct’ and ‘indirect’ versions of epistemic consequentialism is held to be as important as the familiar ethical distinction on which it is based. These versions are illustrated, respectively, by cognitive decision-theory and (...) reliabilism. Cognitive decision-theory is defended, and various conceptual issues concerning it explored. A simple dilemma suggests that epistemic consequentialism has radical consequences. (shrink)

[Philip Percival] I aim to illuminate foundational epistemological issues by reflecting on 'epistemic consequentialism'-the epistemic analogue of ethical consequentialism. Epistemic consequentialism employs a concept of cognitive value playing a role in epistemic norms governing belief-like states that is analogous to the role goodness plays in act-governing moral norms. A distinction between 'direct' and 'indirect' versions of epistemic consequentialism is held to be as important as the familiar ethical distinction on which it is based. These versions are illustrated, respectively, by cognitive (...) decision-theory and reliabilism. Cognitive decision-theory is defended, and various conceptual issues concerning it explored. A simple dilemma suggests that epistemic consequentialism has radical consequences. /// [Robert Stalnaker] After reviewing the general ideas of the consequentialist framework, I take a critical look at two of the epistemic consequentialist projects that Philip Percival considers in his paper: the first assumes that there is a notion of acceptance that contrasts with belief and that can be evaluated by its expected epistemic utility. The second uses epis utility to evaluate beliefs and partial beliefs themselves, as well as actions, such as gathering information in the course of an inquiry. I express scepticism about the notion of acceptance required for the first project, and argue that the second kind of project can be fruitful only with a richer notion of epistemic utility than has yet been developed. (shrink)

I aim to illuminate foundational epistemological issues by reflecting on 'epistemic consequentialism'—the epistemic analogue of ethical consequentialism. Epistemic consequentialism employs a concept of cognitive value playing a role in epistemic norms governing belief-like states that is analogous to the role goodness plays in act-governing moral norms. A distinction between 'direct' and 'indirect' versions of epistemic consequentialism is held to be as important as the familiar ethical distinction on which it is based. These versions are illustrated, respectively, by cognitive decision-theory and (...) reliabilism. Cognitive decision-theory is defended, and various conceptual issues concerning it explored. A simple dilemma suggests that epistemic consequentialism has radical consequences. (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within a formal logical (...) language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

The pragmatic character of the Dutch book argument makes it unsuitable as an "epistemic" justification for the fundamental probabilist dogma that rational partial beliefs must conform to the axioms of probability. To secure an appropriately epistemic justification for this conclusion, one must explain what it means for a system of partial beliefs to accurately represent the state of the world, and then show that partial beliefs that violate the laws of probability are invariably less accurate than they could be otherwise. (...) The first task can be accomplished once we realize that the accuracy of systems of partial beliefs can be measured on a gradational scale that satisfies a small set of formal constraints, each of which has a sound epistemic motivation. When accuracy is measured in this way it can be shown that any system of degrees of belief that violates the axioms of probability can be replaced by an alternative system that obeys the axioms and yet is more accurate in every possible world. Since epistemically rational agents must strive to hold accurate beliefs, this establishes conformity with the axioms of probability as a norm of epistemic rationality whatever its prudential merits or defects might be. (shrink)

"[This book] proposes new foundations for the Bayesian principle of rational action, and goes on to develop a new logic of desirability and probabtility."—Frederic Schick, _Journal of Philosophy_.

The paper provides an argument for the thesis that an agent’s degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem. The latter says that an agent’s belief set is and will always be consistent and deductively closed iff her degrees of entrenchment satisfy the ranking axioms and are updated according to the ranktheoretic update rules.

The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W —defined on a field of propositions A over W. This research note shows under which conditions ranking functions on a field of propositions A over W and rankings on a language L are induced by pointwise ranking functions on W and the set of (...) models for L, ModL, respectively. (shrink)

Bayesian decision theory can be viewed as the core of psychological theory for idealized agents. To get a complete psychological theory for such agents, you have to supplement it with input and output laws. On a Bayesian theory that employs strict conditionalization, the input laws are easy to give. On a Bayesian theory that employs Jeffrey conditionalization, there appears to be a considerable problem with giving the input laws. However, Jeffrey conditionalization can be reformulated so that the problem disappears, and (...) in fact the reformulated version is more natural and easier to work with on independent grounds. (shrink)

Probabilism is committed to two theses: 1) Opinion comes in degrees—call them degrees of belief, or credences. 2) The degrees of belief of a rational agent obey the probability calculus. Correspondingly, a natural way to argue for probabilism is: i) to give an account of what degrees of belief are, and then ii) to show that those things should be probabilities, on pain of irrationality. Most of the action in the literature concerns stage ii). Assuming that stage i) has been (...) adequately discharged, various authors move on to stage ii) with varied and ingenious arguments. But an unsatisfactory response at stage i) clearly undermines any gains that might be accrued at stage ii) as far as probabilism is concerned: if those things are not degrees of belief, then it is irrelevant to probabilism whether they should be probabilities or not. In this paper we scrutinize the state of play regarding stage i). We critically examine several of the leading accounts of degrees of belief: reducing them to corresponding betting behavior (de Finetti); measuring them by that behavior (Jeffrey); and analyzing them in terms of preferences and their role in decision-making more generally (Ramsey, Lewis, Maher). We argue that the accounts fail, and so they are unfit to subserve arguments for probabilism. We conclude more positively: ‘degree of belief’ should be taken as a primitive concept that forms the basis of our best theory of rational belief and decision: probabilism. (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 show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

Wolfgang Spohn presents the first full account of the dynamic laws of belief, by means of ranking theory. This book is his long-awaited presentation of ranking theory and its ramifications.

SUGGESTED COURSES Introductory level A (Requires very little background in logic .): 4: -9 - - -7 -2 Introductory level B: -9,:+-+ -,2:+,2: -,3:20+-22+ -7 -2 ...

Various theories try to give accounts of how measures of this confidence do or ought to behave, both as far as the internal mental consistency of the agent as ...

In this paper, we formulate a qualitative “linear” utility theory for lotteries in which uncertainty is expressed qualitatively using a Spohnian disbelief function. We argue that a rational decision maker facing an uncertain decision problem in which the uncertainty is expressed qualitatively should behave so as to maximize “qualitative expected utility.” Our axiomatization of the qualitative utility is similar to the axiomatization developed by von Neumann and Morgenstern for probabilistic lotteries. We compare our results with other recent results in qualitative (...) decision making. (shrink)

Degrees of belief are familiar to all of us. Our confidence in the truth of some propositions is higher than our confidence in the truth of other propositions. We are pretty confident that our computers will boot when we push their power button, but we are much more confident that the sun will rise tomorrow. Degrees of belief formally represent the strength with which we believe the truth of various propositions. The higher an agent’s degree of belief for a particular (...) proposition, the higher her confidence in the truth of that proposition. For instance, Sophia’s degree of belief that it will be sunny in Vienna tomorrow might be .52, whereas her degree of belief that the train will leave on time might be .23. The precise meaning of these statements depends, of course, on the underlying theory of degrees of belief. These theories offer a formal tool to measure degrees of belief, to investigate the relations between various degrees of belief in different propositions, and to normatively evaluate degrees of belief. (shrink)

The main ingredients of Spohn's theory of epistemic beliefs are (1) a functional representation of an epistemic state called a disbelief function and (2) a rule for revising this function in light of new information. The main contribution of this paper is as follows. First, we provide a new axiomatic definition of an epistemic state and study some of its properties. Second, we study some properties of an alternative functional representation of an epistemic state called a Spohnian belief function. Third, (...) we state a rule for combining disbelief functions that is mathematically equivalent to Spohn's belief revision rule. Whereas Spohn's rule is defined in terms of the initial epistemic state and some features of the final epistemic state, the rule of combination is defined in terms of the initial epistemic state and the incremental epistemic state representing the information gained. Fourth, we state a rule of subtraction that allows one to recover the addendum epistemic state from the initial and final epistemic states. Fifth, we study some properties of our rule of combination. One distinct advantage of our rule of combination is that besides belief revision, it can be used to describe an initial epistemic state for many variables when this information is given as several independent epistemic states each involving few variables. Another advantage of our reformulation is that we can show that Spohn's theory of epistemic beliefs shares the essential abstract features of probability theory and the Dempster-Shafer theory of belief functions. One implication of this is that we have a ready-made algorithm for propagating disbelief functions using only local computation. (shrink)

It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)