Probabilistic Puzzles, Misc

The gambler’s fallacy is the tendency to expect random processes to switch more often than they actually do—for example, to think that after a string of tails, a heads is more likely. It’s often taken to be evidence for irrationality. It isn’t. Rather, it’s to be expected from a group of Bayesians who begin with causal uncertainty, and then observe unbiased data from an (in fact) statistically independent process. Although they converge toward the truth, they do so in an asymmetric (...) way—ruling out “streaky” hypotheses more quickly than “switchy” ones. As a result, the majority (and the average) exhibit the gambler’s fallacy. If they have limited memory, this tendency persists even with arbitrarily-large amounts of data. Indeed, such Bayesians exhibit a variety of the empirical trends found in studies of the gambler’s fallacy: they expect switches after short streaks but continuations after long ones; these nonlinear expectations vary with their familiarity with the causal system; their predictions depend on the sequence they’ve just seen; they produce sequences that are too switchy; and they exhibit greater rates of gambler’s reasoning when forming binary predictions than when forming probability estimates. In short: what’s been thought to be evidence for irrationality may instead be rational responses to limited data and memory. (shrink)

This article concerns the psychology of the paradoxical Two Envelope Problem. The goal is to find instructive variants of the envelope switching problem that are capable of clear-cut resolution, while still retaining paradoxical features. By relocating the original problem into different contexts involving commutes and playing cards the reader is presented with a succession of resolved paradoxes that reduce the confusion arising from the parent paradox. The goal is to reduce confusion by understanding how we sometimes misread mathematical statements; or, (...) to completely avoid confusion, either by reforming language, or adopting an unambiguous notation for switching problems. This article also suggests that an illusion close in character to the figure/ground illusion hampers our understanding of switching problems in general and helps account for the intense confusion that switching problems sometimes generate. (shrink)

Several treatments of the Shooting Room Paradox have failed to recognize the crucial role played by its involving a number of players unbounded in expectation. We indicate Reflection violations and/or Dutch Book vulnerabilities in extant ``solutions''and show that the paradox does not arise when the expected number of participants is finite; the Shooting Room thus takes its place in the growing list of puzzles that have been shown to require infinite expectation. Recognizing this fact, we conclude that prospects for a (...) ``straight solution" are dim. (shrink)

I defend the thesis that legal standards of proof are reducible to thresholds of probability. Many have rejected this thesis because it seems to entail that defendants can be found liable solely on the basis of statistical evidence. I argue that this inference is invalid. I do so by developing a view, called Legal Causalism, that combines Thomson's (1986) causal analysis of evidence with recent work in formal theories of causal inference. On this view, legal standards of proof can be (...) reduced to probabilities, but deriving these probabilities involves more than just statistics. (shrink)

In a recent paper, Yoaav Isaacs, Alan Hájek, and John Hawthorne argue for the rational permissibility of "credal imprecision" by appealing to certain propositions associated with non-measurable spatial regions: for example, the proposition that the pointer of a spinner will come to rest within a certain non-measurable set of points on its circumference. This paper rebuts their argument by showing that its premises lead to implausible consequences in cases where one is trying to learn, by making multiple observations, whether a (...) certain outcome is associated with a non-measurable region or a measurable one. (shrink)

Brock and Glasgow recently introduced a new definition of paradox and argue that this conception of paradox itself leads to paradox, the so-called Paradox Paradox. I show that they beg the questions during the course of their argument, but, more importantly, do so in a philosophically interesting way: it reveals a counterexample to the equivalence between being a logical truth and having a probability of one. This has consequences regarding norms of rationality, undermining the grounds for the Conjunction Fallacy.

This insight to art came from chess composition concentrating art in a very dense form. To identify and mathematically assess the uniqueness is the key applicable to other areas eg. computer programming. Maximization of uniqueness is minimization of entropy that coincides as well as goes beyond Information Theory (Shannon, 1948). The reusage of logic as a universal principle to minimize entropy, requires simplified architecture and abstraction. Any structures (e.g. plugins) duplicating or dividing functionality increase entropy and so unreliability (eg. British (...) Airways IT system). The ideas here were verified by my chess compositions, art works and complex information system as an author of each co uk, and were presented at conferences in Santorini, Adelaide, Geneva, Daejon and virtually. (shrink)

David Builes presents a paradox concerning how confident you should be that any given member of an infinite collection of fair coins landed heads, conditional on the information that they were all flipped and only finitely many of them landed heads. We argue that if you should have any conditional credence at all, it should be 1/2.

I present a puzzle about the epistemic role beliefs about experts' beliefs play in a rational agent's system of beliefs. It is shown that accepting the claim that an expert's degree of belief in a proposition, A, screens off the evidential support another proposition, B, gives to A in case the expert knows and is certain about whether B is true, leads in some cases to highly unintuitive conclusions. I suggest a solution to the puzzle according to which evidential screening (...) off is rejected, but show that the price of this solution is either giving up on the mere idea of deferring to expert's opinion or giving up on Bayesian conditionalization. (shrink)

I present in this note an alternative answer to the princesses' earring problem, found in the first chapter of Cezar Augusto Mortari's book "Introdução à Lógica”.

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)

The lesson to be learned from the paradoxical St. Petersburg game and Pascal’s Mugging is that there are situations where expected utility maximizers will needlessly end up poor and on death’s door, and hence we should not be expected utility maximizers. Instead, when it comes to decision-making, for possibilities that have very small probabilities of occurring, we should discount those probabilities down to zero, regardless of the utilities associated with those possibilities.

This doctoral dissertation investigates what influence indicative conditionals have on belief updating and how learning from conditionals may be modelled in a probabilistic framework. Because the problem is related to the interpretation of conditionals, we first assess different semantics of indicative conditionals. We propose that conditionals should be taken as primary concepts. This allows us to defend a claim that learning a conditional is equivalent to learning that the relevant conditional probability is 1. This implies that learning a conditional can (...) be modelled as learning a material conditional. We then turn to a few competing approaches to the problem of learning from a conditional -- an approach that models these situations with regards to changes in the explanatory status of the antecedent, as minimising probability distances between the prior and posterior probability distributions, and, particularly, an approach based on epistemic entrenchment. It is argued that although all approaches are important for their pioneering contributions, none of them ultimately provides a fully satisfactory solution. We then formulate a proposal according to which learning a conditional may be modelled as learning a material conditional in conjunction with other contextually inferred or observed information. We show that the view has an intuitive appeal on the grounds of pragmatics and empirical research in psychology of reasoning. We also show that the proposed approach successfully resolves all standard cases from the literature. The proposal is then extended to left-nested conditionals. To do so, we first inspect some preliminary empirical data about actual reasoning with nested conditionals and then show that the proposed approach also successfully models these cases. We then investigate how the approach may be extended to the so-called imperative conditionals. We introduce a tripartite typology of imperative conditionals and argue that although imperatives cannot be probabilistically modelled in any straight-forward way, at least some general insights of the proposed method help us understand the influence that the three different types of imperative conditionals have on listeners’ beliefs. We conclude with a summary and some open questions that should be addressed in future work (e.g. the influence of counterfactuals on belief updating). (shrink)

English abstract: This paper discusses the delicate relationship between traditional epistemology and the increasingly influential probabilistic (or ‘Bayesian’) approach to epistemology. The paper introduces some of the key ideas of probabilistic epistemology, including credences or degrees of belief, Bayes’ theorem, conditionalization, and the Dutch Book argument. The tension between traditional and probabilistic epistemology is brought out by considering the lottery and preface paradoxes as they relate to rational (binary) belief and credence respectively. It is then argued that this tension can (...) be alleviated by rejecting the requirement that rational (binary) beliefs must be consistent and closed under logical entailment. Instead, it is suggested that this logical requirement applies to a different type of binary propositional attitude, viz. acceptance. (shrink)

Hempel’s Converse Consequence Condition (CCC), Entailment Condition (EC), and Special Consequence Condition (SCC) have some prima facie plausibility when taken individually. Hempel, though, shows that they have no plausibility when taken together, for together they entail that E confirms H for any propositions E and H. This is “Hempel’s paradox”. It turns out that Hempel’s argument would fail if one or more of CCC, EC, and SCC were modified in terms of explanation. This opens up the possibility that Hempel’s paradox (...) can be solved by modifying one or more of CCC, EC, and SCC in terms of explanation. I explore this possibility by modifying CCC and SCC in terms of explanation and considering whether CCC and SCC so modified are correct. I also relate that possibility to Inference to the Best Explanation. (shrink)

