Counterpossibles in Science: The Case of Relative Computability

Noûs 52 (3):530-560 (2018)
Download Edit this record How to cite View on PhilPapers
I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models.
Reprint years
2016, 2017, 2018
PhilPapers/Archive ID
Revision history
First archival date: 2016-07-07
Latest version: 3 (2016-09-09)
View upload history
References found in this work BETA
Index.Yablo, Stephen

View all 87 references / Add more references

Citations of this work BETA
Williamson on Counterpossibles.Francesco, Berto; Ripley, David; Priest, Graham & French, Rohan
The Necessity of Mathematics.Yli‐Vakkuri, Juhani & Hawthorne, John

Add more citations

Added to PP index

Total views
318 ( #9,618 of 40,656 )

Recent downloads (6 months)
66 ( #7,946 of 40,656 )

How can I increase my downloads?

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