Bayesian Epistemology is a general framework for thinking about agents who have beliefs that come in degrees. Theories in this framework give accounts of rational belief and rational belief change, which share two key features: (i) rational belief states are represented with probability functions, and (ii) rational belief change results from the acquisition of evidence. This dissertation focuses specifically on the second feature. I pose the Evidence Question: What is it to have evidence? Before addressing this question we must have (...) an understanding of Bayesian Epistemology. The first chapter argues that we should understand Bayesian Epistemology as giving us theories that are evaluative and not action-guiding. I reach this verdict after considering the popular ‘ought’-implies-‘can’ objection to Bayesian Epistemology. The second chapter argues that it is important for theories in Bayesian Epistemology to answer the Evidence Question, and distinguishes between internalist and externalist answers. The third and fourth chapters present and defend a specific answer to the Evidence Question. The account is inspired by reliabilist accounts of justification, and attempts to understand what it is to have evidence by appealing solely to considerations of reliability. Chapter 3 explains how to understand reliability, and how the account fits with Bayesian Epistemology, in particular, the requirement that an agent’s evidence receive probability 1. Chapter 4 responds to objections, which maintain that the account gives the wrong verdict in a variety of situations including skeptical scenarios, lottery cases, scientific cases, and cases involving inference. After slight modifications, I argue that my account has the resources to answer the objections. The fifth chapter considers the possibility of losing evidence. I show how my account can model these cases. To do so, however, we require a modification to Conditionalization, the orthodox principle governing belief change. I present such a modification. The sixth and seventh chapters propose a new understanding of Dutch Book Arguments, historically important arguments for Bayesian principles. The proposal shows that the Dutch Book Arguments for implausible principles are defective, while the ones for plausible principles are not. The final chapter is a conclusion. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

An impossibility result pertaining to the aggregation of individual judgements is thought by many to have significant implications for political theory, social epistemology and metaphysics. When members of a group hold a rational set of judgments on some interconnected questions, the theorem shows, it isn't always (logically) possible for them to aggregate their judgements into a collective one in conformity with seemingly very plausible constraints. I reject one of the constraints which engender the dilemma. The analogy with the lottery paradox, (...) I argue, shows that rational belief needn't be consistent. So the alleged implications of the dilemma are dispelled. (shrink)

Conditioning can make imprecise probabilities uniformly more imprecise. We call this effect "dilation". In a previous paper (1993), Seidenfeld and Wasserman established some basic results about dilation. In this paper we further investigate dilation on several models. In particular, we consider conditions under which dilation persists under marginalization and we quantify the degree of dilation. We also show that dilation manifests itself asymptotically in certain robust Bayesian models and we characterize the rate at which dilation occurs.

Following the pioneer work of Bruno De Finetti [12], conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's. Perhaps the most salient axiomatizations are Karl Popper's in [31], and Alfred Renyi's in [33]. Nonstandard probability spaces [34] are a well know alternative to this approach. Vann McGee proposed in [30] a result relating both approaches by showing that the standard values of infinitesimal probability functions are representable as Popper functions, and (...) that every Popper function is representable in terms of the standard real values of some infinitesimal measure. Our main goal in this article is to study the constraints on (qualitative and probabilistic) change imposed by an extended version of McGee's result. We focus on an extension capable of allowing for iterated changes of view. Such extension, we argue, seems to be needed in almost all considered applications. Since most of the available axiomatizations stipulate (definitionally) important constraints on iterated change, we propose a non-questionbegging framework, Iterative Probability Systems (IPS) and we show that every Popper function can be regarded as a Bayesian IPS. A generalized version of McGee's result is then proved and several of its consequences considered. In particular we note that our proof requires the imposition of Cumulativity, i.e. the principle that a proposition that is accepted at any stage of an iterative process of acceptance will continue to be accepted at any later stage. The plausibility and range of applicability of Cumulativity is then studied. In particular we appeal to a method for defining belief from conditional probability (first proposed in [42] and then slightly modified in [6] and [3]) in order to characterize the notion of qualitative change induced by Cumulative models of probability kinematics. The resulting cumulative notion is then compared with existing axiomatizations of belief change and probabilistic supposition. We also consider applications in the probabilistic accounts of conditionals [1] and [30]. (shrink)

Igor Douven has recently developed a challenge for accounts of justification according to which beliefs about lottery losers are never justified. This article argues that champions of such accounts can rise to Douven's challenge and, what's more, that they can turn Douven's argument around in the sense that they can legitimately take it to provide a vindication of their preferred view.

The structural view of rational acceptance is a commitment to developing a logical calculus to express rationally accepted propositions sufficient to represent valid argument forms constructed from rationally accepted formulas. This essay argues for this project by observing that a satisfactory solution to the lottery paradox and the paradox of the preface calls for a theory that both (i) offers the facilities to represent accepting less than certain propositions within an interpreted artificial language and (ii) provides a logical calculus of (...) rationally accepted formulas that preserves rational acceptance under consequence. The essay explores the merit and scope of the structural view by observing that some limitations to a recent framework advanced James Hawthorne and Luc Bovens are traced to their framework satisfying the first of these two conditions but not the second. (shrink)

In her paper “Argumentation theory and the conception of epistemic justification”, Lilian Bermejo-Luque presents a critique of deductivism in argumentation theory, as well as her own concept of epistemic justification inspired by the views of Stephen Toulmin. Reading this paper induced me to reflect on the mutual relation between the notions of justification and argumentation. In this work I would like to first draw the reader’s attention to a few issues which seem debatable to me, or which I find worth (...) presenting from a slightly different point of view than that of Lilian Bermejo-Luque. I agree that deductivism is not suitable for a general theory of evaluation of arguments although the critique of deductivism presented by the Author appears as not fully adequate to me. Then I proceed to presenting my doubts about the “conception of justification as a proper outcome of good argumentation” presented in the work. I need to emphasise that due to a broad range of topics addressed by me in this short paper, the description of some of them will be neither fully precise nor exhaustive. (shrink)

An area in the theory of action that has received little attention is how mental agency and world-directed agency interact. The purpose of the present contribution is to clarify the rational conditions of such interaction, through an analysis of the central case of acceptance. There are several problems with the literature about acceptance. First, it remains unclear how a context of acceptance is to be construed. Second, the possibility of conjoining, in acceptance, an epistemic component, which is essentially mind-to-world, and (...) a utility component, which requires a world-to-mind direction of fit, is merely posited rather than derived from the rational structure of acceptance. Finally, the norm of acceptance is generally seen as related to truth, which turns out to be inapplicable in a number of cases. We will argue, first, that the specific context-dependence of acceptances is derived from their being mental actions, each embedded in a complex hierarchy of acceptances composing, together, a planning sequence. Second, that acceptances come in several varieties, corresponding to the specific epistemic norm(s) that constitute them. The selection of a particular norm for accepting answers to considerations of utility – to the association of an epistemic goal with an encompassing world-directed action. Once a type of acceptance is selected, however, the epistemic norm constitutive for that acceptance strictly applies. Third, we argue that context-dependence superimposes a decision criterion on the output of the initial epistemic acceptance. Strategic acceptance is regulated by instrumental norms of expected utility, which may rationally lead an agent to screen off her initial epistemic acceptance. (shrink)

It can often be heard in the hallways, and occasionally read in print, that reliabilism runs into special trouble regarding lottery cases. My main aim in this paper is to argue that this is not so. Nevertheless, lottery cases do force us to pay close attention to the relation between justification and probability.

A dispute in epistemology has arisen over whether some class of things epistemic (things known or justified, for example) is closed under some operation involving the notion of what follows deductively from members of this class. Very few philosophers these days believe that if you know that p, and p entails q, then you know that q. But many philosophers think that something weaker holds, for instance that if you know that p, and p entails q, then you are in (...) a position to know that p, or if you know that p and you competently deduce p from q, then you know that q. However there are some considerations tracing back to Wittgenstein’s On Certainty and some early work by Fred Dretske that suggests even these weaker principles are false. (shrink)

Epistemic justification has been widely accepted as both a gradational and relational notion. Given those properties, a natural thought is to take degrees of epistemic justification to be probabilities. In this paper, we present a simple Bayesian framework for justification. In the first part, after putting the model in an evidentialist form, we distinguish different senses of “being evidence for” and “confirming”. Next, we argue that this conception should accommodate the two relevant kinds of qualitative confirmation or evidential support. In (...) the second part of the paper, we discuss the claim that this view is unable to satisfy the modified version of the conjunction closure for beliefs in probabilistically independent propositions. We defend that the underlying assumption on which this objection depends leads to an improper reading of the concept of epistemic probability. After providing a better interpretation of it, we put forward a rationale, which is based on the notion of conditional uncertainty, in support of a more plausible and restricted version of the closure of justification under conjunction. (shrink)

Edgington has proposed a solution to the sorites paradox in terms of ‘verities’, which she defines as degrees of closeness to clear truth. Central to her solution is the assumption that verities are formally probabilities. She is silent on what verities might derive from and on why they should be probabilities. This paper places Edgington’s solution in the framework of a spatial approach to conceptualization, arguing that verities may be conceived of as deriving from how our concepts relate to each (...) other. Building on work by Kamp and Partee, this paper further shows how verities, thus conceived of, may plausibly be assumed to have probabilistic structure. The new interpretation of verities is argued to also help answer the question of what the verities of indicative conditionals are, a question which Edgington leaves open. Finally, the question of how to accommodate higher-order vagueness, given this interpretation, is addressed. (shrink)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)

It is a prevalent, if not popular, thesis in the metaphysics of belief that facts about an agent’s beliefs depend entirely upon facts about that agent’s underlying credal state. Call this thesis ‘credal reductivism’ and any view that endorses this thesis a ‘credal reductivist view’. An adequate credal reductivist view will accurately predict both when belief occurs and which beliefs are held appropriately, on the basis of credal facts alone. Several well-known—and some lesser known—objections to credal reductivism turn on the (...) inability of standard credal reductivist views to get the latter, normative, results right. This paper presents and defends a novel credal reductivist view according to which belief is a type of “imprecise credence” that escapes these objections by including an extreme credence of 1. (shrink)

The 1985 paper by Carlos Alchourrón (1931–1996), Peter Gärdenfors, and David Makinson (AGM), "On the Logic of Theory Change: Partial Meet Contraction and Revision Functions" was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twentyfive years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in (...) the original framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

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

Thomas Kroedel has recently proposed an interesting Pareto-style condition on permissible belief. Despite the condition’s initial plausibility, this paper aims at providing a counterexample to it. The example is based on the view that a proper condition on permissible belief should not give permission to believe a proposition that undermines one’s belief system or whose epistemic standing decreases in the light of one’s de facto beliefs.

The conflict of narrowness and precision in direct inference occurs if a body of evidence contains estimates for frequencies in a certain reference class and less precise estimates for frequencies in a narrower reference class. To develop a solution to this conflict, I draw on ideas developed by Paul Thorn and John Pollock. First, I argue that Kyburg and Teng’s solution to the conflict of narrowness and precision leads to unreasonable direct inference probabilities. I then show that Thorn’s recent solution (...) to the conflict leads to unreasonable direct inference probabilities. Based on my analysis of Thorn’s approach, I propose a natural distribution for a Bayesian analysis of the data directly obtained from studying members of the narrowest reference class. (shrink)

