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 a recent article, Douven and Williamson offer both (i) a rebuttal of various recent suggested sufficient conditions for rational acceptability and (ii) an alleged ‘generalization’ of this rebuttal, which, they claim, tells against a much broader class of potential suggestions. However, not only is the result mentioned in (ii) not a generalization of the findings referred to in (i), but in contrast to the latter, it fails to have the probative force advertised. Their paper does however, if unwittingly, bring (...) us a step closer to a precise characterization of an important class of rationally unacceptable propositions—the class of lottery propositions for equiprobable lotteries. This helps pave the way to the construction of a genuinely lottery-paradox-proof alternative to the suggestions criticized in (i). (shrink)

Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invariance, adopted from the philosophy of science, and we argue for the normative desirability of translation invariance. We characterize the class of translation invariant aggregation functions in the canonical judgment aggregation model, which requires collective judgments to be complete. Since there are reasonable translation invariant aggregation functions, our result can be viewed as a possibility (...) theorem. At the same time, we show that translation invariance does have certain normatively undesirable consequences (e.g. failure of anonymity). We present a way of circumventing them by moving to a more general model of judgment aggregation, one that allows for incomplete collective judgments. (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)

"A Survey of Ranking Theory": The paper gives an up-to-date survey of ranking theory. It carefully explains the basics. It elaborates on the ranking theoretic explication of reasons and their balance. It explains the dynamics of belief statable in ranking terms and indicates how the ranks can thereby be measured. It suggests how the theory of Bayesian nets can be carried over to ranking theory. It indicates what it might mean to objectify ranks. It discusses the formal and the philosophical (...) aspects of the tight relation and the complementarity of ranks and probabilities. It closes with comparative remarks on predecessors and other philosophical proposals as well as formal models developed in AI. (shrink)

This comprehensive discussion of the problem of rational belief develops the subject on the pattern of Bayesian decision theory. The analogy with decision theory introduces philosophical issues not usually encountered in logical studies and suggests some promising new approaches to old problems."We owe Professor Levi a debt of gratitude for producing a book of such excellence. His own approach to inductive inference is not only original and profound, it also clarifies and transforms the work of his predecessors. In short, the (...) book deserves to become a classic....There is a great deal of interest in the book besides these basic matters [forumlating rules of acceptance]. Some of the most interesting chapters are those that examine the implications of such rules. The discussions of probability, generalization, and various forms of inference are brilliant and enlightening. Indeed, the problems and methods elaborated by Professor Levi in his book serve as a new foundation for the study of inductive inference."--Keith Lehrer, Nous"Levi's book is an extremely interesting report on 'tentative and speculative first steps' toward a decision-theoretic approach to inductive inference....Professor Levi is to be congratulated on his ingenious development and application of this approach...."--Richard C. Jeffrey, The Journal of Philosophy. (shrink)

Of two false theories, One can be, Intuitively, Closer to the truth than the other. The purpose of the article is to propose a rigorous explication of this intuitive notion.

2 Popper's Logical Definition of Verisimilitude. 3 Popper's Probabilistic Definition of Verisimilitude. 4 Conclusion.

Many epistemologists have responded to the lottery paradox by proposing formal rules according to which high probability defeasibly warrants acceptance. Douven and Williamson present an ingenious argument purporting to show that such rules invariably trivialise, in that they reduce to the claim that a probability of 1 warrants acceptance. Douven and Williamson’s argument does, however, rest upon significant assumptions – amongst them a relatively strong structural assumption to the effect that the underlying probability space is both finite and uniform. In (...) this paper, I will show that something very like Douven and Williamson’s argument can in fact survive with much weaker structural assumptions – and, in particular, can apply to infinite probability spaces. (shrink)

The question of the relationship of the making of value judgments in a typically ethical sense to the methods and procedures of science has been discussed in the literature at least to that point which e. e. cummings somewhere refers to as “The Mystical Moment of Dullness.” Nevertheless, albeit with some trepidation, I feel that something more may fruitfully be said on the subject.

The aggregation of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a set of premises and a conclusion where the latter is logically equivalent to the former. When majority voting is applied to some propositions (the premises) it may give a different outcome than majority voting applied to another set of propositions (the (...) conclusion). This problem is known as the discursive dilemma (or paradox). The discursive dilemma is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escape-routes from the paradox—the so-called premise-based procedure and the conclusion-based procedure—are not, as I will show, satisfactory methods for group decision-making. In this paper I introduce a new aggregation procedure inspired by an operator defined in artificial intelligence in order to merge belief bases. The result is that we do not need to worry about paradoxical outcomes, since these arise only when inconsistent collective judgments are not ruled out from the set of possible solutions. (shrink)

List and Pettit have stated an impossibility theorem about the aggregation of individual opinion states. Building on recent work on the lottery paradox, this paper offers a variation on that result. The present result places different constraints on the voting agenda and the domain of profiles, but it covers a larger class of voting rules, which need not satisfy the proposition-wise independence of votes.

This paper is concerned with formal solutions to the lottery paradox on which high probability defeasibly warrants acceptance. It considers some recently proposed solutions of this type and presents an argument showing that these solutions are trivial in that they boil down to the claim that perfect probability is sufficient for rational acceptability. The argument is then generalized, showing that a broad class of similar solutions faces the same problem. An argument against some formal solutions to the lottery paradox The (...) argument generalized Some variations Adding modalities Anticipated objections. (shrink)

This book by one of the world's foremost philosophers in the fields of epistemology and logic offers an account of suppositional reasoning relevant to practical deliberation, explanation, prediction and hypothesis testing. Suppositions made 'for the sake of argument' sometimes conflict with our beliefs, and when they do, some beliefs are rejected and others retained. Thanks to such belief contravention, adding content to a supposition can undermine conclusions reached without it. Subversion can also arise because suppositional reasoning is ampliative. These two (...) types of nonmonotonic logic are the focus of this book. A detailed comparison of nonmonotonicity appropriate to both belief contravening and ampliative suppositional reasoning reveals important differences that have been overlooked. (shrink)

Judgment aggregation theory, which concerns the translation of individual judgments on logical propositions into consistent group judgments, has shown that group consistency generally cannot be guaranteed if each proposition is treated independently from the others. Developing the right method of abandoning independence is thus a high-priority goal. However, little work has been done in this area outside of a few simple approaches. To fill the gap, we compare four methods based on distance metrics between judgment sets. The methods generalize the (...) premise-based and sequential priority approaches to judgment aggregation, as well as distance-based preference aggregation. They each guarantee group consistency and implement a range of distinct functions with different properties, broadening the available tools for social choice. A central result is that only one of these methods (not previously considered in the literature) satisfies three attractive properties for all reasonable metrics. (shrink)

Several recent results on the aggregation of judgments over logically connected propositions show that, under certain conditions, dictatorships are the only propositionwise aggregation functions generating fully rational (i.e., complete and consistent) collective judgments. A frequently mentioned route to avoid dictatorships is to allow incomplete collective judgments. We show that this route does not lead very far: we obtain oligarchies rather than dictatorships if instead of full rationality we merely require that collective judgments be deductively closed, arguably a minimal condition of (...) rationality, compatible even with empty judgment sets. We derive several characterizations of oligarchies and provide illustrative applications to Arrowian preference aggregation and Kasher and Rubinsteinís group identification problem. (shrink)