Thomas Kroedel argues that the lottery paradox can be solved by identifying epistemic justification with epistemic permissibility rather than epistemic obligation. According to his permissibility solution, we are permitted to believe of each lottery ticket that it will lose, but since permissions do not agglomerate, it does not follow that we are permitted to have all of these beliefs together, and therefore it also does not follow that we are permitted to believe that all tickets will lose. I (...) present two objections to this solution. First, even if justification itself amounts to no more than epistemic permissibility, the lottery paradox recurs at the level of doxastic obligations unless one adopts an extremely permissive view about suspension of belief that is in tension with our practice of doxastic criticism. Second, even if there are no obligations to believe lottery propositions, the permissibility solution fails because epistemic permissions typically agglomerate, and the lottery case provides no exception to this rule. (shrink)

To resolve the lottery paradox, the “no-justification account” proposes that one is not justified in believing that one's lottery ticket is a loser. The no-justification account commits to what I call “the Harman-style skepticism”. In reply, proponents of the no-justification account typically downplay the Harman-style skepticism. In this paper, I argue that the no-justification reply to the Harman-style skepticism is untenable. Moreover, I argue that the no-justification account is epistemically ad hoc. My arguments are based on a rather (...) surprising finding that the no-justification account implies that people living in Taiwan typically suffer from the Harman-style skepticism. (shrink)

The lottery and preface paradoxes pose puzzles in epistemology concerning how to think about the norms of reasonable or permissible belief. Contextualists in epistemology have focused on knowledge ascriptions, attempting to capture a set of judgments about knowledge ascriptions and denials in a variety of contexts (including those involving lottery beliefs and the principles of closure). This article surveys some contextualist approaches to handling issues raised by the lottery and preface, while also considering some of the difficulties (...) encountered by those approaches. (shrink)

Abstract: Lotteries have long been a source of fascination and intrigue, offering the tantalizing prospect of unexpected fortunes. In this research paper, we delve into the world of lottery predictions, employing cutting-edge AI techniques to unlock the secrets of lottery outcomes. Our dataset, obtained from Kaggle, comprises historical lottery draws, and our goal is to develop predictive models that can anticipate future winning numbers. This study explores the use of deep learning and time series analysis to achieve (...) this elusive feat. Through rigorous experimentation and data-driven approaches, we seek to determine the viability of AI in the realm of lottery predictions. Our findings reveal both the promise and limitations of AI in this context, shedding light on the complexities of lottery data and the potential need for quantum computing as a last resort. (shrink)

A ‘lottery belief’ is a belief that a particular ticket has lost a large, fair lottery, based on nothing more than the odds against it winning. The lottery paradox brings out a tension between the idea that lottery beliefs are justified and the idea that that one can always justifiably believe the deductive consequences of things that one justifiably believes – what is sometimes called the principle of closure. Many philosophers have treated the lottery paradox (...) as an argument against the second idea – but I make a case here that it is the first idea that should be given up. As I shall show, there are a number of independent arguments for denying that lottery beliefs are justified. (shrink)

The lottery paradox involves a set of judgments that are individually easy, when we think intuitively, but ultimately hard to reconcile with each other, when we think reflectively. Empirical work on the natural representation of probability shows that a range of interestingly different intuitive and reflective processes are deployed when we think about possible outcomes in different contexts. Understanding the shifts in our natural ways of thinking can reduce the sense that the lottery paradox reveals something problematic about (...) our concept of knowledge. However, examining these shifts also raises interesting questions about how we ought to be thinking about possible outcomes in the first place. (shrink)

I review recent empirical findings on knowledge attributions in lottery cases and report a new experiment that advances our understanding of the topic. The main novel finding is that people deny knowledge in lottery cases because of an underlying qualitative difference in how they process probabilistic information. “Outside” information is generic and pertains to a base rate within a population. “Inside” information is specific and pertains to a particular item’s propensity. When an agent receives information that 99% of (...) all lottery tickets lose (outside information), people judge that she does not know that her ticket will lose. By contrast, when an agent receives information that her specific ticket is 99% likely to lose (inside information), people judge that she knows that her ticket will lose. Despite this difference in knowledge judgments, people rate the likelihood of her ticket losing the exact same in both cases (i.e. 99%). The results shed light on other factors affecting knowledge judgments in lottery cases, including formulaic expression and participants’ own estimation of whether it is true that the ticket will lose. The results also undermine previous hypotheses offered for knowledge denial in lottery cases, including the hypotheses that people deny knowledge because they either deny justification or acknowledge a chance for error. (shrink)

