Transferable and Fixable Proofs.
A proof ${\cal P}$ of a theorem T is transferable when it's possible for a typical expert to become convinced of T solely on the basis of their prior knowledge and the information contained in ${\cal P}$. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proo...
| Publicado en: | Episteme (Cambridge University Press) Vol. 22; no. 1; pp. 1 - 13 |
|---|---|
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Mar2025
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=186546312&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 186546312 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 17423600 EHAO jtl: Episteme (Cambridge University Press) issn: 17423600 maglogo: N pubinfo: dt: Mar2025 vid: 22 iid: 1 pid: 15979 pub: Cambridge University Press artinfo: ui: 186546312 10.1017/epi.2023.54 ppf: 1 ppct: 12 formats: tig: atl: Transferable and Fixable Proofs. aug: su: Mathematical errors Principle (Philosophy) sug: subj: Mathematical errors Principle (Philosophy) keyword: epistemology of mathematics mathematical practice mathematical proof philosophy of mathematical practice social epistemology Transferability ab: A proof ${\cal P}$ of a theorem T is transferable when it's possible for a typical expert to become convinced of T solely on the basis of their prior knowledge and the information contained in ${\cal P}$. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proof ${\cal P}$ is fixable when it's possible for other experts to correct any mistakes ${\cal 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 non-trivial 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 to only satisfy a weaker requirement I call "corrigibility." I explain why, despite appearances, the corrigibility standard is preferable to stricter alternatives. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2025 holdings: @attributes: islocal: N |
|---|