Engineering mathematics: the odd order theorem proof

DOI10.1145/2429069.2429071MaRDI QIDQ2931776zbMATH OpenOpenAlexFDO

Authors Georges Gonthier

Publication date 27 November 2014

Published in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2429069.2429071

zbMATH Keywords

automated theorem provingCoq/SSReflectmathematical componentsodd-order theoremproof engineering

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10)

Recommendations

• Developments in formal proofs
• A machine-checked proof of the odd order theorem
• The formalization of group theory knowledge and solving
• Theory Is Forever
• Mining the Archive of Formal Proofs

Cited in

(6)

• Biform theories: project description
• Developments in formal proofs
• Formalizing physics: automation, presentation and foundation issues
• Impossibility of gathering, a certification
• The formalization of group theory knowledge and solving
• Prime factorization of sums and differences of two like powers

Describes a project that uses

Uses Software

• Coq
• Coq/SSReflect

This page was built for publication: Engineering mathematics: the odd order theorem proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931776)