Doxastic TheoriesThe application of formal tools to questions related to epistemology is of course not at all new. However, there has been a surge of interest in the field now known as “formal epistemology” over the past decade, with two annual conference series and an annual summer school at Carnegie Mellon University, in addition to many one-off events devoted to the field. A glance at the programs of these series illustrates the wide-ranging set of topics that have been grouped under (...) this name, ranging from rational choice theory and the foundations of statistics, to logics of knowledge and formal measures of coherence, with much more besides.In this paper I will ignore most of these topics, and just trace some parts of the history of two ideas about belief whose current interaction may lead to future progress. One idea is the idea of belief, disbelief, and suspension of judgment as a meaningful tripartite dis .. (shrink)

Bayesian networks are computer programs which represent probabilitistic relationships graphically as directed acyclic graphs, and which can use those graphs to reason probabilistically , often at relatively low computational cost. Almost every expert system in the past tried to support probabilistic reasoning, but because of the computational difficulties they took approximating short-cuts, such as those afforded by MYCIN's certainty factors. That all changed with the publication of Judea Pearl's Probabilistic Reasoning in Intelligent Systems, in 1988, which synthesized a decade of (...) research making accurate graphical probabilistic reasoning computationally achievable.Bayesian network technology is now one of the fastest growing fields of research in artificial intelligence. That it has become a publication industry in its own right is shown by a search on Google scholar :This development, together with a parallel related growth in the use of causal discovery algorithms which automate the learning of Bayesian networks from sample data, has generated considerable interest, and controversy, within the philosophy-of-science community.Three central questions bringing together AI researchers and philosophers of science are: Are Bayesian networks Bayesian? What is the relation between probability and causality? Are the assumptions behind causal discovery of Bayesian networks realistic or fantastical?Jon Williamson, as a philosopher of science with a keen interest in the technology, asks and answers these questions in his new book. Although it is self-contained, his book is not very likely as an introduction to the technology , nor is it optimal even as an introduction to the philosophical problems in interpreting Bayesian networks . Rather Williamson's book is an attempt to move the debate forward by solving the central problems of the …. (shrink)

I give a semantics for a logic with two pairs of doxastic modals and an indicative conditional connective that all nest without restriction. Sentences are evaluated as accepted, rejected, or neither. Certainty is the necessity-like modality of acceptance. Inferences may proceed from premises that are certain, or merely accepted, or a mix of both. This semantic setup yields some striking results. Notably, the existence of inferences that preserve certainty but not acceptance very directly implies both failure of modus ponens for (...) the indicative conditional in the logic of acceptance and failure of the deduction theorem for the material conditional in the logic of certainty. The latter failure dissolves, in the logic of certainty, the much - discussed tension between modus ponens and the law of import-export. (shrink)

Disquotational theories of truth are often criticised for being too weak to prove interesting generalisations about truth. In this paper we will propose a certain formal theory to serve as a framework for a solution of the generalisation problem. In contrast with Horwich’s original proposal, our framework will eschew psychological notions altogether, replacing them with the epistemic notion of believability. The aim will be to explain why someone who accepts a given disquotational truth theory Th, should also accept various generalisations (...) not provable in Th. The strategy will consist of the development of an axiomatic theory of believability, one permitting us to show how to derive the believability of generalisations from basic axioms that characterise the believability predicate, together with the information that Th is a theory of truth that we accept. (shrink)

We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.

There are circumstances in which we want to predict a series of interrelated events. Faced with such a prediction task, it is natural to consider logically inconsistent predictions to be irrational. However, it is possible to find cases where an inconsistent prediction has higher expected accuracy than any consistent prediction. Predicting tournaments in sports provides a striking example of such a case and I argue that logical consistency should not be a norm of rational predictions in these situations.

