David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Philosophia Mathematica 17 (3):341-362 (2009)
In a series of papers, Don Fallis points out that although mathematicians are generally unwilling to accept merely probabilistic proofs, they do accept proofs that are incomplete, long and complicated, or partly carried out by computers. He argues that there are no epistemic grounds on which probabilistic proofs can be rejected while these other proofs are accepted. I defend the practice by presenting a property I call ‘transferability’, which probabilistic proofs lack and acceptable proofs have. I also consider what this says about the similarities between mathematics and, on the one hand natural sciences, and on the other hand philosophy
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Paul Benacerraf (1973). Mathematical Truth. Journal of Philosophy 70 (19):661-679.
D. Fallis (2000). The Reliability of Randomized Algorithms. British Journal for the Philosophy of Science 51 (2):255-271.
Don Fallis (2003). Intentional Gaps in Mathematical Proofs. Synthese 134 (1-2):45 - 69.
Don Fallis (1997). The Epistemic Status of Probabilistic Proof. Journal of Philosophy 94 (4):165-186.
Haim Gaifman (2004). Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements. Synthese 140 (1-2):97 - 119.
Citations of this work BETA
Jeffrey C. Jackson (2009). Randomized Arguments Are Transferable. Philosophia Mathematica 17 (3):363-368.
Similar books and articles
James Robert Brown (2008). Philosophy of Mathematics: A Contemporary Introduction to the World of Proofs and Pictures. Routledge.
James Robert Brown (1999). Philosophy of Mathematics: An Introduction to the World of Proofs and Pictures. Routledge.
Alasdair Urquhart (2011). The Depth of Resolution Proofs. Studia Logica 99 (1-3):349-364.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
David Sherry (2009). The Role of Diagrams in Mathematical Arguments. Foundations of Science 14 (1-2):59-74.
Edwin Coleman (2009). The Surveyability of Long Proofs. Foundations of Science 14 (1-2):27-43.
Mark McEvoy (2008). The Epistemological Status of Computer-Assisted Proofs. Philosophia Mathematica 16 (3):374-387.
John W. Dawson Jr (2006). Why Do Mathematicians Re-Prove Theorems? Philosophia Mathematica 14 (3):269-286.
Added to index2009-10-05
Total downloads39 ( #52,291 of 1,679,397 )
Recent downloads (6 months)7 ( #33,668 of 1,679,397 )
How can I increase my downloads?