Switch to: Citations

Add references

You must login to add references.
  1. Probabilistic proofs and transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • What Do Mathematicians Want? Probabilistic Proofs and the Epistemic Goals of Mathematicians.Don Fallis - 2002 - Logique Et Analyse 45.
    Several philosophers have used the framework of means/ends reasoning to explain the methodological choices made by scientists and mathematicians (see, e.g., Goldman 1999, Levi 1962, Maddy 1997). In particular, they have tried to identify the epistemic objectives of scientists and mathematicians that will explain these choices. In this paper, the framework of means/ends reasoning is used to study an important methodological choice made by mathematicians. Namely, mathematicians will only use deductive proofs to establish the truth of mathematical claims. In this (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • The Reliability of Randomized Algorithms.D. Fallis - 2000 - British Journal for the Philosophy of Science 51 (2):255-271.
    Recently, certain philosophers of mathematics (Fallis [1997]; Womack and Farach [(1997]) have argued that there are no epistemic considerations that should stop mathematicians from using probabilistic methods to establish that mathematical propositions are true. However, mathematicians clearly should not use methods that are unreliable. Unfortunately, due to the fact that randomized algorithms are not really random in practice, there is reason to doubt their reliability. In this paper, I analyze the prospects for establishing that randomized algorithms are reliable. I end (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The Epistemic Status of Probabilistic Proof.Don Fallis - 1997 - Journal of Philosophy 94 (4):165-186.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Non-deductive methods in mathematics.Alan Baker - 2010 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   22 citations