Although it may seem from its formalism that game theory must have sprung from the mind of John von Neumann as a corollary of his work on computers or theoretical physics, it should come as no real surprise to philosophers that game theory is the articulation of a historically developing philosophical conception of rationality in thought and action. The history of ideas about rationality is deeply contradictory at many turns. While there are theories of rationality that claim it is fundamentally (...) social and aims at understanding and molding all facets of human psychological life, game theory takes rationality to be essentially located in individuals and to concern only the means to achieve predetermined ends. Thus, there are some thinkers who have made important contributions to this history who do not appear in the story of game theory at all, among them, Plato, Kant, and Hegel. There is, however, a clear trail to follow linking theories of instrumental rationality from Aristotle to the nineteenth-century marginalist economists and ultimately to von Neumann and Morgenstern and contemporary game theorists, that historically grounds game theory as a model of rational interaction. (shrink)

After defending the pluralistic approach to the interpretation of probability statements, I argue that the correctness of objective probability statements is not to be explained in terms of objective probabilities attached to propositions. Such an explanation will enable us to uphold an intuitively appealing connection between probability and action only in indeterministic contexts, whereas the objectivity of probability statements doesn’t depend on the truth of indeterminism. I show how objective probability statements can be interpreted without ascribing objective probabilities to propositions. (...) Finally, I draw a cautionary conclusion about the prospects for providing a probabilistic analysis of causation. (shrink)

There is widespread agreement that we cannot know of a lottery ticket we own that it is a loser prior to the drawing of the lottery. At the same time we appear to have knowledge of events that will occur only if our ticket is a loser. Supposing any plausible closure principle for knowledge, the foregoing seems to yield a paradox. Appealing to some broadly Gricean insights, the present paper argues that this paradox is apparent only.

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

This manuscript presents a topological argumentation framework for modelling notions of evidence-based (i.e., justified) belief. Our framework relies on so-called topological evidence models to represent the pieces of evidence that an agent has at her disposal, and it uses abstract argumentation theory to select the pieces of evidence that the agent will use to define her beliefs. The tools from abstract argumentation theory allow us to model agents who make decisions in the presence of contradictory information. Thanks to this, it (...) is possible to define two new notions of beliefs, grounded beliefs and fully grounded beliefs. These notions are discussed in this paper, analysed and compared with the existing notion of topological justified belief. This comparison revolves around three main issues: closure under conjunction introduction, the level of consistency and their logical strength. (shrink)

There are two ways of representing rational belief: qualitatively as yes-or-no belief, and quantitatively as degrees of belief. Standard rationality conditions are: consistency and logical closure, for qualitative belief, satisfaction of the probability axioms, for quantitative belief, and a relationship between qualitative and quantitative beliefs in accordance with the Lockean thesis. In this paper, it is shown that these conditions are inconsistent with each of three further rationality conditions: fallibilism, open-mindedness, and invariance under independent conceptual expansions. Restrictions of the Lockean (...) thesis that have been suggested in the literature cannot remove the inconsistency. In the outlook we discuss two alternative ways of dealing with this problem: restricting conjunctive closure or going for a dual system account. (shrink)

An important trend in contemporary epistemology centers on elaborating an old idea of pragmatist pedigree: theory selection (and in general the process of changing view and fixing beliefs) presupposes epistemic values. This article focuses on analyzing the case where epistemic values are indeterminate or when the sources of valuation are multiple (epistemic values like coherence and simplicity need not order options in compatible ways). According to the theory that thus arises epistemic alternatives need not be fully ordered by an underlying (...) notion of information-value and therefore the usual economic techniques of optimization cannot be applied in order to compute optimal contractions. But in cases of this sort it is still rational to maximize, i.e. to deem an option as choosable when it is not known to be worse that any other. We present here basic results about a notion of liberal contraction based on maximizing quasi-orderings. This requires the previous solution of some open problems in the theory of rational choice functions, namely a full characterization of choice functions rationalizable in terms of maximization of quasi-transitive relations. We conclude by discussing the problem of what is the adequate feasible set for calculating maximizing solutions for contraction problems and by considering the epistemological roots of some counterexamples against the most fundamental axioms on choice functions (like α). While the first part of the paper shows how economic insights can be used to improve our understanding of the principles of belief formation and change, this final section reverses this strategy by showing the utility of epistemological insights and techniques for providing invariance conditions capable of regulating the applicability of the pure principles of choice. (shrink)

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

