A Machine-Checked Proof of the Odd Order Theorem - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Machine-Checked Proof of the Odd Order Theorem

(1) , (1) , (1) , (1, 2) , (1) , (1) , (1) , (1, 3) , (1) , (1, 2) , (1, 2) , (1, 2) , (1) , (1, 3) , (1, 2)
1
2
3

Abstract

This paper reports on a six-year collaborative effort that cul- minated 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.
Fichier principal
Vignette du fichier
main.pdf (230.69 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00816699 , version 1 (22-04-2013)

Identifiers

Cite

Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, et al.. A Machine-Checked Proof of the Odd Order Theorem. ITP 2013, 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.163-179, ⟨10.1007/978-3-642-39634-2_14⟩. ⟨hal-00816699⟩

Collections

INRIA INSMI INRIA2
7034 View
5897 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More