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.
This talk is included in these lists:
Note that exdirectory lists are not shown.
