The form of nominalism known as 'mathematical fictionalism' is examined and found wanting, mainly on grounds that go back to an early antinominalist work of Rudolf Carnap that has unfortunately not been paid sufficient attention by more recent writers.

I have been supposing that for the theory of reasoning, explicit belief is an all-or-nothing matter, I have assumed that, as far as principles of reasoning are concerned, one either believes something explicitly or one does not; in other words an appropriate "representation" is either in one's "memory" or not. The principles of reasoning are principles for modifying such all-or-nothing representations. This is not to deny that in some ways belief is a matter of degree. For one thing implicit belief (...) is certainly a matter of degree, since it is a matter of how easily and automatically one can infer something from what one believes explicitly. Furthermore, explicit belief is a matter of degree in the sense that one believes some things more strongly than others. Sometimes one is only somewhat inclined to believe something, sometimes one is not sure what to believe, sometimes one is inclined to disbelieve something, sometimes one is quite confident something is not so, and so forth. (shrink)

This paper addresses the actual practice of justifying definitions in mathematics. First, I introduce the main account of this issue, namely Lakatos's proof-generated definitions. Based on a case study of definitions of randomness in ergodic theory, I identify three other common ways of justifying definitions: natural-world justification, condition justification, and redundancy justification. Also, I clarify the interrelationships between the different kinds of justification. Finally, I point out how Lakatos's ideas are limited: they fail to show how various kinds of justification (...) can be found and can be reasonable, and they fail to acknowledge the interplay among the different kinds of justification. (shrink)

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. (shrink)