COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The Big Proof Agenda for Mechanizing Mathematical Discourse

## The Big Proof Agenda for Mechanizing Mathematical DiscourseAdd to your list(s) Download to your calendar using vCal - Natarajan Shankar (SRI International)
- Monday 26 June 2017, 11:00-12:00
- Seminar Room 2, Newton Institute.
If you have a question about this talk, please contact info@newton.ac.uk. BPR - Big proof We are creating and using mathematical knowledge at a rapidly increasing rate. This growth creates the need for automation in building and indexing formal mathematical knowledge bases. Automated proof technologies such as theorem proving, satisfiability solving, and model checking are increasingly being used for formalizing the behavior of computer hardware and software systems, constructing large libraries of formalized mathematics, and solving open problems. We outline an agenda for the Big Proof programme toward pragmatic foundations and practical technologies that can assist pure and applied mathematicians solve large problems individually and collaboratively. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 2, Newton Institute
Note that ex-directory lists are not shown. |
## Other listsCfEL's Enterprise Tuesday 2011/2012 Psychology and Religion Research Group (PRRG) The Danby Society: Downing College Science Society## Other talksPTPmesh: Data Center Network Latency Measurements Using PTP Dynamics of Phenotypic and Genomic Evolution in a Long-Term Experiment with E. coli 70th Anniversary Celebration Single Cell Seminars (July) Concise - a synthesis of types, grammars, semantics Coin Betting for Backprop without Learning Rates and More |