11 found
Order:
  1.  26
    Completeness for Counter-Doxa Conditionals – Using Ranking Semantics.Eric Raidl - 2019 - Review of Symbolic Logic 12 (4):861-891.
    Standard conditionals $\varphi > \psi$, by which I roughly mean variably strict conditionals à la Stalnaker and Lewis, are trivially true for impossible antecedents. This article investigates three modifications in a doxastic setting. For the neutral conditional, all impossible-antecedent conditionals are false, for the doxastic conditional they are only true if the consequent is absolutely necessary, and for the metaphysical conditional only if the consequent is ‘model-implied’ by the antecedent. I motivate these conditionals logically, and also doxastically by properties of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  45
    Open-Minded Orthodox Bayesianism by Epsilon-Conditionalization.Eric Raidl - 2020 - British Journal for the Philosophy of Science 71 (1):139-176.
    Orthodox Bayesianism endorses revising by conditionalization. This paper investigates the zero-raising problem, or equivalently the certainty-dropping problem of orthodox Bayesianism: previously neglected possibilities remain neglected, although the new evidence might suggest otherwise. Yet, one may want to model open-minded agents, that is, agents capable of raising previously neglected possibilities. Different reasons can be given for open-mindedness, one of which is fallibilism. The paper proposes a family of open-minded propositional revisions depending on a parameter ϵ. The basic idea is this: first (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  42
    Bridging Ranking Theory and the Stability Theory of Belief.Eric Raidl & Niels Skovgaard-Olsen - 2017 - Journal of Philosophical Logic 46 (6):577-609.
    In this paper we compare Leitgeb’s stability theory of belief and Spohn’s ranking-theoretic account of belief. We discuss the two theories as solutions to the lottery paradox. To compare the two theories, we introduce a novel translation between ranking functions and probability functions. We draw some crucial consequences from this translation, in particular a new probabilistic belief notion. Based on this, we explore the logical relation between the two belief theories, showing that models of Leitgeb’s theory correspond to certain models (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  6
    Definable Conditionals.Eric Raidl - 2021 - Topoi 40 (1):87-105.
    The variably strict analysis of conditionals does not only largely dominate the philosophical literature, since its invention by Stalnaker and Lewis, it also found its way into linguistics and psychology. Yet, the shortcomings of Lewis–Stalnaker’s account initiated a plethora of modifications, such as non-vacuist conditionals, presuppositional indicatives, perfect conditionals, or other conditional constructions, for example: reason relations, difference-making conditionals, counterfactual dependency, or probabilistic relevance. Many of these new connectives can be treated as strengthened or weakened conditionals. They are definable conditionals. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  14
    An Accuracy Argument in Favor of Ranking Theory.Eric Raidl & Wolfgang Spohn - 2020 - Journal of Philosophical Logic 49 (2):283-313.
    Fitelson and McCarthy have proposed an accuracy measure for confidence orders which favors probability measures and Dempster-Shafer belief functions as accounts of degrees of belief and excludes ranking functions. Their accuracy measure only penalizes mistakes in confidence comparisons. We propose an alternative accuracy measure that also rewards correct confidence comparisons. Thus we conform to both of William James’ maxims: “Believe truth! Shun error!” We combine the two maxims, penalties and rewards, into one criterion that we call prioritized accuracy optimization. That (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. Cheating at Coin Tossing.Eric Raidl - unknown
    Arguments for A "fair" coin has probability 1/2. There is no physical probability attached to the coin, we can cheat on each toss (by sufficient control). My aim: The coin toss is fine-grained deterministic, but coarsgrained random.
    Translate
     
     
    Export citation  
     
    Bookmark  
  7.  11
    Epistemic-State Parallelism: Translating Between Probabilities and Ranks.Eric Raidl - 2021 - Erkenntnis 86 (1):209-236.
    This paper contributes to the investigation of the nature of the relation between probability theory and ranking theory. The paper aims at explaining the structural harmony between the laws of probability theory and those of ranking theory in a way that respects the foundational dualistic attitude developed by Spohn in The Laws of Belief. The paper argues that the so called atomic translation family satisfies the desiderata and does so in the ‘best’ possible way. On the one hand, the atomic (...)
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8.  17
    Lewis’ Triviality for Quasi Probabilities.Eric Raidl - 2019 - Journal of Logic, Language and Information 28 (4):515-549.
    According to Stalnaker’s Thesis, the probability of a conditional is the conditional probability. Under some mild conditions, the thesis trivialises probabilities and conditionals, as initially shown by David Lewis. This article asks the following question: does still lead to triviality, if the probability function in is replaced by a probability-like function? The article considers plausibility functions, in the sense of Friedman and Halpern, which additionally mimic probabilistic additivity and conditionalisation. These quasi probabilities comprise Friedman–Halpern’s conditional plausibility spaces, as well as (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  9.  17
    Quick Completeness for the Evidential Conditional.Eric Raidl - unknown
    Proves Completeness for the Evidential Conditional.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  20
    The Logic of the Evidential Conditional.Eric Raidl, Andrea Iacona & Vincenzo Crupi - forthcoming - Review of Symbolic Logic:1-13.
    In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  10
    Updating a Progic.Eric Raidl - 2016 - Journal of Applied Logic 14:65-94.