Until now, antirealists have offered sketches of a theory of truth, at best. In this paper, we present a probabilist account of antirealist truth in some formal detail, and we assess its ability to deal with the problems that are standardly taken to beset antirealism.

Since rationality is a normative ideal, it is difficult to see how a theory of rationality might be subjected to empirical evaluation. This paper explores various aspects of this problem in relation to the work of L. J. Cohen, Amos Tversky and Daviel Kahneman, Ellery Eells, Isaac Levi, and Henry Kyburg. Special consideration is given to its significance for testing systems of inductive logic.

In concrete applications of probability, statistical investigation gives us knowledge of some probabilities, but we generally want to know many others that are not directly revealed by our data. For instance, we may know prob(P/Q) (the probability of P given Q) and prob(P/R), but what we really want is prob(P/Q& R), and we may not have the data required to assess that directly. The probability calculus is of no help here. Given prob(P/Q) and prob(P/R), it is consistent with the probability (...) calculus for prob(P/Q& R) to have any value between 0 and 1. Is there any way to make a reasonable estimate of the value of prob(P/Q& R) 1 A related problem occurs when probability practitioners adopt undefended assumptions of statistical independence simply on the basis of not seeing any connection between two propositions. This is common practice, but its justification has eluded probability theorists, and researchers are typically apologetic about making such assumptions. Is there any way to defend the practice? This paper shows that on a certain conception of probability—nomic probability—there are principles of "probable probabilities" that license inferences of the above sort. These are principles telling us that although certain inferences from probabilities to probabilities are not deductively valid, nevertheless the second-order probability of their yielding correct results is 1. This makes it defeasibly reasonable to make the inferences. Thus I argue that it is defeasibly reasonable to assume statistical independence when we have no information to the contrary. And I show that there is a function Y(r, s, a) such that if prob(P/Q) = r, prob(P/R) = s, andprob(P/U) = a (where U is our background knowledge) then it is defeasibly reasonable to expect that prob(P/Q&R) = Y(r, s, a). Numerous other defeasible inferences are licensed by similar principles of probable probabilities. This has the potential to greatly enhance the usefulness of probabilities in practical application. (shrink)

As part of an exceptionally lucid analysis of the Lottery Paradox, Dana Nelkin castigates the solutions to that paradox put forward by Laurence Bonjour and Sharon Ryan. According to her, these are “so finely tailored to lottery-like cases that they are limited in their ability to explain [what seem the intuitively right responses to such cases]”. She then offers a solution to the Lottery Paradox that allegedly has the virtue of being independently motivated by our intuitions regarding certain non-lottery-like cases. (...) This note argues that Nelkin fails to show that her solution applies to other than lottery-like cases or in any event that it is more general than Bonjour’s and Ryan’s solutions. (shrink)

We will present a new lottery-style paradox on counterfactuals and chance. The upshot will be: combining natural assumptions on the truth values of ordinary counterfactuals, the conditional chances of possible but non-actual events, the manner in which and relate to each other, and a fragment of the logic of counterfactuals leads to disaster. In contrast with the usual lottery-style paradoxes, logical closure under conjunction—that is, in this case, the rule of Agglomeration of counterfactuals—will not play a role in the derivation (...) and will not be entailed by our premises either. We will sketch four obvious but problematic ways out of the dilemma, and we will end up with a new resolution strategy that is non-obvious but less problematic: contextualism about what counts as a proposition. This proposal will not just save us from the paradox, it will also save each premise in at least some context, and it will be motivated by independent considerations from measure theory and probability theory. (shrink)