Disjunction and distality: The hard problem for purely probabilistic causal theories of mental content

Synthese:1-34 (forthcoming)
Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
ROCDAD
Upload history
Archival date: 2019-12-09
View other versions
Added to PP index
2019-12-09

Total views
113 ( #31,651 of 51,175 )

Recent downloads (6 months)
50 ( #10,958 of 51,175 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.