Alexander Gebharter

In this paper I reconstruct and evaluate the validity of two versions of causal exclusion arguments within the theory of causal Bayes nets. I argue that supervenience relations formally behave like causal relations. If this is correct, then it turns out that both versions of the exclusion argument are valid when assuming the causal Markov condition and the causal minimality condition. I also investigate some consequences for the recent discussion of causal exclusion arguments in the light of an interventionist theory of causation such as Woodward's (2003) and discuss a possible objection to my causal Bayes net reconstruction.

Casini, Illari, Russo, and Williamson (2011) suggest to model mechanisms by means of recursive Bayesian networks (RBNs) and Clarke, Leuridan, and Williamson (2014) extend their modelling approach to mechanisms featuring causal feedback. One of the main selling points of the RBN approach should be that it provides answers to questions concerning manipulation and control. In this paper I demonstrate that the method to compute the effects of interventions the authors mentioned endorse leads to absurd results under the additional assumption of faithfulness, which can be expected to hold for many RBN models of mechanisms.

In this paper I argue that constitutive relevance relations in mechanisms behave like a special kind of causal relation in at least one important respect: Under suitable circumstances constitutive relevance relations produce the Markov factorization. Based on this observation one may wonder whether standard methods for causal discovery could be fruitfully applied to uncover constitutive relevance relations. This paper is intended as a first step into this new area of philosophical research. I investigate to what extent the PC algorithm, originally developed for causal search, can be used for constitutive relevance discovery. I also discuss possible objections and certain limitations of a constitutive relevance discovery procedure based on PC.