13.07.2015 Views

Mancosu - Philosophy of Mathematical Practice (Oxford, 2008).pdf

Mancosu - Philosophy of Mathematical Practice (Oxford, 2008).pdf

Mancosu - Philosophy of Mathematical Practice (Oxford, 2008).pdf

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

mathematical explanation: why it matters 145‘natural setting’. Finally, note that both Cournot and Mandelbrojt take it asa matter <strong>of</strong> course that mathematical explanations exist. Of course, the abovequotes can only be the beginning <strong>of</strong> the job. What is then the relationshipbetween explanation and generalization in mathematics? Such a major questioncannot be answered in this introduction but it is important to raise it sincethis web <strong>of</strong> relations between explanation, generality, and abstraction is arecurring one in all attempts to talk about explanation. Here I propose toindicate how the problem recurs in Kitcher’s writings. Kitcher is well knownas a defender <strong>of</strong> the theory <strong>of</strong> explanation as unification. Kitcher’s first articlewhere generalization and explanation are thematized is an article on Bolzano’sphilosophy <strong>of</strong> mathematics from 1975. As part <strong>of</strong> his analysis <strong>of</strong> Bolzano,Kitcher argued against the thesis that ‘a deductive argument is explanatory ifand only if its premises are at least as general as its conclusion.’ Against thethesis he raised the following objection:In any case, the generality criterion is ill-adapted to the case <strong>of</strong> mathematics.There is a very special difficulty with derivations in arithmetic, namely thatmany pro<strong>of</strong>s use the method <strong>of</strong> mathematical induction. Suppose that I prove atheorem by induction, showing that all positive integers have property F. This isaccomplished by showinga) 1 has Fb) if all numbers less than n have F then n has F(Of course there are other versions <strong>of</strong> the method <strong>of</strong> induction). It would seemhard to deny that this is a genuine pro<strong>of</strong>. [ ... ] Further, this type <strong>of</strong> pro<strong>of</strong>does not controvert Bolzano’s claim that genuine pro<strong>of</strong>s are explanatory; wefeel that the structure <strong>of</strong> the positive integers is exhibited by showing how1 has the property F and how F is inherited by successive positive integers;and, in uncovering this structure, the pro<strong>of</strong> explains the theorem. But pro<strong>of</strong>sby induction do violate the generality criterion[ ... ] Whatever account Bolzanogives and whatever generality it achieves for arithmetic, Bolzano would surely behard put to avoid the consequence that the proposition expressed by ‘1 has F’ isless general than that expressed by ‘Every number has F’. (Kitcher, 1975, p.266)I believe that this argument is too quick and that it suffers from anunfruitful attempt to use the complexity <strong>of</strong> the logical formulas as a measure <strong>of</strong>generality. The first problem is that it is easy to reformulate the two premises<strong>of</strong> induction as a single universal sentence, thereby eliminating ‘1 has F’ as anindependent premise. Secondly, not everybody agrees that pro<strong>of</strong>s by inductionare explanatory (see <strong>Mancosu</strong> (2001, note 11)). Thus, I find Kitcher’s argumentto be neither here nor there.A related context in which Kitcher addresses the issue <strong>of</strong> generalizationis in his book TheNature<strong>of</strong><strong>Mathematical</strong>Knowledgefrom 1984. Thisisa

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!