The present article illustrates a conflict between the claim that rational belief sets are closed under deductive consequences, and a very inclusive claim about the factors that are sufficient to determine whether it is rational to believe respective propositions. Inasmuch as it is implausible to hold that the factors listed here are insufficient to determine whether it is rational to believe respective propositions, we have good reason to deny that rational belief sets are closed under deductive consequences.

ABSTRACTMany discussions of the ‘preface paradox’ assume that it is more troubling for deductive closure constraints on rational belief if outright belief is reducible to credence. I show that this is an error: we can generate the problem without assuming such reducibility. All that we need are some very weak normative assumptions about rational relationships between belief and credence. The only view that escapes my way of formulating the problem for the deductive closure constraint is in fact itself a reductive (...) view: namely, the view that outright belief is credence 1. However, I argue that this view is unsustainable. Moreover, my version of the problem turns on no particular theory of evidence or evidential probability, and so cannot be avoided by adopting some revisionary such theory. In sum, deductive closure is in more serious, and more general, trouble than some have thought. (shrink)

There are three questions associated with Simpson’s Paradox (SP): (i) Why is SP paradoxical? (ii) What conditions generate SP?, and (iii) What should be done about SP? By developing a logic-based account of SP, it is argued that (i) and (ii) must be divorced from (iii). This account shows that (i) and (ii) have nothing to do with causality, which plays a role only in addressing (iii). A counterexample is also presented against the causal account. Finally, the causal and logic-based (...) approaches are compared by means of an experiment to show that SP is not basically causal. (shrink)

Gordon Belot has recently developed a novel argument against Bayesianism. He shows that there is an interesting class of problems that, intuitively, no rational belief forming method is likely to get right. But a Bayesian agent’s credence, before the problem starts, that she will get the problem right has to be 1. This is an implausible kind of immodesty on the part of Bayesians. My aim is to show that while this is a good argument against traditional, precise Bayesians, the (...) argument doesn’t neatly extend to imprecise Bayesians. As such, Belot’s argument is a reason to prefer imprecise Bayesianism to precise Bayesianism. (shrink)

One thousand fair causally isolated coins will be independently flipped tomorrow morning and you know this fact. I argue that the probability, conditional on your knowledge, that any coin will land tails is almost 1 if that coin in fact lands tails, and almost 0 if it in fact lands heads. I also show that the coin flips are not probabilistically independent given your knowledge. These results are uncomfortable for those, like Timothy Williamson, who take these probabilities to play a (...) central role in their theorizing. (shrink)

Kroedel has proposed a new solution, the permissibility solution, to the lottery paradox. The lottery paradox results from the Lockean thesis according to which one ought to believe a proposition just in case one’s degree of belief in it is sufficiently high. The permissibility solution replaces the Lockean thesis by the permissibility thesis according to which one is permitted to believe a proposition if one’s degree of belief in it is sufficiently high. This note shows that the epistemology of belief (...) that results from the permissibility thesis and the epistemology of degrees of belief is empty in the sense that one need not believe anything, even if one’s degrees of belief are maximally bold. Since this result can also be achieved by simply dropping the Lockean thesis, or by replacing it with principles that are logically stronger than the permissibility thesis, the question arises what the permissibility solution is a solution of. (shrink)

The paper starts by describing and clarifying what Williamson calls the consequence fallacy. I show two ways in which one might commit the fallacy. The first, which is rather trivial, involves overlooking background information; the second way, which is the more philosophically interesting, involves overlooking prior probabilities. In the following section, I describe a powerful form of sceptical argument, which is the main topic of the paper, elaborating on previous work by Huemer. The argument attempts to show the impossibility of (...) defeasible justification, justification based on evidence which does not entail the (allegedly) justified proposition or belief. I then discuss the relation between the consequence fallacy, or some similar enough reasoning, and that form of argument. I argue that one can resist that form of sceptical argument if one gives up the idea that a belief cannot be justified unless it is supported by the totality of the evidence available to the subject—a principle entailed by many prominent epistemological views, most clearly by epistemological evidentialism. The justification, in the relevant cases, should instead derive solely from the prior probability of the proposition. A justification of this sort, that does not rely on evidence, would amount to a form of entitlement, in (something like) Crispin Wright’s sense. I conclude with some discussion of how to understand prior probabilities, and how to develop the notion of entitlement in an externalist epistemological framework. (shrink)

