Bayesian confirmation theory is rife with confirmation measures. Zalabardo focuses on the probability difference measure, the probability ratio measure, the likelihood difference measure, and the likelihood ratio measure. He argues that the likelihood ratio measure is adequate, but each of the other three measures is not. He argues for this by setting out three adequacy conditions on confirmation measures and arguing in effect that all of them are met by the likelihood ratio measure but not by any of the other (...) three measures. Glass and McCartney, hereafter “G&M,” accept the conclusion of Zalabardo’s argument along with each of the premises in it. They nonetheless try to improve on Zalabardo’s argument by replacing his third adequacy condition with a weaker condition. They do this because of a worry to the effect that Zalabardo’s third adequacy condition runs counter to the idea behind his first adequacy condition. G&M have in mind confirmation in the sense of increase in probability: the degree to which E confirms H is a matter of the degree to which E increases H’s probability. I call this sense of confirmation “IP.” I set out four ways of precisifying IP. I call them “IP1,” “IP2,” “IP3,” and “IP4.” Each of them is based on the assumption that the degree to which E increases H’s probability is a matter of the distance between p and a certain other probability involving H. I then evaluate G&M’s argument in light of them. (shrink)

Inductive reasoning requires exploiting links between evidence and hypotheses. This can be done focusing either on the posterior probability of the hypothesis when updated on the new evidence or on the impact of the new evidence on the credibility of the hypothesis. But are these two cognitive representations equally reliable? This study investigates this question by comparing probability and impact judgments on the same experimental materials. The results indicate that impact judgments are more consistent in time and more accurate than (...) probability judgments. Impact judgments also predict the direction of errors in probability judgments. These findings suggest that human inductive reasoning relies more on estimating evidential impact than on posterior probability. (shrink)

ABSTRACT This article aims to achieve two things: to identify the conditions for transitivity in probabilistic support in various settings, and to uncover the components and structure of the mediated probabilistic relation. It is shown that when the probabilistic relation between the two propositions, x and z, is mediated by multiple layers of partitions of propositions, the impact x has on z consists of the purely indirect impact, the purely bypass impact, and the mixed impact. It is also shown that (...) although mediated confirmation as a whole is not transitive, the indirect part of mediated confirmation is transitive. _1_ Introduction _2_ The Structure of the Mediated Probabilistic Relation _3_ Transitivity and Anti-transitivity _4_ Bypass Disconfirmation _5_ Horizontal Generalization _6_ Coarse Screens _7_ Vertical Generalization _8_ Conclusion Appendix. (shrink)

We propose a coherence account of the conjunction fallacy applicable to both of its two paradigms. We compare our account with a recent proposal by Tentori et al. : 235–255, 2013) that attempts to generalize earlier confirmation accounts. Their model works better than its predecessors in some respects, but it exhibits only a shallow form of generality and is unsatisfactory in other ways as well: it is strained, complex, and untestable as it stands. Our coherence account inherits the strength of (...) the confirmation account, but in addition to being applicable to both paradigms, it is natural, simple, and readily testable. It thus constitutes the next natural step for Bayesian theorizing about the conjunction fallacy. (shrink)

This article proposes a new interpretation of mutual information. We examine three extant interpretations of MI by reduction in doubt, by reduction in uncertainty, and by divergence. We argue that the first two are inconsistent with the epistemic value of information assumed in many applications of MI: the greater is the amount of information we acquire, the better is our epistemic position, other things being equal. The third interpretation is consistent with EVI, but it is faced with the problem of (...) measure sensitivity and fails to justify the use of MI in giving definitive answers to questions of information. We propose a fourth interpretation of MI by reduction in expected inaccuracy, where inaccuracy is measured by a strictly proper monotonic scoring rule. It is shown that the answers to questions of information given by MI are definitive whenever this interpretation is appropriate, and that it is appropriate in a wide range of applications with epistemic implications. _1_ Introduction _2_ Formal Analyses of the Three Interpretations _2.1_ Reduction in doubt _2.2_ Reduction in uncertainty _2.3_ Divergence _3_ Inconsistency with Epistemic Value of Information _4_ Problem of Measure Sensitivity _5_ Reduction in Expected Inaccuracy _6_ Resolution of the Problem of Measure Sensitivity _6.1_ Alternative measures of inaccuracy _6.2_ Resolution by strict propriety _6.3_ Range of applications _7_ Global Scoring Rules _8_ Conclusion. (shrink)

This paper proposes a new interpretation of mutual information (MI). We examine three extant interpretations of MI by reduction in doubt, by reduction in uncertainty, and by divergence. We argue that the first two are inconsistent with the epistemic value of information (EVI) assumed in many applications of MI: the greater is the amount of information we acquire, the better is our epistemic position, other things being equal. The third interpretation is consistent with EVI, but it is faced with the (...) problem of measure sensitivity and fails to justify the use of MI in giving definitive answers to questions of information. We propose a fourth interpretation of MI by reduction in expected inaccuracy, where inaccuracy is measured by a strictly proper monotonic scoring rule. It is shown that the answers to questions of information given by MI are definitive whenever this interpretation is appropriate, and that it is appropriate in a wide range of applications with epistemic implications. (shrink)

