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.

156 johannes hafner and paolo mancosuThe quality <strong>of</strong> a generating set is inversely proportional to the number <strong>of</strong>patterns it contains.Thus, with paucity we have the criterion needed to proceed through step3. In order to rank the bases in step 4 we need one more thing. Define theconclusion set <strong>of</strong> a set <strong>of</strong> arguments ,C(), to be the set <strong>of</strong> sentences whichoccur as conclusions <strong>of</strong> some argument in . Kitcher concludes by giving aqualitative assessment <strong>of</strong> the unifying power <strong>of</strong> a systematization . Assumingthat we can even give precise numerical values to the number <strong>of</strong> patterns in thebasisandthesize<strong>of</strong>C() then the degree <strong>of</strong> unification <strong>of</strong> a systematizationis directly proportional to the size <strong>of</strong> C() and inversely proportional to thenumber <strong>of</strong> patterns.Exemplification. In order to connect these definitions to our example, letK be the set <strong>of</strong> true sentences <strong>of</strong> calculus. Among such truths are ‘thetangent line passing through the parabola 2x 2 + 3x + 1 at point (1, 6) is(x − 1)7 = (y − 6)’ and ‘the tangent line passing through the curve x 3 atpoint (1, 1) is (x − 1)3 = (y − 1)’. Obviously we have an infinitude <strong>of</strong> suchtruths which can be unified by the argument pattern we have given. Eachinstance <strong>of</strong> the argument pattern gives rise to a derivation that is acceptablerelative to K. Let be the entire set <strong>of</strong> derivations in the calculus whichhave as conclusions all the truths mentioned above (C()). Then , i.e. thesingleton set containing our general argument pattern is a generating set for .Moreover, is complete with respect to K.6.2 How does Kitcher’s model fit concrete cases?In order to discuss the application <strong>of</strong> Kitcher’s model to concrete cases it isimportant to gain an insight into the sort <strong>of</strong> examples that Kitcher thinks hismodel can handle. The most extended discussion <strong>of</strong> such examples is given byKitcher in his book The Nature <strong>of</strong> <strong>Mathematical</strong> Knowledge (1984). In Chapter 9,‘Patterns <strong>of</strong> mathematical change’, one <strong>of</strong> the patterns discussed is ‘systematization’.This discussion is important for our goals as it is presented by Kitcher asan exemplification <strong>of</strong> the claims contained in ‘Explanatory unification’ (1981).Kitcher divides ‘systematizations’ into two major groups: systematizationsby axiomatization and systematizations by conceptualization. In the case <strong>of</strong>systematization by conceptualization he mentions the improvement obtainedby Viete’s algebra by treating systematically classes <strong>of</strong> equations <strong>of</strong> the samedegree, say, degree 3, in contrast to the case by case analysis typical <strong>of</strong>Cardan’s Ars Magna. Similarly, Lagrange—through his analysis <strong>of</strong> resolvent

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

Saved successfully!

Ooh no, something went wrong!