Computer Algebra and the Formalisation of New Mathematics

Add to your list(s) Download to your calendar using vCal

• Lawrence Paulson (University of Cambridge)
• Thursday 21 November 2024, 17:00-18:00
• MR14 Centre for Mathematical Sciences.

If you have a question about this talk, please contact Jonas Bayer.

Although people have sought to integrate computer algebra with theorem proving since the 1990s, none of today’s proof assistants claim to offer such an integration. However, Isabelle is capable of some basic computer algebra tasks, including symbolic differentiation (and hence symbolic integration via the FTC ), deductive limit finding and exact arbitrary-precision real arithmetic. These facilities will be presented alongside their application to formalising last year’s celebrated result of an exponentially improved upper bound for Ramsey numbers.

Slides: https://www.cl.cam.ac.uk/~lp15/papers/Alexandria/SC-Square-2024.pdf

Recording: https://youtu.be/HeQKT6OeIX4

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• MR14 Centre for Mathematical Sciences
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.