Big Proofs and Formal Abstracts
Speaker: Prof. Thomas Hales

Time: 13h30, Tuesday, December 26, 2017
Room 611-612, Building A6, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: Proof assistants have been used to verify complicated proofs such as the Kepler conjecture in discrete geometry and theorems in group theory. Can formal proof technology help us to understand the statements of complicated conjectures such as Millennium (million-dollar) problems of the Clay Institute, the Langlands program, or the Kelvin problem for optimal partitions of space?