coq-hardy
Number theory formalism
Formalizing mathematical theorems from Hardy's book in Coq to create a rigorous and reproducible formalization of number theory
Formalizing the Theorems from Hardy's "An Introduction to the Theory of Numbers" in coq
53 stars
5 watching
5 forks
Language: Coq
last commit: over 6 years ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| | A formalization of geometry using the Coq proof assistant. | 186 |
| | A Coq-based tutorial on set theory and theorem-proving using formalized mathematical proofs | 43 |
| | A formalization of set theory and its foundational axioms in the Coq proof assistant language | 59 |
| | Formalized graph theory results for research and verification | 35 |
| | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |
| | Formalizes algebraic combinatorics and symmetric functions in Coq. | 37 |
| | A formalization of Dedekind reals numbers in the Coq programming language | 43 |
| | An axiomatic formalization of category theory in Coq for personal study and practical work | 759 |
| | An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
| | Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory. | 69 |
| | A collection of notes and resources on formal methods, type theory, and theorem proving using Coq. | 21 |
| | A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |
| | Formalizes mathematics using the univalent point of view | 964 |
| | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| | A formal proof of a fundamental result in graph theory using the Coq proof assistant | 174 |