This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.

In some lottery situations, the probability that your ticket's a loser can get very close to 1. Suppose, for instance, that yours is one of 20 million tickets, only one of which is a winner. Still, it seems that (1) You don't know yours is a loser and (2) You're in no position to flat-out assert that your ticket is a loser. "It's probably a loser," "It's all but certain that it's a loser," or even, "It's quite certain that (...) it's a loser" seem quite alright to say, but, it seems, you're in no position to declare simply, "It's a loser." (1) and (2) are closely related phenomena. In fact, I'll take it as a working hypothesis that the reason "It's a loser" is unassertable is that (a) You don't seem to know that your ticket's a loser, and (b) In flat-out asserting some proposition, you represent yourself as knowing it.1 This working hypothesis will enable me to address these two phenomena together, moving back and forth freely between them. I leave it to those who reject the hypothesis to sort out those considerations which properly apply to the issue of knowledge from those germane to that of assertability. Things are quite different when you report the results of last night's basketball game. Suppose your only source is your morning newspaper, which did not carry a story about the 1 game, but simply listed the score, "Knicks 83, at Bulls 95," under "Yesterday's Results." Now, it doesn't happen very frequently, but, as we all should suspect, newspapers do misreport scores from time to time. On several occasions, my paper has transposed a result, attributing to each team the score of its opponent. In fact, that your paper's got the present result wrong seems quite a bit more probable than that you've won the lottery of the above paragraph. Still, when asked, "Did the Bulls win yesterday?", "Probably" and "In all likelihood" seem quite unnecessary. "Yes, they did," seems just fine.. (shrink)

In the first chapter of his Knowledge and Lotteries, John Hawthorne argues that thinkers do not ordinarily know lottery propositions. His arguments depend on claims about the intimate connections between knowledge and assertion, epistemic possibility, practical reasoning, and theoretical reasoning. In this paper, we cast doubt on the proposed connections. We also put forward an alternative picture of belief and reasoning. In particular, we argue that assertion is governed by a Gricean constraint that makes no reference to knowledge, and (...) that practical reasoning has more to do with rational degrees of belief than with states of knowledge. (shrink)

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)

In mathematics, any form of probabilistic proof obtained through the application of a probabilistic method is not considered as a legitimate way of gaining mathematical knowledge. In a series of papers, Don Fallis has defended the thesis that there are no epistemic reasons justifying mathematicians’ rejection of probabilistic proofs. This paper identifies such an epistemic reason. More specifically, it is argued here that if one adopts a conception of mathematical knowledge in which an epistemic subject can know a mathematical proposition (...) based solely on a probabilistic proof, one is then forced to admit that such an epistemic subject can know several lottery propositions based solely on probabilistic evidence. Insofar as knowledge of lottery propositions on the basis of probabilistic evidence alone is denied by the vast majority of epistemologists, it is concluded that this constitutes an epistemic reason for rejecting probabilistic proofs as a means of acquiring mathematical knowledge. (shrink)

Shortages of new therapeutics to treat coronavirus disease (COVID-19) have forced clinicians, public health officials, and health systems to grapple with difficult questions about how to fairly allocate potentially life-saving treatments when there are not enough for all patients in need (1). Shortages have occurred with remdesivir, tocilizumab, monoclonal antibodies, and the oral antiviral Paxlovid (2) -/- Ensuring equitable allocation is especially important in light of the disproportionate burden experienced during the COVID-19 pandemic by disadvantaged groups, including Black, Hispanic/Latino and (...) Indigenous communities, individuals with certain disabilities, and low-income persons. However, many health systems have resorted to first-come, first-served approaches to allocation, which tend to disadvantage individuals with barriers in access to care (3). There is mounting evidence of racial, ethnic, and socioeconomic disparities in access to medications for COVID-19 (4, 5). -/- One potential method to promote equitable allocation is to use a weighted lottery, which is an allocation strategy that gives all eligible patients a chance to receive the scarce treatment while also allowing the assignment of higher or lower chances according to other ethical considerations (6). We sought to assess the feasibility of implementing a weighted lottery to allocate scarce COVID-19 medications in a large U.S. health system and to determine whether the weighted lottery promotes equitable allocation. (shrink)

If someone disagrees with my moral views, or more generally if I’m in a group of n people who all disagree with each other, but I don’t have any special evidence or basis for my epistemic superiority, then it’s at best a 1-in-n chance that my views are correct. The skeptical threat from disagreement is thus a kind of moral lottery, to adapt a similar metaphor from Sharon Street. Her own genealogical debunking argument, as I discuss, relies on a (...) premise of such disagreement among evolutionary counterparts. -/- In this paper, I resist the threat from disagreement by showing that, on some of the most influential and most attractive theories of content determination, the premise of moral disagreement cannot serve any skeptical or revisionary purposes. I examine and criticize attempts, made by Gilbert Harman and Sharon Street, to argue from disagreement to relativism by relying on a theory of content determination that involves a principle that, within certain constraints, maximizes the attribution to us of true beliefs. And I examine and criticize Robert Williams’s attempt to show there is moral disagreement by relying on a theory of content determination that involves a principle that instead maximizes the attribution to us of rationality. My overall aim is to defend commonsense moral realism via a careful look at the theory of content and concepts. (shrink)

Many authors in ethics, economics, and political science endorse the Lottery Requirement, that is, the following thesis: where different parties have equal moral claims to one indivisible good, it is morally obligatory to let a fair lottery decide which party is to receive the good. This article defends skepticism about the Lottery Requirement. It distinguishes three broad strategies of defending such a requirement: the surrogate satisfaction account, the procedural account, and the ideal consent account, and argues that (...) none of these strategies succeed. The article then discusses and discharges some remaining grounds for resistance to these skeptical conclusions, as well as the possibility of defending a weaker version of a normative lottery principle. The conclusion is that we have no reason to believe that where equal claims conflict, we are morally required to hold a lottery, as opposed to simply picking one of the parties on more subjective grounds or out of pure whim. In addition to the practical consequences of this skeptical view, the article sketches some theoretical implications for debates about saving the greater number and about axiomatic utilitarianism. (shrink)

This paper elaborates a new solution to the lottery paradox, according to which the paradox arises only when we lump together two distinct states of being confident that p under one general label of ‘belief that p’. The two-state conjecture is defended on the basis of some recent work on gradable adjectives. The conjecture is supported by independent considerations from the impossibility of constructing the lottery paradox both for risk-tolerating states such as being afraid, hoping or hypothesizing, and (...) for risk-averse, certainty-like states. The new proposal is compared to views within the increasingly popular debate opposing dualists to reductionists with respect to the relation between belief and degrees of belief. (shrink)

According to the permissibility solution to the lottery paradox, the paradox can be solved if we conceive of epistemic justification as a species of permissibility. Clayton Littlejohn has objected that the permissibility solution draws on a sufficient condition for permissible belief that has implausible consequences and that the solution conflicts with our lack of knowledge that a given lottery ticket will lose. The paper defends the permissibility solution against Littlejohn's objections.

This article discusses Keith DeRose’s treatment of the lottery problem in Chapter 5 of his recent The Appearance of Ignorance. I agree with a lot of it but also raise some critical points and questions and make some friendly proposals. I discuss different ways to set up the problem, go into the difference between knowing and ending inquiry, propose to distinguish between two different kinds of lotteries, add to the defense of the idea that one can know lottery (...) propositions, give a critical discussion of DeRose’s contextualist solution to the problem, and support his defense against an absurdity objection with additional arguments. (shrink)

There are many conceivable circumstances in which some people have to be sacrificed in order to give others a chance to survive. The fair and rational method of selection is a lottery with equal chances. But why should losers comply, when they have nothing to lose in a war of all against all? A novel solution to this Compliance Problem is proposed. The lottery must be made self-enforcing by making the lots themselves the means of enforcement of the (...) outcome. This way no external authority is needed to make the losers’ compliance rational both ex ante and ex post. A fairly realistic concrete scenario is sketched to show that the solution could be made to work in practice, particularly since making it work is in everyone’s enlightened self-interest in the circumstances. (shrink)

We conducted five experiments that reveal some main contours of the folk epistemology of lotteries. The folk tend to think that you don't know that your lottery ticket lost, based on the long odds ("statistical cases"); by contrast, the folk tend to think that you do know that your lottery ticket lost, based on a news report ("testimonial cases"). We evaluate three previous explanations for why people deny knowledge in statistical cases: the justification account, the chance account, and (...) the statistical account. None of them seems to work. We then propose a new explanation of our own, the formulaic account, according to which some people deny knowledge in statistical cases due to formulaic expression. (shrink)

