Switch to: References

Add citations

You must login to add citations.
  1. Should causal models always be Markovian? The case of multi-causal forks in medicine.Donald Gillies & Aidan Sudbury - 2013 - European Journal for Philosophy of Science 3 (3):275-308.
    The development of causal modelling since the 1950s has been accompanied by a number of controversies, the most striking of which concerns the Markov condition. Reichenbach's conjunctive forks did satisfy the Markov condition, while Salmon's interactive forks did not. Subsequently some experts in the field have argued that adequate causal models should always satisfy the Markov condition, while others have claimed that non-Markovian causal models are needed in some cases. This paper argues for the second position by considering the multi-causal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • How to Think about Indirect Confirmation.Brian McLoone - forthcoming - Erkenntnis:1-15.
    Suppose a theory T entails hypotheses H and $$H'$$, neither of which entails the other. A number of authors have argued that a piece of evidence E “indirectly confirms” H when E confirms either T or $$H'$$. But there has been a protracted and unsettled debate about whether indirect confirmation is a sound inference procedure. Skeptics argue that the procedure employs conditions of confirmation that jointly lead to absurdity. Proponents argue that this criticism is unfounded or that its import is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)A New Condition for Transitivity of Probabilistic Support.David Atkinson & Jeanne Peijnenburg - 2021 - Erkenntnis (1):1-13.
    As is well known, implication is transitive but probabilistic support is not. Eells and Sober, followed by Shogenji, showed that screening off is a sufficient constraint for the transitivity of probabilistic support. Moreover, this screening off condition can be weakened without sacrificing transitivity, as was demonstrated by Suppes and later by Roche. In this paper we introduce an even weaker sufficient condition for the transitivity of probabilistic support, in fact one that can be made as weak as one wishes. We (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hesse’s Condition for Transitivity of Probabilistic Support: A Friendly Reminder.Jakob Koscholke - forthcoming - Erkenntnis:1-11.
    The probabilistic support relation is known to violate transitivity. But over the years, philosophers have identified various conditions under which it does not, most notably screening-off and weak screening-off. In this short discussion note, I wish to highlight another condition that, unfortunately, is often neglected in the literature. This condition is due to Mary Hesse who recognized its transitivity-ensuring property long before other conditions entered the stage. I show that her condition is logically independent of screening-off and weak screening-off, but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)A New Condition for Transitivity of Probabilistic Support.David Atkinson & Jeanne Peijnenburg - 2023 - Erkenntnis 88 (1):253-265.
    As is well known, implication is transitive but probabilistic support is not. Eells and Sober, followed by Shogenji, showed that screening off is a sufficient constraint for the transitivity of probabilistic support. Moreover, this screening off condition can be weakened without sacrificing transitivity, as was demonstrated by Suppes and later by Roche. In this paper we introduce an even weaker sufficient condition for the transitivity of probabilistic support, in fact one that can be made as weak as one wishes. We (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Screening off generalized: Reichenbach’s legacy.David Atkinson & Jeanne Peijnenburg - 2021 - Synthese 199 (3-4):8335-8354.
    Eells and Sober proved in 1983 that screening off is a sufficient condition for the transitivity of probabilistic causality, and in 2003 Shogenji noted that the same goes for probabilistic support. We start this paper by conjecturing that Hans Reichenbach may have been aware of this fact. Then we consider the work of Suppes and Roche, who demonstrated in 1986 and 2012 respectively that screening off can be generalized, while still being sufficient for transitivity. We point out an interesting difference (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations