Discussion: Time-Symmetric Quantum Counterfactuals

There is a trend to consider counterfactuals as invariably time-asymmetric. Recently, this trend manifested itself in the controversy about validity of counterfactual application of a time-symmetric quantum probability rule. Kastner (2003) analyzed this controversy and concluded that there are time-symmetric quantum counterfactuals which are consistent, but they turn out to be trivial. I correct Kastner's misquotation of my defense of time-symmetric quantum counterfactuals and explain their non-trivial aspects, thus contesting the claim that counterfactuals have to be time-asymmetric

Counterfactuals of Ontological Dependence

A great deal has been written about 'would' counterfactuals of causal dependence. Comparatively little has been said regarding 'would' counterfactuals of ontological dependence. The standard Lewis-Stalnaker semantics is inadequate for handling such counterfactuals. That's because some of these counterfactuals are counterpossibles, and the standard Lewis-Stalnaker semantics trivializes for counterpossibles. Fortunately, there is a straightforward extension of the Lewis-Stalnaker semantics available that handles counterpossibles: simply take Lewis's closeness relation that orders possible worlds and unleash it across impossible worlds. To apply the extended semantics, an account of the closeness relation for counterpossibles is needed. In this paper I offer a strategy for evaluating 'would' counterfactuals of ontological dependence that understands closeness between worlds in terms of the metaphysical concept of grounding

Counterfactual Causality from First Principles?

In this position paper we discuss three main shortcomings of existing approaches to counterfactual causality from the computer science perspective, and sketch lines of work to try and overcome these issues: (1) causality definitions should be driven by a set of precisely specified requirements rather than specific examples; (2) causality frameworks should support system dynamics; (3) causality analysis should have a well-understood behavior in presence of abstraction.Comment: In Proceedings CREST 2017, arXiv:1710.0277

Processes, pre-emption and further problems

In this paper I will argue that what makes our ordinary judgements about token causation true can be explicated in terms of interferences into quasi-inertial processes. These interferences and quasi-inertial processes can in turn be fully explicated in scientific terms. In this sense the account presented here is reductive. I will furthermore argue that this version of a process-theory of causation can deal with the traditional problems that process theories have to face, such as the problem of misconnection and the problem of disconnection as well as with a problem concerning the mis-classification of pre-emption cases