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 (...) between Reichenbach’s screening off and the generalized version, which we illustrate with an example about haemophilia among the descendants of Queen Victoria. Finally, we embark on a further generalization: we develop a still weaker condition, one that can be made as weak as one wishes. (shrink)

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 (...) forks, which are widespread in contemporary medicine (Section 2). A non-Markovian causal model for such forks is introduced and shown to be mathematically tractable (Sections 6, 7, and 8). The paper also gives a general discussion of the controversy about the Markov condition (Section 1), and of the related controversy about probabilistic causality (Sections 3, 4, and 5). (shrink)

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 (...) exaggerated. I will argue that no side has the story quite right, and some have the story quite wrong. Indirect confirmation, as characterized above, is unsound, and a good chunk of this paper will be concerned with showing why most extant defenses of the procedure err. On the other hand, when certain probabilistic (in)dependence relations hold between T, H, and $$H'$$, indirect confirmation can work, for reasons that trace back to Reichenbach’s principle of the common cause. I illustrate these matters with some contemporary and historical examples, with a particular focus on Kepler’s use of data about mars’s elliptical orbit to justify a claim about earth’s. (shrink)

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 (...) that, just like the two aforementioned, it entails the recently proposed very weak screening-off condition due to Jeanne Peijnenburg and David Atkinson. (shrink)

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 (...) explain that this condition has an interesting property: it shows that transitivity is retained even though the Simpson paradox reigns. We further show that by adding a certain restriction the condition can be turned into one that is both sufficient and necessary for transitivity. (shrink)