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.

eyond unification 155This example was fashioned in exact analogy to the one Kitcher givesfrom Newtonian mechanics. Kitcher remarks on the difference with respect topurely logical patterns:Whereas logicians are concerned to display all the schematic premises which areemployed and to specify exactly which rules <strong>of</strong> inference are used, our exampleallows for the use <strong>of</strong> premises (mathematical assumptions) which do not occur asterms <strong>of</strong> the schematic argument, and it does not give a complete description <strong>of</strong>the way in which the route from [1 and 2 to 3] istogo.(Kitcher,1981, p.517f)Having defined the notion <strong>of</strong> general argument pattern we now needto capture formally the notion <strong>of</strong> explanatory store over K, E(K), whichinformally will turn out to be ‘the set <strong>of</strong> derivations that makes the besttrade<strong>of</strong>f between minimizing the number <strong>of</strong> patterns <strong>of</strong> derivation employedand maximizing the number <strong>of</strong> conclusions generated’ (Kitcher, 1989, p.432).A set <strong>of</strong> derivations is acceptable relative to K just in case every step in thederivations is deductively valid and each premise <strong>of</strong> each derivation belongsto K.A generating set for a set <strong>of</strong> derivations is a set <strong>of</strong> argument patterns suchthat each derivation in the set instantiates some pattern in the generatingset .A generating set for is complete with respect to K if and only if everyderivation which is acceptable relative to K and which instantiates a pattern in belongs to .Informally, the determination <strong>of</strong> E(K) will proceed through the following steps:(1) Select among all possible systematizations <strong>of</strong> K only the acceptablesystematizations <strong>of</strong> K, i.e. those sets <strong>of</strong> derivations that are acceptablerelative to K.(2) To each acceptable systematization selected in (1) associate the collection<strong>of</strong> the generating sets for that systematization that are complete withrespect to K.(3) For each acceptable systematization select now a basis, where a basisis an element <strong>of</strong> the collection <strong>of</strong> the generating sets for that systematizationwhich ranks best according to the criterion <strong>of</strong> paucity <strong>of</strong>patterns.¹(4) Finally, rank all bases <strong>of</strong> the acceptable systematizations according totheir unifying power.¹ Here we leave out the criterion <strong>of</strong> stringency <strong>of</strong> patterns, since Kitcher does not provide a sufficientlyworked out account <strong>of</strong> how the criterion is supposed to figure in determining the unifying power <strong>of</strong> asystematization. Thus it is not at all clear how to apply it in our context. We will discuss this problemin more detail below.

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

Saved successfully!

Ooh no, something went wrong!