Transferable and Fixable Proofs

Episteme:1-12 (forthcoming)
  Copy   BIBTEX

Abstract

A proof P of a theorem T is transferable when a typical expert can become convinced of T solely on the basis of their prior knowledge and the information contained in P. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proof P is fixable when it’s possible for other experts to correct any mistakes P contains without having to develop significant new mathematics. Habgood-Coote and Tanswell have observed that some acceptable proofs are both fixable and in need of fixing, in the sense that they contain nontrivial mistakes. The claim that acceptable proofs must be transferable seems quite plausible. The claim that some acceptable proofs need fixing seems plausible too. Unfortunately, these attractive suggestions stand in tension with one another. I argue that the transferability requirement is the problem. Acceptable proofs need only satisfy a weaker requirement I call “corrigibility”. I explain why, despite appearances, the corrigibility standard is preferable to stricter alternatives.

Similar books and articles

Probabilistic Proofs and the Collective Epistemic Goals of Mathematicians.Don Fallis - 2011 - In Hans Bernhard Schmid, Daniel Sirtes & Marcel Weber (eds.), Collective Epistemology. Heusenstamm, Germany: Ontos. pp. 157-175.
The surveyability of long proofs.Edwin Coleman - 2009 - Foundations of Science 14 (1-2):27-43.
Probabilistic proofs and transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
Comparing Mathematical Explanations.Isaac Wilhelm - 2023 - British Journal for the Philosophy of Science 74 (1):269-290.

Analytics

Added to PP
2022-10-27

Downloads
228 (#83,407)

6 months
117 (#28,169)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William D'Alessandro
University of Oxford

Citations of this work

No citations found.

Add more citations