Abel
Galois theorem formalizer
Formalization of mathematical theorems about solvability and Galois theory for polynomials
A proof of Abel-Ruffini theorem.
28 stars
8 watching
8 forks
Language: Coq
last commit: 3 months ago abel-ruffinicoqgalois-theorymathcompssreflect
Related projects:
Repository | Description | Stars |
---|---|---|
| Formalizes algebraic combinatorics and symmetric functions in Coq. | 37 |
| A comprehensive library of formalized mathematical theories | 593 |
| A collection of reusable mathematical components and algorithms implemented in Coq | 5 |
| Verifies a mathematical theorem in finite group theory | 27 |
| A formalization of information theory and linear error-correcting codes in Coq. | 64 |
| A personal repository of formally verified mathematics using the Coq proof assistant | 292 |
| A Coq proof-assistant library for real analysis and mathematical structures | 210 |
| A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| A tutorial project on using Coq to mechanize mathematics with dependent types | 160 |
| A Coq formalization of abstract algebra using functional programming style | 28 |
| A collection of mathematical theorems and tools within the Coq proof assistant | 15 |
| Formalizing mathematical theorems from Hardy's book in Coq to create a rigorous and reproducible formalization of number theory | 53 |
| A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |