Counterpossibles in Science: the Case of Relative Computability*
Counterpossibles in Science: The Case of Relative Computability* MATTHIAS JENNY Massachusetts Institute of Technology forthcoming in Noˆus Abstract 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 counter- factuals, 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. *Thanks to Scott Aaronson, Karen Bennett, Matteo Bianchetti, David Boylan, Ben Burgis, Alex Byrne, Michael Detlefsen, Richard Dietz, Kevin Dorst, Nicole Dular, Hartry Field, Melvin Fitting, Juliet Floyd, Cameron Gibbs, Cosmo Grant, Geoffrey Hellman, Jared Henderson, Harold Hodes, Douglas Jesseph, Justin Khoo, Hilary Kornblith, Teresa Kouri, Rose Lenehan, Matt Mandelkern, William Nalls, Eileen Nutting, Alex Paseau, Milo Phillips-Brown, Graham Priest, Agust´ın Rayo, Bernhard Salow, Chris Scambler, Melissa Schu- macher, Kieran Setiya, Stewart Shapiro, Jeremy Shipley, Bradford Skow, Theodore Sider, Robert Stalnaker, Stephen Yablo, Elena Ziliotti, audiences at the 3rd Seoul Philosophy Graduate Student Conference, the 16th Midwest PhilMath Workshop, the 1st Massachusetts-Rhode Island Graduate Workshop in Philosophy, the 2016 Logic & Metaphysics Workshop at the CUNY Graduate Center, the 2016 CSHPM/SCHPM Annual Meeting, and especially Vann McGee for very helpful discussion.
[Show full text]