This work is a complete mathematical guide to lottery games, covering all of the problems related to probability, combinatorics, and all parameters describing the lottery matrices, as well as the various playing systems. The mathematics sections describe the mathematical model of the lottery, which is in fact the essence of the lotto game. The applications of this model provide players with all the mathematical data regarding the parameters attached to the gaming events and personal playing systems. By (...) applying these data, one can find all the winning probabilities for the play with one line, and how these probabilities change with playing the various types of systems containing several lines, depending on their structure. Also, each playing system has a formula attached that provides the number of possible multiple prizes in various circumstances. Other mathematical parameters of the playing systems and the correlations between them are also presented. The generality of the mathematical model and of the obtained formulas allows their application for any existent lottery and any playing system. Each formula is followed by numerical results covering the most frequent lottery matrices worldwide and by multiple examples predominantly belonging to the 6/49 lottery. The listing of the numerical results in dozens of well-organized tables, along with instructions and examples of using them, makes possible the direct usage of this guide by players without a mathematical background. The author also discusses from a mathematical point of view the strategies of choosing involved in the lotto game. The book does not offer so-called winning strategies, but helps players to better organize their own playing systems and to confront their own convictions with the incontestable reality offered by the direct applications of the mathematical model of the lotto game. As a must-have handbook for any lottery player, this book offers essential information about the game itself and can provide the basis for gaming decisions of any kind. (shrink)

Vann McGee has presented a putative counterexample to modus ponens. I show that (a slightly modified version of) McGee’s election scenario has the same structure as a famous lottery scenario by Kyburg. More specifically, McGee’s election story can be taken to show that, if the Lockean Thesis holds, rational belief is not closed under classical logic, including classical-logic modus ponens. This conclusion defies the existing accounts of McGee’s puzzle.

We prove a representation theorem for preference relations over countably infinite lotteries that satisfy a generalized form of the Independence axiom, without assuming Continuity. The representing space consists of lexicographically ordered transfinite sequences of bounded real numbers. This result is generalized to preference orders on abstract superconvex spaces.

De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those that support the other axioms of the probability calculus as compulsory for subjective interpretations. These two lines of reasoning can be (...) reconciled through a slight generalization of the Dutch Book framework. Countable additivity may indeed be abandoned for de Finetti's lottery, but this poses no serious threat to its adoption in most applications of subjective probability. Introduction The de Finetti lottery Two objections to equiprobability 3.1 The ‘No random mechanism’ argument 3.2 The Dutch Book argument Equiprobability and relative betting quotients The re-labelling paradox 5.1 The paradox 5.2 Resolution: from symmetry to relative probability Beyond the de Finetti lottery. (shrink)

In this paper it will be attempted to dissolve the lottery problem based on fallibilism, probabilism and the introduction of a so far widely neglected second context of knowledge. First, it will be argued that the lottery problem is actually an exemplification of the much wider Humean "future knowledge problem" (ch. 1). Two types of inferences and arguments will be examined, compared and evaluated in respect to their ability to fittingly describe the thought processes behind lottery/future knowledge (...) propositions (ch. 2). A second context of knowledge that underlines the importance of fallibilism and probabilism in a somewhat different manner will be introduced (ch. 3) and, based on that "two-context probabilism," the lottery/future knowledge problem will be dissolved (ch. 4). Lastly, it will be hinted at the necessity of adopting not just fallibilism including and two context minding probabilism, but, beyond that, also the even more encompassing position of both ontological and epistemological "gradualism" (ch. 5). (shrink)

