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.

308 jeremy avigadWe <strong>of</strong>ten have good intuitions as to the ways that mathematical developmentsconstitute conceptual advances or further understanding. It is therefore reasonableto ask for a philosophical theory that can serve to ground such assessments,and account for the more general epistemological criteria by which suchdevelopments are commonly judged.In sum, questions about the use <strong>of</strong> computers in mathematics that seemreasonable from a pre-theoretic perspective push us to extend the traditionalphilosophy <strong>of</strong> mathematics in two ways: first, to develop theories <strong>of</strong> mathematicalevidence, and second, to develop theories <strong>of</strong> mathematical understanding.In the next two sections, I will consider each <strong>of</strong> these proposals, in turn.11.4 Theories <strong>of</strong> mathematical evidenceWe have seen that some issues regarding the use <strong>of</strong> computers in mathematicshinge on assessments <strong>of</strong> the ‘likelihood’ that a mathematical assertionis true:• a probabilistic primality test renders it highly likely that a number is prime;• numeric simulations can render it plausible that a hypothesis is true;• formal verification can render it nearly certain that a theorem has a correctpro<strong>of</strong>.Since judgments like these serve to guide our actions, it is reasonable toask for a foundational framework in which they can be evaluated. Sucha framework may also have bearing on the development <strong>of</strong> computationalsupport for mathematics; for example, systems for automated reasoning andformal verification <strong>of</strong>ten attempt to narrow the search space by choosing themost ‘plausible’ or ‘promising’ paths.Probabilistic notions <strong>of</strong> likelihood, evidence, and support have long playeda role in characterizing inductive reasoning in the empirical sciences, and it istempting to carry these notions over to the mathematical setting. However,serious problems arise when one tries to do so. Roughly speaking, this isbecause any mathematical assertion is either true, in which case it holds withprobability 1, or false, in which case it holds with probability 0, leaving noroom for values in between.Put more precisely, classical approaches to probability model ‘events’ asmeasurable subsets <strong>of</strong> a space whose elements are viewed as possible outcomes<strong>of</strong> an experiment, or possible states <strong>of</strong> affairs. The laws <strong>of</strong> probability dictatethat if an event A entails an event B, in the sense that A ⊆ B, then the

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

Saved successfully!

Ooh no, something went wrong!