Switch to: References

Add citations

You must login to add citations.
  1. Probabilities of conditionals: Updating Adams.Ivano Ciardelli & Adrian Ommundsen - 2024 - Noûs 58 (1):26-53.
    The problem of probabilities of conditionals is one of the long-standing puzzles in philosophy of language. We defend and update Adams' solution to the puzzle: the probability of an epistemic conditional is not the probability of a proposition, but a probability under a supposition. -/- Close inspection of how a triviality result unfolds in a concrete scenario does not provide counterexamples to the view that probabilities of conditionals are conditional probabilities: instead, it supports the conclusion that probabilities of conditionals violate (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Iterated team semantics for a hierarchy of informational types.Vít Punčochář - 2022 - Annals of Pure and Applied Logic 173 (10):103156.
    Download  
     
    Export citation  
     
    Bookmark  
  • Epistemic Contradictions Do Not Threaten Classical Logic.Philipp Mayr - 2022 - Acta Analytica 37 (4):551-573.
    Epistemic contradictions are now a well-known and often discussed phenomenon among those who study epistemic modals. These contradictions are expressed by sentences like ‘It is raining and it might not be raining’ whose oddness to the common ear demands an explanation. However, it has turned out to be a rather controversial enterprise to provide such an explanation in a sufficiently precise and general manner. According to pragmatic explanations, epistemic contradictions are semantically consistent but pragmatically defective. According to semantic explanations, one (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Trivalent Conditionals: Stalnaker's Thesis and Bayesian Inference.Paul Égré, Lorenzo Rossi & Jan Sprenger - manuscript
    This paper develops a trivalent semantics for indicative conditionals and extends it to a probabilistic theory of valid inference and inductive learning with conditionals. On this account, (i) all complex conditionals can be rephrased as simple conditionals, connecting our account to Adams's theory of p-valid inference; (ii) we obtain Stalnaker's Thesis as a theorem while avoiding the well-known triviality results; (iii) we generalize Bayesian conditionalization to an updating principle for conditional sentences. The final result is a unified semantic and probabilistic (...)
    Download  
     
    Export citation  
     
    Bookmark