Over the past two decades, gamblers have begun taking mathematics into account more seriously than ever before. While probability theory is the only rigorous theory modeling the uncertainty, even though in idealized conditions, numerical probabilities are viewed not only as mere mathematical information, but also as a decision-making criterion, especially in gambling. This book presents the mathematics underlying the major games of chance and provides a precise account of the odds associated with all gaming events. It begins by explaining in (...) simple terms the meaning of the concept of probability for the layman and goes on to become an enlightening journey through the mathematics of chance, randomness and risk. It then continues with the basics of discrete probability, combinatorics and counting arguments for those interested in the supporting mathematics. These mathematic sections may be skipped by readers who do not have a minimal background in mathematics; these readers can skip directly to the Guide to Numerical Results to pick the odds and recommendations they need for the desired gaming situation. Doing so is possible due to the organization of that chapter, in which the results are listed at the end of each section, mostly in the form of tables. The chapter titled The Mathematics of Games of Chance presents these games not only as a good application field for probability theory, but also in terms of human actions where probability-based strategies can be tried to achieve favorable results. Through suggestive examples, the reader can see what are the experiments, events and probability fields in games of chance and how probability calculus works there. The main portion of this work is a collection of probability results for each type of game. Each game s section is packed with formulas and tables. Each section also contains a description of the game, a classification of the gaming events and the applicable probability calculations. The primary goal of this work is to allow the reader to quickly find the odds for a specific gaming situation, in order to improve his or her betting/gaming decisions. Every type of gaming event is tabulated in a logical, consistent and comprehensive manner. The complete methodology and complete or partial calculations are shown to teach players how to calculate probability for any situation, for every stage of the game for any game. Here, readers can find the real odds, returned by precise mathematical formulas and not by partial simulations that most software uses. Collections of odds are presented, as well as strategic recommendations based on those odds, where necessary, for each type of gaming situation. The book contains much new and original material that has not been published previously and provides great coverage of probabilities for the following games of chance: Dice, Slots, Roulette, Baccarat, Blackjack, Texas Hold em Poker, Lottery and Sport Bets. Most of games of chance are predisposed to probability-based decisions. This is why the approach is not an exclusively statistical one, but analytical: every gaming event is taken as an individual applied probability problem to solve. A special chapter defines the probability-based strategy and mathematically shows why such strategy is theoretically optimal.". (shrink)

Recent political theory has attempted to unbundle demos and ethnos, and thus citizenship from national identity. There are two possible ways to meet this challenge: by taming the relationship between citizenship and the nation, for example, by defending a form of liberal multicultural nationalism, or by transcending it with a postnational, cosmopolitan conception of citizenship. Both strategies run up against the boundedness of democratic authority. In this paper, I argue that Shachar adresses this issue in an innovative way, but remains (...) ultimately trapped by it. My argument has two parts. In the first one, I look at the analogy between property and citizenship on which Shachar rely to justify the obligations of wealthy states towards the global poor. I suggest that it does not work well to explain the rarity of citizenship and that the idea of taxing its value at the global level, however intuitive in liberal theory on property, could yield unexpected and non-liberal consequences. Nevertheless I also assess its merits. In the second part, I suggest that Shachar’s claim that her argument generates a legal obligation toward the global poor is not binding. It could only be so with the kind of cosmopolitan political institutions that she eschews. Thus we return where we begin. (shrink)

I show that the Lottery Paradox is just a version of the Sorites, and argue that this should modify our way of looking at the Paradox itself. In particular, I focus on what I call “the Cut-off Point Problem” and contend that this problem, well known by Sorites scholars, ought to play a key role in the debate on Kyburg’s puzzle. Very briefly, I show that, in the Lottery Paradox, the premises “ticket n°1 will lose”, “ticket n°2 will (...) lose”… “ticket n°1000 will lose” are equivalent to soritical premises of the form “~(the winning ticket is in {…, (tn)}) ⊃ ~(the winning ticket is in {…, tn, (tn + 1)})” (where “⊃” is the material conditional, “~” is the negation symbol, “tn” and “tn + 1” are “ticket n°n” and “ticket n°n + 1” respectively, and “{}” identify the elements of the lottery tickets’ set. The brackets in “(tn)” and “(tn + 1)” are meant to point out that in the antecedent of the conditional we do not always have a “tn” (and, as a result, a “tn + 1” in the consequent): consider the conditional “~(the winning ticket is in {}) ⊃ ~(the winning ticket is in {t1})”). As a result, failing to believe, for some ticket, that it will lose comes down to introducing a cut-off point in a chain of soritical premises. In this paper I explore the consequences of the different ways of blocking the Lottery Paradox with respect to the Cut-off Point Problem. A heap variant of the Lottery Paradox is especially relevant for evaluating the different solutions. One important result is that the most popular way out of the puzzle, i.e., denying the Lockean Thesis, becomes less attractive. Moreover, I show that, along with the debate on whether rational belief is closed under classical logic, the debate on the validity of modus ponens should play an important role in discussions on the Lottery Paradox. -/- . (shrink)