We argue that giving up on the closure of rational belief under conjunction comes with a substantial price. Either rational belief is closed under conjunction, or else the epistemology of belief has a serious diachronic deficit over and above the synchronic failures of conjunctive closure. The argument for this, which can be viewed as a sequel to the preface paradox, is called the ‘review paradox'; it is presented in four distinct, but closely related versions.

The Doomsday Argument and the Simulation Argument share certain structural features, and hence are often discussed together. Both are cases where reflecting on one’s location among a set of possibilities yields a counter-intuitive conclusion—in the first case that the end of humankind is closer than you initially thought, and in the second case that it is more likely than you initially thought that you are living in a computer simulation. Indeed, the two arguments do have some structural similarities. But there (...) are also significant disanalogies between the two arguments, and I argue that these disanalogies mean that the Simulation Argument succeeds and the Doomsday Argument fails. (shrink)

A popular way to relate probabilistic information to binary rational beliefs is the Lockean Thesis, which is usually formalized in terms of thresholds. This approach seems far from satisfactory: the value of the thresholds is not well-specified and the Lottery Paradox shows that the model violates the Conjunction Principle. We argue that the Lottery Paradox is a symptom of a more fundamental and general problem, shared by all threshold-models that attempt to put an exact border on something that is intrinsically (...) vague. 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’ and satisfies a moderately weakened form of the Conjunction Principle. We also propose an adaptation of the model that is able to deal with beliefs that are less firm than ‘almost certainty’. The adapted version is also of interest for the epistemicist account of vagueness. (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.

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

The thesis that high probability suffices for rational belief, while initially plausible, is known to face the Lottery Paradox. The present paper proposes an amended version of that thesis which escapes the Lottery Paradox. The amendment is argued to be plausible on independent grounds.

The so-called Paradox of Serious Possibility is usually regarded as showing that the standard axioms of belief revision do not apply to belief sets that are introspectively closed. In this article we argue to the contrary: we suggest a way of dissolving the Paradox of Serious Possibility so that introspective statements are taken to express propositions in the standard sense, which may thus be proper members of belief sets, and accordingly the normal axioms of belief revision apply to them. Instead (...) the paradox is avoided by making explicit, for any occurrence of an introspective modality in the object language, the belief state to which this occurrence refers; this will make it impossible for any doxastic modality to refer to two distinct belief sets within one and the same context of doxastic appraisal. By this move the standard derivation of a contradiction from the theory of belief revision in the presence of introspectively closed belief sets does not go through any more, and indeed the premisses of the Paradox of Serious Possibility become jointly consistent once they are reformulated with our amended introspective modalities only. Additionally, we present a probabilistic version of the Paradox of Serious Possibility which can be avoided in a perfectly analogous manner. (shrink)

We argue that indeterminate probabilities are not only rationally permissible for a Bayesian agent, but they may even be rationally required . Our first argument begins by assuming a version of interpretivism: your mental state is the set of probability and utility functions that rationalize your behavioral dispositions as well as possible. This set may consist of multiple probability functions. Then according to interpretivism, this makes it the case that your credal state is indeterminate. Our second argument begins with our (...) describing a world that plausibly has indeterminate chances. Rationality requires a certain alignment of your credences with corresponding hypotheses about the chances. Thus, if you hypothesize the chances to be indeterminate, your will inherit their indeterminacy in your corresponding credences. Our third argument is motivated by a dilemma. Epistemic rationality requires you to stay open-minded about contingent matters about which your evidence has not definitively legislated. Practical rationality requires you to be able to act decisively at least sometimes. These requirements can conflict with each other-for thanks to your open-mindedness, some of your options may have undefined expected utility, and if you are choosing among them, decision theory has no advice to give you. Such an option is playing Nover and Hájek’s Pasadena Game , and indeed any option for which there is a positive probability of playing the Pasadena Game. You can serve both masters, epistemic rationality and practical rationality, with an indeterminate credence to the prospect of playing the Pasadena game. You serve epistemic rationality by making your upper probability positive-it ensures that you are open-minded. You serve practical rationality by making your lower probability 0-it provides guidance to your decision-making. No sharp credence could do both. (shrink)

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

This paper concerns the extent to which uncertain propositional reasoning can track probabilistic reasoning, and addresses kinematic problems that extend the familiar Lottery paradox. An acceptance rule assigns to each Bayesian credal state p a propositional belief revision method B p , which specifies an initial belief state B p (T) that is revised to the new propositional belief state B(E) upon receipt of information E. An acceptance rule tracks Bayesian conditioning when B p (E) = B p|E (T), for (...) every E such that p(E) > 0; namely, when acceptance by propositional belief revision equals Bayesian conditioning followed by acceptance. Standard proposals for uncertain acceptance and belief revision do not track Bayesian conditioning. The "Lockean" rule that accepts propositions above a probability threshold is subject to the familiar lottery paradox (Kyburg 1961), and we show that it is also subject to new and more stubborn paradoxes when the tracking property is taken into account. Moreover, we show that the familiar AGM approach to belief revision (Harper, Synthese 30(1-2):221-262, 1975; Alchourrón et al., J Symb Log 50:510-530, 1985) cannot be realized in a sensible way by any uncertain acceptance rule that tracks Bayesian conditioning. Finally, we present a plausible, alternative approach that tracks Bayesian conditioning and avoids all of the paradoxes. It combines an odds-based acceptance rule proposed originally by Levi (1996) with a non-AGM belief revision method proposed originally by Shoham (1987). (shrink)

We reflect on lessons that the lottery and preface paradoxes provide for the logic of uncertain inference. One of these lessons is the unreliability of the rule of conjunction of conclusions in such contexts, whether the inferences are probabilistic or qualitative; this leads us to an examination of consequence relations without that rule, the study of other rules that may nevertheless be satisfied in its absence, and a partial rehabilitation of conjunction as a ‘lossy’ rule. A second lesson is the (...) possibility of rational inconsistent belief; this leads us to formulate criteria for deciding when an inconsistent set of beliefs may reasonably be retained. (shrink)

One of the problems that Bayesian regularity, the thesis that all contingent propositions should be given probabilities strictly between zero and one, faces is the possibility of random processes that randomly and uniformly choose a number between zero and one. According to classical probability theory, the probability that such a process picks a particular number in the range is zero, but of course any number in the range can indeed be picked. There is a solution to this particular problem on (...) the books: a measure that assigns the same infinitesimal probability to each number between zero and one. I will show that such a measure, while mathematically interesting, is pathological for use in confirmation theory, for the same reason that a measure that assigns an infinitesimal probability to each possible outcome in a countably infinite lottery is pathological. The pathology is that one can force someone to assign a probability within an infinitesimal of one to an unlikely event. (shrink)

Suppose you think that whether you believe some proposition A at some future time t might have a causal influence on whether A is true. For instance, maybe you think a woman can read your mind, and either (1) you think she will snap her fingers shortly after t if and only if you believe at t that she will, or (2) you think she will snap her fingers shortly after t if and only if you don't believe at t (...) that she will. Let A be the proposition that she snaps her fingers shortly after t. In case (1), theoretical rationality seems to leave it open whether you should believe A or not. Perhaps, for all it has to say, you could just directly choose whether to believe A. David Velleman seems to be committed to something close to that, but his view has been unpopular. In case (2), you seem to be in a theoretical dilemma, a situation where any attitude you adopt toward A will be self-undermining in a way that makes you irrational. Such theoretical dilemmas ought to be impossible, just as genuine moral dilemmas ought to be impossible, but it is surprisingly hard to show that they are (perhaps because they aren't). I study cases analogous to (1) and (2) in a probabilistic framework where degrees of belief rather than all-or-nothing beliefs are taken as basic. My principal conclusions are that Velleman's view is closer to the truth than it is generally thought to be, that case (2) type theoretical dilemmas only arise for hyperidealised agents unlike ourselves, and that there are related cases that can arise for agents like us that are very disturbing but might not quite amount to theoretical dilemmas. (shrink)

I argue that the standard way of formalizing the fine-tuning argument for design is flawed, and I present an alternative formalization. On the alternative formalization, the existence of life is not treated as the evidence that confirms design; instead it is treated as part of the background knowledge, while the fact that fine tuning is required for life serves as the evidence. I argue that the alternative better captures the informal line of thought that gives the fine-tuning argument its intuitive (...) plausibility, and I show that the alternative formalization avoids all of the most prominent objections to the fine-tuning argument, including the objection from observation selection effects, the problem of old evidence, the problem of non-normalizable probability measures and a further objection due to Monton. I conclude that the alternative formalization is the one that attention should be focused on. (shrink)

In this paper, I propose that one can have reason to choose a few tickets in a very large lottery and arbitrarily believe of them that they will lose. Such a view fits nicely within portions of Lehrer's theory of rational acceptance. Nonetheless, the reasonability of believing a lottery ticket will lose should not be taken to constitute the kind of justification required in an analysis of knowledge. Moreover, one should not accept what one takes to have a low chance (...) of being true. Accordingly, one should take care not to believe of too many tickets that they are to lose. Finally, while arbitrariness is no absolute barrier to epistemic reasonability, one may not be able to believe that one's lottery ticket will lose if one cannot regard oneself as knowing it will lose. (shrink)

The article begins by describing two longstanding problems associated with direct inference. One problem concerns the role of uninformative frequency statements in inferring probabilities by direct inference. A second problem concerns the role of frequency statements with gerrymandered reference classes. I show that past approaches to the problem associated with uninformative frequency statements yield the wrong conclusions in some cases. I propose a modification of Kyburg’s approach to the problem that yields the right conclusions. Past theories of direct inference have (...) postponed treatment of the problem associated with gerrymandered reference classes by appealing to an unexplicated notion of projectability . I address the lacuna in past theories by introducing criteria for being a relevant statistic . The prescription that only relevant statistics play a role in direct inference corresponds to the sort of projectability constraints envisioned by past theories. (shrink)

Why-questions and how-possibly-questions are two common forms of explanation request. Answers to the former ones require factual assertions, but the latter ones can be answered by displaying a representation of the targeted phenomenon. However, in an extreme case, a representation could come accompanied by the assertion that it displays the only possible way a phenomenon could develop. Using several historical controversies concerning statistical modeling, it is argued that such cases must inevitably involve tacit or explicit empirical assumptions.

I argue that the rationale behind the fine-tuning argument for design is self-undermining, refuting the argument’s own premise that fine-tuning is to be expected given design. In (Weisberg 2010) I argued on informal grounds that this premise is unsupported. White (2011) countered that it can be derived from three plausible assumptions. But White’s third assumption is based on a fallacious rationale, and is even objectionable by the design theorist’s own lights. The argument that shows this, the argument from divine indifference, (...) simultaneously exposes the fine-tuning argument’s self-undermining character. The same argument also answers Bradley’s (forthcoming) reply to my earlier objection. (shrink)

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. We solve the 'adding problems' that occur in these two contexts using a similar strategy, based on non-standard analysis.

It is argued that, although in the Many-Worlds Interpretation of quantum mechanics there is no ``probability'' for an outcome of a quantum experiment in the usual sense, we can understand why we have an illusion of probability. The explanation involves: a). A ``sleeping pill'' gedanken experiment which makes correspondence between an illegitimate question: ``What is the probability of an outcome of a quantum measurement?'' with a legitimate question: ``What is the probability that ``I'' am in the world corresponding to that (...) outcome?''; b). A gedanken experiment which splits the world into several worlds which are identical according to some symmetry condition; and c). Relativistic causality, which together with explain the Born rule of standard quantum mechanics. The Quantum Sleeping Beauty controversy and ``caring measure'' replacing probability measure are discussed. (shrink)

