Skip navigation
Skip navigation

Probabilistic Proofs and Transferability

Easwaran, Kenny


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...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Philosophia Mathematica
DOI: 10.1093/philmat/nkn032


File Description SizeFormat Image
01_Easwaran_Probabilistic_Proofs_and_2009.pdf74.83 kBAdobe PDF    Request a copy
02_Easwaran_Probabilistic_Proofs_and_2009.pdf119.12 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator