University of Birmingham > Talks@bham > Theoretical computer science seminar > Formalising mathematics in a theorem prover

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Formalising mathematics in a theorem prover

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

If you have a question about this talk, please contact Martin Escardo.

I will talk about why one might want to formalise all undergraduate and MSc level pure mathematics in a theorem prover, will explain how a team of people are attempting to do this in the Lean theorem prover, and will attempt to justify the choice of Lean as a system for formalising all undergraduate and MSc level pure mathematics.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Midlands Logic Seminar Cond. Mat. seminar Molecular and Medical Physics Seminar Series

Other talks

Ultrafast, all-optical, and highly efficient imaging of molecular chirality Hodge Theory: Connecting Algebra and Analysis TBC Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Modelling uncertainty in image analysis. Perfect matchings in random sparsifications of Dirac hypergraphs
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.