Philosophia Mathematica Advance Access originally published online on September 7, 2009
Philosophia Mathematica 2009 17(3):363-368; doi:10.1093/philmat/nkp012
| ||||||||||||||||||||||||||||||||||||||||||||||||
Randomized Arguments are Transferable
* Department of Mathematics and Computer Science, Duquesne University, Pittsburgh, Pennsylvania 15282-1754, USA. jacksonj{at}duq.edu
Easwaran has given a definition of transferability and argued that, under this definition, randomized arguments are not transferable. I show that certain aspects of his definition are not suitable for addressing the underlying question of whether or not there is an epistemic distinction between randomized and deductive arguments. Furthermore, I demonstrate that for any suitable definition, randomized arguments are in fact transferable.
I thank Kenny Easwaran and Don Fallis for their insightful comments and encouragement. I also thank a reviewer for helpful suggestions. This material is based upon work supported by the National Science Foundation under Grant No. CCF-0728939.