The Eternal Coin is a fair coin has existed forever, and will exist forever, in a region causally isolated from you. It is tossed every day. How confident should you be that the Coin lands heads today, conditional on (i) the hypothesis that it has landed Heads on every past day, or (ii) the hypothesis that it will land Heads on every future day? I argue for the extremely counterintuitive claim that the correct answer to both questions is 1.

What is the epistemological structure of situations where many small risks amount to a large one? Lottery and preface paradoxes and puzzles about quantum-mechanical blips threaten the idea that competent deduction is a way of extending our knowledge. Seemingly, everyday knowledge involves small risks, and competently deducing the conjunction of many such truths from them yields a conclusion too risky to constitute knowledge. But the dilemma between scepticism and abandoning MPC is false. In extreme cases, objectively improbable truths are known. (...) Safety is modal, not probabilistic, in structure, with closure and factiveness conditions. It is modelled using closeness of worlds. Safety is analogous to knowledge. It suggests an interpretation of possible worlds semantics for epistemic logic. To avoid logical omniscience, a relation of epistemic counterparthood between formulas is introduced. This supports a safety conception of knowledge and formalizes how extending knowledge by deduction depends on logical competence. (shrink)

Any theory of knowledge that is fallibilist—i.e., that allows for one to have knowledge that could have been false or accidentally true—faces the lottery paradox. The paradox arises from the combination of two plausible claims: first, no one can know that one’s lottery ticket will lose prior to learning that it in fact has lost, and, second, the justification one has for the belief that one’s ticket will lose is just as good as the justification one has for paradigmatic instances (...) of knowledge. In thispaper, I offer a solution to the lottery paradox that is grounded in a thorough-going acceptance of fallibilism. (shrink)

We call something a paradox if it strikes us as peculiar in a certain way, if it strikes us as something that is not simply nonsense, and yet it poses some difficulty in seeing how it could make sense. When we examine paradoxes more closely, we find that for some the peculiarity is relieved and for others it intensifies. Some are peculiar because they jar with how we expect things to go, but the jarring is to do with imprecision and (...) misunderstandings in our thought, failures to appreciate the breadth of possibility consistent with our beliefs. Other paradoxes, however, pose deep problems. Closer examination does not explain them away. Instead, they challenge the coherence of certain conceptual resources and hence challenge the significance of beliefs which deploy those resources. I shall call the former kind weak paradoxes and the latter, strong paradoxes. Whether a particular paradox is weak or strong is sometimes a matter of controversy—sometimes it has been realised that what was thought strong is in fact weak, and vice versa,— but the distinction between the two kinds is generally thought to be worth drawing. In this Cchapter, I shall cover both weak and strong probabilistic paradoxes. (shrink)

The traditional Bayesian qualitative account of evidential support (TB) takes assertions of the form 'E evidentially supports H' to affirm the existence of a two-place relation of evidential support between E and H. The analysans given for this relation is $C(H,E) =_{def} Pr(H\arrowvertE) \models Pr(H)$ . Now it is well known that when a hypothesis H entails evidence E, not only is it the case that C(H,E), but it is also the case that C(H&X,E) for any arbitrary X. There is (...) a widespread feeling that this is a problematic result for TB. Indeed, there are a number of cases in which many feel it is false to assert 'E evidentially supports H&X', despite H entailing E. This is known, by those who share that feeling, as the 'tacking problem' for Bayesian confirmation theory. After outlining a generalization of the problem, I argue that the Bayesian response has so far been unsatisfactory. I then argue the following: (i) There exists, either instead of, or in addition to, a two-place relation of confirmation, a three-place, 'contrastive' relation of confirmation, holding between an item of evidence E and two competing hypotheses H₁ and H₂. (ii) The correct analysans of the relation is a particular probabilistic inequality, abbreviated C(H₁, H₂, E). (iii) Those who take the putative counterexamples to TB discussed to indeed be counterexamples are interpreting the relevant utterances as implicitly contrastive, contrasting the relevant hypothesis H₁ with a particular competitor H₂. (iv) The probabilistic structure of these cases is such that ∼C(H₁, H₂, E). This solves my generalization of the tacking problem. I then conclude with some thoughts about the relationship between the traditional Bayesian account of evidential support and my proposed account of the three-place relation of confirmation. (shrink)