|go to week of Dec 30, 2012||30||31||1||2||3||4||5|
|go to week of Jan 6, 2013||6||7||8||9||10||11||12|
|go to week of Jan 13, 2013||13||14||15||16||17||18||19|
|go to week of Jan 20, 2013||20||21||22||23||24||25||26|
|go to week of Jan 27, 2013||27||28||29||30||31||1||2|
Event Detail Information
he philosophy of mathematics has long been focused on determining the methods that are appropriate for justifying claims of mathematical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosopher's have called attention to the fact that a much broader range of normative judgments arise in ordinary mathematical practice; for example, questions can be interesting, theorems important, proofs explanatory, concepts powerful, and so on. The associated values are often loosely classified as aspects of "mathematical understanding".
Meanwhile, In a branch of computer science known as "formal verification," the practice of "interactive theorem proving" has given rise to software tools and systems designed to support the development of complex formal axiomatic proofs. Such efforts require one to develop models of mathematical language and inference that are more robust than the simple foundational models of the last century.
In this talk, I will explore some of the insights that emerge from this work, and some of the ways that these insights can inform, and be informed by, philosophical theories of mathematical understanding.