1. Disjunction and distality: the hard problem for purely probabilistic causal theories of mental content
- Author
-
Elliott Sober and William Roche
- Subjects
Philosophy of science ,Semantics (computer science) ,Computer science ,05 social sciences ,Probabilistic logic ,General Social Sciences ,Metaphysics ,06 humanities and the arts ,0603 philosophy, ethics and religion ,050105 experimental psychology ,Causality (physics) ,Philosophy of language ,Philosophy ,Meaning (philosophy of language) ,060302 philosophy ,0501 psychology and cognitive sciences ,Content (Freudian dream analysis) ,Mathematical economics - Abstract
The disjunction problem and the distality problem each presents a challenge that any theory of mental content must address. Here we consider their bearing on purely probabilistic causal (ppc) theories. In addition to considering these problems separately, we consider a third challenge—that a theory must solve both. We call this “the hard problem.” We consider 8 basic ppc theories along with 240 hybrids of them, and show that some can handle the disjunction problem and some can handle the distality problem, but none can handle the hard problem. This is our main result. We then discuss three possible responses to that result, and argue that though the first two fail, the third has some promise.
- Published
- 2019
- Full Text
- View/download PDF