Is evidential support transitive? The answer is negative when evidential support is understood as confirmation so that X evidentially supports Y if and only if p(Y | X) > p(Y). I call evidential support so understood “support” (for short) and set out three alternative ways of understanding evidential support: support-t (support plus a sufficiently high probability), support-t* (support plus a substantial degree of support), and support-tt* (support plus both a sufficiently high probability and a substantial degree of support). I also (...) set out two screening-off conditions (under which support is transitive): SOC1 and SOC2. It has already been shown that support-t is non-transitive in the general case (where it is not required that SOC1 holds and it is not required that SOC2 holds), in the special case where SOC1 holds, and in the special case where SOC2 holds. I introduce two rather weak adequacy conditions on support measures and argue that on any support measure meeting those conditions it follows that neither support-t* nor support-tt* is transitive in the general case, in the special case where SOC1 holds, or in the special case where SOC2 holds. I then relate some of the results to Douven’s evidential support theory of conditionals along with a few rival theories. (shrink)

The disjunction problem and the distality problem each presents a challenge that any theory of mental content must address. Here we consider their bearing on purely probabilistic causal theories. In addition to considering these problems separately, we consider a third challenge—that a theory must solve both. We call this “the hard problem.” We consider 8 basic ppc theories along with 240 hybrids of them, and show that some can handle the disjunction problem and some can handle the distality problem, but (...) none can handle the hard problem. This is our main result. We then discuss three possible responses to that result, and argue that though the first two fail, the third has some promise. (shrink)

The disjunction problem and the distality problem each presents a challenge that any theory of mental content must address. Here we consider their bearing on purely probabilistic causal theories. In addition to considering these problems separately, we consider a third challenge—that a theory must solve both. We call this “the hard problem.” We consider 8 basic ppc theories along with 240 hybrids of them, and show that some can handle the disjunction problem and some can handle the distality problem, but (...) none can handle the hard problem. This is our main result. We then discuss three possible responses to that result, and argue that though the first two fail, the third has some promise. (shrink)

There is a plethora of confirmation measures in the literature. Zalabardo considers four such measures: PD, PR, LD, and LR. He argues for LR and against each of PD, PR, and LD. First, he argues that PR is the better of the two probability measures. Next, he argues that LR is the better of the two likelihood measures. Finally, he argues that LR is superior to PR. I set aside LD and focus on the trio of PD, PR, and LR. (...) The question I address is whether Zalabardo succeeds in showing that LR is superior to each of PD and PR. I argue that the answer is negative. I also argue, though, that measures such as PD and PR, on one hand, and measures such as LR, on the other hand, are naturally understood as explications of distinct senses of confirmation. (shrink)

We propose a coherence account of the conjunction fallacy applicable to both of its two paradigms. We compare our account with a recent proposal by Tentori et al. : 235–255, 2013) that attempts to generalize earlier confirmation accounts. Their model works better than its predecessors in some respects, but it exhibits only a shallow form of generality and is unsatisfactory in other ways as well: it is strained, complex, and untestable as it stands. Our coherence account inherits the strength of (...) the confirmation account, but in addition to being applicable to both paradigms, it is natural, simple, and readily testable. It thus constitutes the next natural step for Bayesian theorizing about the conjunction fallacy. (shrink)

We explore the grammar of Bayesian confirmation by focusing on some likelihood principles, including the Weak Law of Likelihood. We show that none of the likelihood principles proposed so far is satisfied by all incremental measures of confirmation, and we argue that some of these measures indeed obey new, prima facie strange, antilikelihood principles. To prove this, we introduce a new measure that violates the Weak Law of Likelihood while satisfying a strong antilikelihood condition. We conclude by hinting at some (...) relevant links between the likelihood principles considered here and other properties of Bayesian confirmation recently explored in the literature. (shrink)

The current state of inductive logic is puzzling. Survey presentations are recurrently offered and a very rich and extensive handbook was entirely dedicated to the topic just a few years ago [23]. Among the contributions to this very volume, however, one finds forceful arguments to the effect that inductive logic is not needed and that the belief in its existence is itself a misguided illusion , while other distinguished observers have eventually come to see at least the label as “slightly (...) antiquated” .What seems not to have lost any of its currency is the problem which inductive logic is meant to address. Inference from limited ascertained information to uncertain hypotheses is ubiquitous in learning, prediction and discovery. The logical insight that such kind of inference is fallible m .. (shrink)

Searching for information is critical in many situations. In medicine, for instance, careful choice of a diagnostic test can help narrow down the range of plausible diseases that the patient might have. In a probabilistic framework, test selection is often modeled by assuming that people's goal is to reduce uncertainty about possible states of the world. In cognitive science, psychology, and medical decision making, Shannon entropy is the most prominent and most widely used model to formalize probabilistic uncertainty and the (...) reduction thereof. However, a variety of alternative entropy metrics (Hartley, Quadratic, Tsallis, Rényi, and more) are popular in the social and the natural sciences, computer science, and philosophy of science. Particular entropy measures have been predominant in particular research areas, and it is often an open issue whether these divergences emerge from different theoretical and practical goals or are merely due to historical accident. Cutting across disciplinary boundaries, we show that several entropy and entropy reduction measures arise as special cases in a unified formalism, the Sharma–Mittal framework. Using mathematical results, computer simulations, and analyses of published behavioral data, we discuss four key questions: How do various entropy models relate to each other? What insights can be obtained by considering diverse entropy models within a unified framework? What is the psychological plausibility of different entropy models? What new questions and insights for research on human information acquisition follow? Our work provides several new pathways for theoretical and empirical research, reconciling apparently conflicting approaches and empirical findings within a comprehensive and unified information-theoretic formalism. (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)