Online research in philosophy

Henry Kyburg’s lottery paradox (1961, p. 197) arises from considering a fair 1000 ticket lottery that has exactly one winning ticket. If this much is known about the execution of the lottery it is therefore rational to accept that one ticket will win. Suppose that an event is very likely if the probability of its occurring is greater than 0.99. On these grounds it is presumed rational to accept the proposition that ticket 1 of the lottery will not win. Since the lottery is fair, it is rational to accept that ticket 2 won’t win either—indeed, it is rational to accept for any individual ticket i of the lottery that ticket i will not win. However, accepting that ticket 1 won’t win, accepting that ticket 2 won’t win, . . . , and accepting that ticket 1000 won’t win entails that it is rational to accept that no ticket will win, which entails that it is rational to accept the contradictory proposition that one ticket wins and no ticket wins.

Although a strict dichotomy between facts and values is no longer accepted, less attention has been paid to the roles values should play in our acceptance of factual statements, or scientific descriptive claims. This paper argues that values, whether cognitive or ethical, should never preclude or direct belief on their own. Our wanting something to be true will not make it so. Instead, values should only be used to consider whether the available evidence provides sufficient warrant for a claim. This argument is made for all relevant values, including cognitive, ethical, and social values. The rational integrity of science depends not on excluding some values and including others in the reasoning process, but of constraining all values to their proper role in belief acceptance.

The rule of adjunction is intuitively appealing and uncontroversial for deductive inference, but in situations where information can be uncertain, the rule is neither needed nor wanted for rational acceptance, as illustrated by the lottery paradox. Practical certainty is the acceptance of statements whose chances of error are smaller than a prescribed threshold parameter, when evaluated against an evidential corpus. We examine the failure of adjunction in relation to the threshold parameter for practical certainty, with an eye towards reinstating the rule of adjunction in some restricted forms, by observing the conditions under which the overall chance of error of the joint statements can be variously bounded.

In a penetrating investigation of the relationship between belief and quantitative degrees of confidence (or degrees of belief) Richard Foley (1992) suggests the following thesis: ... it is epistemically rational for us to believe a proposition just in case it is epistemically rational for us to have a sufficiently high degree of confidence in it, sufficiently high to make our attitude towards it one of belief. Foley goes on to suggest that rational belief may be just rational degree of confidence above some threshold level that the agent deems sufficient for belief. He finds hints of this view in Locke’s discussion of probability and degrees of assent, so he calls it the Lockean Thesis.1 The Lockean Thesis has important implications for the logic of belief. Most prominently, it implies that even a logically ideal agent whose degrees of confidence satisfy the axioms of probability theory may quite rationally believe each of a large body of propositions that are jointly inconsistent. For example, an agent may legitimately believe that on each given occasion her well-maintained car will start, but nevertheless believe that she will eventually encounter a..

As the ongoing literature on the paradoxes of the Lottery and the Preface reminds us, the nature of the relation between probability and rational acceptability remains far from settled. This article provides a novel perspective on the matter by exploiting a recently noted structural parallel with the problem of judgment aggregation. After offering a number of general desiderata on the relation between finite probability models and sets of accepted sentences in a Boolean sentential language, it is noted that a number of these constraints will be satisfied if and only if acceptable sentences are true under all valuations in a distinguished non-empty set W. Drawing inspiration from distance-based aggregation procedures, various scoring rule based membership conditions for W are discussed and a possible point of contact with ranking theory is considered. The paper closes with various suggestions for further research.

A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.

The lottery paradox can be solved if epistemic justification is assumed to be a species of permissibility. Given this assumption, the starting point of the paradox can be formulated as the claim that, for each lottery ticket, I am permitted to believe that it will lose. This claim is ambiguous between two readings, depending on the scope of ‘permitted’. On one reading, the claim is false; on another, it is true, but, owing to the general failure of permissibility to agglomerate, does not generate the paradox. The solution generalizes to formulations of the paradox in terms of rational acceptability and doxastic rationality.

We defend a set of acceptance rules that avoids the lottery paradox, that is closed under classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We show that the rules we recommend provide a semantics that validates exactly Adams’ conditional logic and are exactly the rules that preserve a natural, logical structure over probabilistic credal states that we call probalogic . To motivate probalogic, we first expand classical logic to geo-logic , which fills the entire unit cube, and then we project the upper surfaces of the geo-logical cube onto the plane of probabilistic credal states by means of standard, linear perspective, which may be interpreted as an extension of the classical principle of indifference. Finally, we apply the geometrical/logical methods developed in the paper to prove a series of trivialization theorems against question-invariance as a constraint on acceptance rules and against rational monotonicity as an axiom of conditional logic in situations of uncertainty.

The Lottery Paradox is generally thought to point at a conflict between two intuitive principles, to wit, that high probability is sufficient for rational acceptability, and that rational acceptability is closed under logical derivability. Gilbert Harman has offered a solution to the Lottery Paradox that allows one to stick to both of these principles. The solution requires the principle that acceptance licenses conditionalization. The present study shows that adopting this principle alongside the principle that high probability is sufficient for rational acceptability gives rise to another paradox.