Name
Abstract | ||
|---|---|---|
This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by Coq. To support the formalization, we developed a comprehensive set of reusable libraries of formalized mathematics, including results in finite group theory, linear algebra, Galois theory, and the theories of the real and complex algebraic numbers. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-39634-2_14 | ITP |
Keywords | Field | DocType |
formalized proof,feit-thompson odd order theorem,galois theory,comprehensive set,foundational framework,complex algebraic number,odd order theorem,formalized mathematics,finite group theory,coq proof assistant,machine-checked proof,complete formalization | Analytic proof,Computer-assisted proof,Discrete mathematics,Constructive proof,Proof by contradiction,Computer science,Structural proof theory,Proof theory,Mathematical proof,Proof assistant | Conference |
Volume | ISSN | Citations |
7998 | 0302-9743 | 80 |
PageRank | References | Authors |
3.41 | 22 | 15 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georges Gonthier | 1 | 2275 | 195.06 |
| Andrea Asperti | 2 | 849 | 75.19 |
| Jeremy Avigad | 3 | 462 | 43.47 |
| Yves Bertot | 4 | 442 | 40.82 |
| Cyril Cohen | 5 | 127 | 8.53 |
| François Garillot | 6 | 160 | 7.53 |
| Stéphane Le Roux | 7 | 143 | 17.47 |
| Assia Mahboubi | 8 | 308 | 20.84 |
| Russell O'Connor | 9 | 154 | 11.75 |
| Sidi Ould Biha | 10 | 132 | 7.63 |
| Ioana Pasca | 11 | 140 | 7.99 |
| Laurence Rideau | 12 | 253 | 16.08 |
| Alexey Solovyev | 13 | 205 | 10.13 |
| Enrico Tassi | 14 | 327 | 21.79 |
| Laurent Théry | 15 | 456 | 41.21 |