Главная
Study mode:
on
1
Intro
2
Is formalization a formality?
3
Some computer proof landmarks
4
An old puzzle's story
5
Saved by the computer?
6
The whole proof
7
Proof Algorithms
8
Reflecting reducibility
9
Building a square
10
Building configurations
11
Colouring interpretation
12
The Poincaré principle
13
Minimal logic
14
Functions in logic The Moderns
15
Crafting map descriptions
16
Proof by folklore
17
Size matters
18
The Odd Order Theorem
19
All finite groups of odd order are solvable. Proof: Let G be a minimal counter-example...
20
A mathematical library shelf
21
Textbook vs. digital formal text
22
Interactive Math
23
Algebraic Notation
24
Implementing notation
25
Algebra interfaces Equality
26
Inferring notation
27
Basic interfaces and objects bool
28
Ad hoc inference
29
Interfacing big operators
30
Coprime cycle coherence
31
A dot product matrix puzzle
32
An integer norm problem
33
Sorting a combinatorial mess
34
Homotopy type theory Type A
35
Synthetic Homotopy Type Theory
36
Cubical Type Theory
37
Conclusion
Description:
Explore a comprehensive lecture on the progress of computer-assisted mathematical proofs, from the four-color puzzle to the Kepler conjecture. Delve into how computer science and software engineering methods have been applied to mathematical language, leading to new insights like synthetic homotopy type theory. Examine various landmarks in computer proofs, including the Odd Order theorem and its implications for finite groups. Investigate the challenges and benefits of formalizing mathematical proofs, the development of proof algorithms, and the implementation of algebraic notation in digital formal texts. Learn about interactive mathematics, algebraic interfaces, and the emergence of Homotopy Type Theory. Gain insights into the future of computer-assisted mathematics and its potential to revolutionize mathematical research and education.

Georges Gonthier - Computer Proofs - Teaching Computers Mathematics, and Conversely

International Mathematical Union
Add to list
0:00 / 0:00