In recent work, Thomas Kroedel has proposed a novel solution to the lottery paradox. As he sees it, we are permitted/justified in believing some lottery propositions, but we are not permitted/justified in believing them all. I criticize this proposal on two fronts. First, I think that if we had the right to add some lottery beliefs to our belief set, we would not have any decisive reason to stop adding more. Suggestions to the contrary run into the (...) wrong kind of reason problem. Reflection on the preface paradox suggests as much. Second, while I agree with Kroedel that permissions do not agglomerate, I do not think that this fact can help us solve the lottery paradox. First, I do not think we have any good reason to think that we’re permitted to believe any lottery propositions. Second, I do not see any good reason to think that epistemic permissions do not agglomerate. (shrink)

I argue that we should solve the Lottery Paradox by denying that rational belief is closed under classical logic. To reach this conclusion, I build on my previous result that (a slight variant of) McGee’s election scenario is a lottery scenario (see Lissia 2019). Indeed, this result implies that the sensible ways to deal with McGee’s scenario are the same as the sensible ways to deal with the lottery scenario: we should either reject the Lockean Thesis or (...) Belief Closure. After recalling my argument to this conclusion, I demonstrate that a McGee-like example (which is just, in fact, Carroll’s barbershop paradox) can be provided in which the Lockean Thesis plays no role: this proves that denying Belief Closure is the right way to deal with both McGee’s scenario and the Lottery Paradox. A straightforward consequence of my approach is that Carroll’s puzzle is solved, too. (shrink)

According to the principle of Conjunction Closure, if one has justification for believing each of a set of propositions, one has justification for believing their conjunction. The lottery and preface paradoxes can both be seen as posing challenges for Closure, but leave open familiar strategies for preserving the principle. While this is all relatively well-trodden ground, a new Closure-challenging paradox has recently emerged, in two somewhat different forms, due to Backes :3773–3787, 2019a) and Praolini :715–726, 2019). This paradox synthesises (...) elements of the lottery and the preface and is designed to close off the familiar Closure-preserving strategies. By appealing to a normic theory of justification, I will defend Closure in the face of this new paradox. Along the way I will draw more general conclusions about justification, normalcy and defeat, which bear upon what Backes :2877–2895, 2019b) has dubbed the ‘easy defeat’ problem for the normic theory. (shrink)

I explore how rational belief and rational credence relate to evidence. I begin by looking at three cases where rational belief and credence seem to respond differently to evidence: cases of naked statistical evidence, lotteries, and hedged assertions. I consider an explanation for these cases, namely, that one ought not form beliefs on the basis of statistical evidence alone, and raise worries for this view. Then, I suggest another view that explains how belief and credence relate to evidence. My view (...) focuses on the possibilities that the evidence makes salient. I argue that this makes better sense of the difference between rational credence and rational belief than other accounts. (shrink)

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. (shrink)

To understand something involves some sort of commitment to a set of propositions comprising an account of the understood phenomenon. Some take this commitment to be a species of belief; others, such as Elgin and I, take it to be a kind of cognitive policy. This paper takes a step back from debates about the nature of understanding and asks when this commitment involved in understanding is epistemically appropriate, or ‘acceptable’ in Elgin’s terminology. In particular, appealing to lessons from the (...) lottery and preface paradoxes, it is argued that this type of commitment is sometimes acceptable even when it would be rational to assign arbitrarily low probabilities to the relevant propositions. This strongly suggests that the relevant type of commitment is sometimes acceptable in the absence of epistemic justification for belief, which in turn implies that understanding does not require justification in the traditional sense. The paper goes on to develop a new probabilistic model of acceptability, based on the idea that the maximally informative accounts of the understood phenomenon should be optimally probable. Interestingly, this probabilistic model ends up being similar in important ways to Elgin’s proposal to analyze the acceptability of such commitments in terms of ‘reflective equilibrium’. (shrink)

According to a common judgement, a social planner should often use a lottery to decide which of two people should receive a good. This judgement undermines one of the best-known arguments for utilitarianism, due to John C. Harsanyi, and more generally undermines axiomatic arguments for utilitarianism and similar views. In this paper we ask which combinations of views about (a) the social planner’s attitude to risk and inequality, and (b) the subjects’ attitudes to risk are consistent with the aforementioned (...) judgement. We find that the class of combinations of views that can plausibly accommodate this judgement is quite limited. But one theory does better than others: the theory of chance-sensitive utility. (shrink)

