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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

the euclidean diagram (1995) 117We here touch upon a general problem inherent in any use <strong>of</strong> (quasi-)semantic methods for reductio along the lines suggested, not just diagrams, butalso most other forms <strong>of</strong> ‘semantic representation’ and ‘models’. Suppose theartifact d (here, a diagram) is not subjected to a constraint e (here, exact). Onthe one hand, if e fails in any d satisfying the appropriate constraints, then itwould be appropriate to consider this to conclude the reductio, in that ourcommitment to e (in the text) is incompatible with the failure <strong>of</strong> e in anyd satisfying the constraints we impose on it. On the other hand, it is part<strong>of</strong> what we expect from (quasi-)semantic artifact use that e may fail in oneartifact satisfying the constraints we impose but not in another; that is, thatour production and reading <strong>of</strong> d-type artifacts proceeds less uniformly that oursetting up <strong>of</strong> conditions (e-type artifacts).In view <strong>of</strong> the former possibility, we would want to be able to read <strong>of</strong>f ¬efrom d to conclude the reductio; but in view <strong>of</strong> the latter possibility, we cannotafford to do so on pain <strong>of</strong> disarray: our text inferences would then proceedmore uniformly than corresponds (via production and reading procedure) tod-type artifacts. What is a practice to do in such a bind?In the example <strong>of</strong> I.6, reading <strong>of</strong>f <strong>of</strong> ¬e is simply blocked, in that it is aninequality, and hence not explicit in our technical sense. Most negations <strong>of</strong> exactconditions are in fact not diagram conditions, and this blocks their attribution;evidently, geometrical reductio typically just has to do without the ability toclose <strong>of</strong>f by attributing ¬e even if a d-type object satisfying the constraintswe impose on it cannot be subjected to e. Undercutting attribution licensesshould not cause worry <strong>of</strong> unfounded conclusions or disarray in diagram-basedreductio argument: it only weakens the argumentative resources at hand.This, however, has nothing to do with the source <strong>of</strong> the problem withquasi-semantic artifact use in reductio pro<strong>of</strong>, which we already identified:‘quasi-semantic’ artifact use provides less support for uniform proceeding thanordinary text. The appropriate solution then, as always when capacity foruniform proceeding in one aspect or stage within a practice falls short <strong>of</strong>such capacity elsewhere, in a finite-to-one or otherwise surveyable fashion,is case distinction. In reductio, then, we should not aim to simply block theattribution ¬e outright. Rather, if there are different diagrams with potential toaffect the argument, we should consider them as cases, and if we fail to do so,an objection is in order, presenting some diagram <strong>of</strong> a type not yet considered.There is nothing special about reductio, or geometry, in this.If this general policy is in force, however, then the present difficulty cannotbe avoided simply by diagramming the lines smoothly to avoid ascribing apentangle; for the pentangle diagram could still be brought as an objection.There must, therefore, be a way <strong>of</strong> dealing with that diagram, either by

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

Saved successfully!

Ooh no, something went wrong!