Most causal discovery algorithms in the literature exploit an assumption usually referred to as the Causal Faithfulness or Stability Condition. In this paper, we highlight two components of the condition used in constraint-based algorithms, which we call “Adjacency-Faithfulness” and “Orientation- Faithfulness.” We point out that assuming Adjacency-Faithfulness is true, it is possible to test the validity of Orientation- Faithfulness. Motivated by this observation, we explore the consequence of making only the Adjacency-Faithfulness assumption. We show that the familiar PC algorithm has (...) to be modified to be correct under the weaker, Adjacency-Faithfulness assumption. The modified algorithm, called Conservative PC (CPC), checks whether Orientation- Faithfulness holds in the orientation phase, and if not, avoids drawing certain causal conclusions the PC algorithm would draw. Howtion: ever, if the stronger, standard causal Faith-. (shrink)

The starting point in the development of probabilistic analyses of token causation has usually been the naïve intuition that, in some relevant sense, a cause raises the probability of its effect. But there are well-known examples both of non-probability-raising causation and of probability-raising non-causation. Sophisticated extant probabilistic analyses treat many such cases correctly, but only at the cost of excluding the possibilities of direct non-probability-raising causation, failures of causal transitivity, action-at-a-distance, prevention, and causation by absence and omission. I show that (...) an examination of the structure of these problem cases suggests a different treatment, one which avoids the costs of extant probabilistic analyses. (shrink)

Studies causation both as a concept and as it is 'in the objects.' Offers new accounts of the logic of singular causal statements, the form of causal regularities, the detection of causal relationships, the asymmetry of cause and effect, and necessary connection, and it relates causation to functional and statistical laws and to teleology.

Reprint of the original, first published in 1869.

Over the last two decades, a fundamental outline of a theory of causal inference has emerged. However, this theory does not consider the following problem. Sometimes two or more measured variables are deterministic functions of one another, not deliberately, but because of redundant measurements. In these cases, manipulation of an observed defined variable may actually be an ambiguous description of a manipulation of some underlying variables, although the manipulator does not know that this is the case. In this article we (...) revisit the question of precisely characterizing conditions and assumptions under which reliable inference about the effects of manipulations is possible, even when the possibility of “ambiguous manipulations” is allowed. (shrink)

For a long time, regularity accounts of causation have virtually vanished from the scene. Problems encountered within other theoretical frameworks have recently induced authors working on causation, laws of nature, or methodologies of causal reasoning – as e.g. May (Kausales Schliessen. Eine Untersuchung über kausale Erklärungen und Theorienbildung. Ph.D. thesis, Universität Hamburg, Hamburg, 1999), Ragin (Fuzzy-set social science. Chicago: University of Chicago Press, 2000), Graßhoff and May (Causal regularities. In W. Spohn, M. Ledwig, & M. Esfeld (Eds.), Current issues in (...) causation (pp. 85–114). Paderborn: Mentis, 2001), Swartz (The concept of physical law (2nd ed.). http://www.sfu.ca/philosophy/physical-law/, 2003), Halpin (Erkenntnis, 58, 137–168, 2003) – to direct their attention back to regularity theoretic analyses. In light of the latest proposals of regularity theories, the paper at hand therefore reassesses the criticism raised against regularity accounts since the INUS theory of causation of Mackie (The cement of the universe. A study of causation. Oxford: Clarendon Press, 1974). It is shown that most of these objections target strikingly over-simplified regularity theoretic sketches. By outlining ways to refute these objections it is argued that the prevalent conviction as to the overall failure of regularity theories has been hasty. (shrink)

I examine different arguments that could be used to establish indeterminism of neurological processes. Even though scenarios where single events at the molecular level make the difference in the outcome of such processes are realistic, this falls short of establishing indeterminism, because it is not clear that these molecular events are subject to quantum mechanical uncertainty. Furthermore, attempts to argue for indeterminism autonomously (i.e., independently of quantum mechanics) fail, because both deterministic and indeterministic models can account for the empirically observed (...) behavior of ion channels. (shrink)

While standard procedures of causal reasoning as procedures analyzing causal Bayesian networks are custom-built for (non-deterministic) probabilistic struc- tures, this paper introduces a Boolean procedure that uncovers deterministic causal structures. Contrary to existing Boolean methodologies, the procedure advanced here successfully analyzes structures of arbitrary complexity. It roughly involves three parts: first, deterministic dependencies are identified in the data; second, these dependencies are suitably minimalized in order to eliminate redundancies; and third, one or—in case of ambiguities—more than one causal structure is (...) assigned to the minimalized deterministic dependencies. (shrink)

Woodward's long awaited book is an attempt to construct a comprehensive account of causation explanation that applies to a wide variety of causal and explanatory claims in different areas of science and everyday life. The book engages some of the relevant literature from other disciplines, as Woodward weaves together examples, counterexamples, criticisms, defences, objections, and replies into a convincing defence of the core of his theory, which is that we can analyse causation by appeal to the notion of manipulation.