Questioning the ethical reasoning behind ways of attributing value to lives impacts philosophical dilemmas encountered in policy making and innovation in AI. For instance, this sort of reasoning requires us to determine how self-driving cars should behave when encountering real-life dilemmas such as inevitably crashing into one person as opposed to a group of people. -/- This issue will be examined with the Rocks Case, a case of conflict of interest where all the relevant parties are strangers, and we can (...) either save one person or a group of five. The two courses of action which will be discussed in this paper are: 1) “Ought to Save the Many” (OSM) and 2) “Permitted to Save the Few” (PSF). -/- The position of PSF using a weighted lottery will be argued for, rather than acting according to utilitarian or contractualist OSM reasoning, on the grounds that it would give all persons involved a fair opportunity of survival. This is judged to be a more important criterion than merely maximising the number of people to rescue. (shrink)

Government agencies and nonprofit organizations have increasingly turned to randomized controlled trials (RCTs) to evaluate public policy interventions. Random assignment is widely understood to be fair when there is equipoise; however, some scholars and practitioners argue that random assignment is also permissible when an intervention is reasonably expected to be superior to other trial arms. For example, some argue that random assignment to such an intervention is fair when the intervention is scarce, for it is sometimes fair to use a (...) lottery to allocate scarce goods. We investigate the permissibility of randomization in public policy RCTs when there is no equipoise, identifying two sets of conditions under which it is fair to allocate access to a superior intervention via random assignment. We also reject oft-made claims that alternative study designs, including stepped-wedge designs and uneven randomization, offer fair ways to allocate beneficial interventions. (shrink)

Clayton Littlejohn claims that the permissibility solution to the lottery paradox requires an implausible principle in order to explain why epistemic permissions don't agglomerate. This paper argues that an uncontentious principle suffices to explain this. It also discusses another objection of Littlejohn's, according to which we’re not permitted to believe lottery propositions because we know that we’re not in a position to know them.

The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic uncertainty (...) in known premises. The first strategy, while effective, retains little of the original idea—conclusions even of modus ponens inferences from known premises are not always known. We then look at the second strategy, inspecting the most elaborate and promising attempt to secure the epistemic role of basic inferences, namely Timothy Williamson’s safety theory of knowledge. We argue that while it indeed has the merit of allowing basic inferences such as modus ponens to extend knowledge, Williamson’s theory faces formidable difficulties. These difficulties, moreover, arise from the very feature responsible for its virtue- the infallibilism of knowledge. (shrink)

Agents are often assumed to have degrees of belief (“credences”) and also binary beliefs (“beliefs simpliciter”). How are these related to each other? A much-discussed answer asserts that it is rational to believe a proposition if and only if one has a high enough degree of belief in it. But this answer runs into the “lottery paradox”: the set of believed propositions may violate the key rationality conditions of consistency and deductive closure. In earlier work, we showed that this (...) problem generalizes: there exists no local function from degrees of belief to binary beliefs that satisfies some minimal conditions of rationality and non-triviality. “Locality” means that the binary belief in each proposition depends only on the degree of belief in that proposition, not on the degrees of belief in others. One might think that the impossibility can be avoided by dropping the assumption that binary beliefs are a function of degrees of belief. We prove that, even if we drop the “functionality” restriction, there still exists no local relation between degrees of belief and binary beliefs that satisfies some minimal conditions. Thus functionality is not the source of the impossibility; its source is the condition of locality. If there is any non-trivial relation between degrees of belief and binary beliefs at all, it must be a “holistic” one. We explore several concrete forms this “holistic” relation could take. (shrink)

What is the relationship between degrees of belief and binary beliefs? Can the latter be expressed as a function of the former—a so-called “belief-binarization rule”—without running into difficulties such as the lottery paradox? We show that this problem can be usefully analyzed from the perspective of judgment-aggregation theory. Although some formal similarities between belief binarization and judgment aggregation have been noted before, the connection between the two problems has not yet been studied in full generality. In this paper, we (...) seek to fill this gap. The paper is organized around a baseline impossibility theorem, which we use to map out the space of possible solutions to the belief-binarization problem. Our theorem shows that, except in limiting cases, there exists no belief-binarization rule satisfying four initially plausible desiderata. Surprisingly, this result is a direct corollary of the judgment-aggregation variant of Arrow’s classic impossibility theorem in social choice theory. (shrink)

This dissertation is a contribution to formal and computational philosophy. -/- In the first part, we show that by exploiting the parallels between large, yet finite lotteries on the one hand and countably infinite lotteries on the other, we gain insights in the foundations of probability theory as well as in epistemology. Case 1: Infinite lotteries. We discuss how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. The solution boils down to the (...) introduction of infinitesimal probability values, which can be achieved using non-standard analysis. Our solution can be generalized to uncountable sample spaces, giving rise to a Non-Archimedean Probability (NAP) theory. Case 2: Large but finite lotteries. We propose application of the language of relative analysis (a type of non-standard analysis) to formulate a new model for rational belief, called Stratified Belief. This contextualist model seems well-suited to deal with a concept of beliefs based on probabilities ‘sufficiently close to unity’. -/- The second part presents a case study in social epistemology. We model a group of agents who update their opinions by averaging the opinions of other agents. Our main goal is to calculate the probability for an agent to end up in an inconsistent belief state due to updating. To that end, an analytical expression is given and evaluated numerically, both exactly and using statistical sampling. The probability of ending up in an inconsistent belief state turns out to be always smaller than 2%. (shrink)

This essay discusses the difficulty to reconcile two paradigms about beliefs: the binary or categorical paradigm of yes/no beliefs and the probabilistic paradigm of degrees of belief. The possibility for someone to hold both types of belief simultaneously is challenged by the lottery paradox, and more recently by a general impossibility theorem by Dietrich and List (2018, 2021). The nature, relevance, and implications of the tension are explained and assessed.

According to the traditional analysis of propositional knowledge (which derives from Plato's account in the Meno and Theaetetus), knowledge is justified true belief. This chapter develops the traditional analysis, introduces the famous Gettier and lottery problems, and provides an overview of prospective solutions. In closing, I briefly comment on the value of conceptual analysis, note how it has shaped the field, and assess the state of post-Gettier epistemology.

In this paper I will compare two competing accounts of assertion: the knowledge account and the justified belief account. When it comes to the evidence that is typically used to assess accounts of assertion – including the evidence from lottery propositions, the evidence from Moore’s paradoxical propositions and the evidence from conversational patterns – I will argue that the justified belief account has at least as much explanatory power as its rival. I will argue, finally, that a close look (...) at the ways in which assertions can be challenged and retracted reveals a certain advantage for the justified belief account. The paper will touch upon a number of further topics along the way, including the logical interaction between knowledge and justified belief, the nature of defeat, and the hypothesis that knowledge and justified belief are normatively coincident goals. (shrink)

The purpose of this note is to contrast a Cantorian outlook with a non-Cantorian one and to present a picture that provides support for the latter. In particular, I suggest that: i) infinite hyperreal numbers are the (actual, determined) infinite numbers, ii) ω is merely potentially infinite, and iii) infinitesimals should not be used in the di Finetti lottery. Though most Cantorians will likely maintain a Cantorian outlook, the picture is meant to motivate the obvious nature of the non-Cantorian (...) outlook. (shrink)

Most philosophers recognize that sometimes particular individuals have to be grateful to others who have benefited them in a way that provides reasons for treating them in a differential way. In the same way, I argue, there are cases in which society as such benefits from the actions of a person, which gives rise to collective duties of gratitude that must be expressed at the political and socio-economic levels. The political concern about merit should not be merely instrumental, but also (...) moral: a society cannot be just if it disregards its collective duties of gratitude. I criticize Rawls’ famous Natural Lottery Argument showing that it relies on a problematic understanding of the notion of moral responsibility and develop some considerations on the role that gratitude should play when designing both public institutions and policies. (shrink)

Harman’s lottery paradox, generalized by Vogel to a number of other cases, involves a curious pattern of intuitive knowledge ascriptions: certain propositions seem easier to know than various higher-probability propositions that are recognized to follow from them. For example, it seems easier to judge that someone knows his car is now on Avenue A, where he parked it an hour ago, than to judge that he knows that it is not the case that his car has been stolen and (...) driven away in the last hour. Contextualists have taken this pattern of intuitions as evidence that ‘knows’ does not always denote the same relationship; subject-sensitive invariantists have taken this pattern of intuitions as evidence that non-traditional factors such as practical interests figure in knowledge; still others have argued that the Harman Vogel pattern gives us a reason to abandon the principle that knowledge is closed under known entailment. This paper argues that there is a psychological explanation of the strange pattern of intuitions, grounded in the manner in which we shift between an automatic or heuristic mode of judgment and a controlled or systematic mode. Understanding the psychology behind the pattern of intuitions enables us to see that the pattern gives us no reason to abandon traditional intellectualist invariantism. The psychological account of the paradox also yields new resources for clarifying and defending the single premise closure principle for knowledge ascriptions. (shrink)