•  165
    In applying Bayes’s theorem to the history of science, Bayesians sometimes assume – often without argument – that they can safely ignore very implausible theories. This assumption is false, both in that it can seriously distort the history of science as well as the mathematics and the applicability of Bayes’s theorem. There are intuitively very plausible counter-examples. In fact, one can ignore very implausible or unknown theories only if at least one of two conditions is satisfied: (i) one is …Read more
  •  312
    Arguments for probabilism aim to undergird/motivate a synchronic probabilistic coherence norm for partial beliefs. Standard arguments for probabilism are all of the form: An agent S has a non-probabilistic partial belief function b iff (⇐⇒) S has some “bad” property B (in virtue of the fact that their p.b.f. b has a certain kind of formal property F). These arguments rest on Theorems (⇒) and Converse Theorems (⇐): b is non-Pr ⇐⇒ b has formal property F.
  •  63
    The Problem: First Pass
    with Daniel Osherson
    Intuitively, it seems that S 1 is “more random” or “less regular” than S 2. In other words, it seems more plausible (in some sense) that S 1 (as opposed to S 2) was generated by a random process ( e.g. , by tossing a fair coin eight times, and recording an H for a heads outcome and a T for a tails outcome). We will use the notation x σ 1 ą σ 2y to express the claim that xstring σ 1 is more random than string σ 2y. And, we take it to be intuitively clear that — on any plausible definition of such…Read more
  •  237
    Accuracy, Language Dependence, and Joyce’s Argument for Probabilism
    Philosophy of Science 79 (1): 167-174. 2012.
    In this article, I explain how a variant of David Miller's argument concerning the language dependence of the accuracy of predictions can be applied to Joyce's notion of the accuracy of “estimates of numerical truth-values”. This leads to a potential problem for Joyce's accuracy-dominance-based argument for the conclusion that credences should obey the probability calculus.
  •  210
    The Naive View (TNV) of Inferential Knowledge (slogan): (TNV) Inferential knowledge requires known relevant premises. One key aspect of (TNV) is “counter-closure” [9, 10].
  •  272
    Steps Toward a Computational Metaphysics
    Journal of Philosophical Logic 36 (2): 227-247. 2007.
    In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in PROVER9 (a first-order automated reasoning system which is the successor to OTTER). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in PRO…Read more
  •  140
    This talk is (mainly) about the relationship two types of epistemic norms: accuracy norms and coherence norms. A simple example that everyone will be familiar with
  •  93
    FEW 2009 Special Issue: Preface (review)
    Journal of Philosophical Logic 39 (6): 591-591. 2010.
  •  743
    To the extent that we have reasons to avoid these “bad B -properties”, these arguments provide reasons not to have an incoherent credence function b — and perhaps even reasons to have a coherent one. But, note that these two traditional arguments for probabilism involve what might be called “pragmatic” reasons (not) to be (in)coherent. In the case of the Dutch Book argument, the “bad” property is pragmatically bad (to the extent that one values money). But, it is not clear whether the DBA pinpoi…Read more
  •  151
    The philosophical significance of Stein’s paradox
    European Journal for Philosophy of Science 7 (3): 411-433. 2017.
    Charles Stein discovered a paradox in 1955 that many statisticians think is of fundamental importance. Here we explore its philosophical implications. We outline the nature of Stein’s result and of subsequent work on shrinkage estimators; then we describe how these results are related to Bayesianism and to model selection criteria like AIC. We also discuss their bearing on scientific realism and instrumentalism. We argue that results concerning shrinkage estimators underwrite a surprising form o…Read more
  •  130
    Certain distributivity results for Lukasiewicz’s infinite-valued logic Lℵ0..
  •  121
    3 Contrastive Bayesiansim
    In Martijn Blaauw (ed.), Contrastivism in philosophy, Routledge/taylor & Francis Group. pp. 39--64. 2013.
  •  298
    Pollock on probability in epistemology (review)
    Philosophical Studies 148 (3). 2010.
    In Thinking and Acting John Pollock offers some criticisms of Bayesian epistemology, and he defends an alternative understanding of the role of probability in epistemology. Here, I defend the Bayesian against some of Pollock's criticisms, and I discuss a potential problem for Pollock's alternative account
  •  218
    The Strongest Possible Lewisian Triviality Result
    Thought: A Journal of Philosophy 4 (2): 69-74. 2015.
    The strongest possible Lewisian triviality result for the indicative conditional is proven
  •  71
    A Rejoinder to Strevens
    with Andrew Waterman
    By and large, we think Strevens’s [6] is a useful reply to our original critique [2] of his paper on the Quine–Duhem (QD) problem [5]. But, we remain unsatisfied with several aspects of his reply (and his original paper). Ultimately, we do not think he properly addresses our most important worries. In this brief rejoinder, we explain our remaining worries, and we issue a revised challenge for Strevens’s approach to QD.
  •  176
    Let L be a sentential (object) language containing atoms ‘A’, ‘B’, . . . , and two logical connectives ‘&’ and ‘→’. In addition to these two logical connectives, L will also contain another binary connective ‘ ’, which is intended to be interpreted as the English indicative. In the meta-language for L , we will have two meta-linguistic operations: ‘ ’ and ‘ ’. ‘ ’ is a binary relation between individual sentences in L . It will be interpreted as “single premise entailment” (or “single premise de…Read more
  •  65
    • Two competing explanations (independence of S i favors R over CB): (CB) there is a coherence bias in a’s S -formation process.
  •  530
    Accuracy, Coherence and Evidence
    Oxford Studies in Epistemology 5 61-96. 2015.
    Taking Joyce’s (1998; 2009) recent argument(s) for probabilism as our point of departure, we propose a new way of grounding formal, synchronic, epistemic coherence requirements for (opinionated) full belief. Our approach yields principled alternatives to deductive consistency, sheds new light on the preface and lottery paradoxes, and reveals novel conceptual connections between alethic and evidential epistemic norms
  •  59
    Harman [8] would concede that (1)–(3) are inconsistent, and (as a result) that something is wrong with premises (1)–(3). But, he would reject the relevantists’ diagnosis that (1) must be rejected. I take it he’d say it’s (2) that is to blame here. (2) is a bridge principle [12] linking entailment and inference. (2) is correct only for consistent B’s. [Even if B is consistent, the correct response may rather be to reject some Bi’s in B.].
  •  87
    • Several recent Bayesian discussions make use of “approximation” – Earman on the Quantitative Old Evidence Problem – Vranas on Quantitative Approaches to the Ravens Paradox – Dorling’s Quantitative Approach to Duhem–Quine – Strevens’s Quantitative Approach to Duhem–Quine – rThere are also examples not involving confirmation: E.g.
  •  284
    Dutch Book Arguments. B is susceptibility to sure monetary loss (in a certain betting set-up), and F is the formal role played by non-Pr b’s in the DBT and the Converse DBT. Representation Theorem Arguments. B is having preferences that violate some of Savage’s axioms (and/or being unrepresentable as an expected utility maximizer), and F is the formal role played by non-Pr b’s in the RT.
  •  125
    In Bayes or Bust? John Earman quickly dismisses a possible resolution (or avoidance) of the problem of old evidence. In this note, I argue that his dismissal is premature, and that the proposed resolution (when charitably reconstructed) is reasonable.
  •  350
    Too odd (not) to be true? A reply to Olsson
    with Luc Bovens, Stephan Hartmann, and Josh Snyder
    British Journal for the Philosophy of Science 53 (4): 539-563. 2002.
    Corroborating Testimony, Probability and Surprise’, Erik J. Olsson ascribes to L. Jonathan Cohen the claims that if two witnesses provide us with the same information, then the less probable the information is, the more confident we may be that the information is true (C), and the stronger the information is corroborated (C*). We question whether Cohen intends anything like claims (C) and (C*). Furthermore, he discusses the concurrence of witness reports within a context of independent witnesses…Read more
  •  343
    Naive deductivist accounts of confirmation have the undesirable consequence that if E confirms H, then E also confirms the conjunction H·X, for any X—even if X is completely irrelevant to E and H. Bayesian accounts of confirmation may appear to have the same problem. In a recent article in this journal Fitelson (2002) argued that existing Bayesian attempts to resolve of this problem are inadequate in several important respects. Fitelson then proposes a new‐and‐improved Bayesian account that over…Read more
  •  81
    • What’s essential to Newcomb’s problem? 1. You must choose between two particular acts: A1 = you take just the opaque box; A2 = you take both boxes, where the two states of nature are: S 1 = there’s $1M in the opaque box, S2 = there’s $0 in the opaque box.
  •  50
    Review of Richard Swinburne (ed.), Bayes's Theorem (review)
    Notre Dame Philosophical Reviews 2003 (11). 2003.
  •  135
    With the inclusion of an e ective methodology, this article answers in detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XCB = e(x e(e(e(x y) e(z y)) z)) a single axiom for the classical equivalential calculus when the rules of inference consist of detachment (modus ponens) and substitution? Where the function e represents equivalence, this calculus can be axiomatized quite naturally with the formulas (x x), e(e(x y) e(…Read more
  •  99
    This is a high quality, concise collection of articles on the foundations of probability and statistics. Its editor, Richard Swinburne, has collected five papers by contemporary leaders in the field, written a pretty thorough and even-handed introductory essay, and placed a very clean and accessible version of Reverend Thomas Bayes’s famous essay (“An Essay Towards the Solving a Problem in the Doctrine of Chances”) at the end, as an Appendix (with a brief historical introduction by the noted sta…Read more