Baby-Set-Theory
Math proof framework
A Coq-based tutorial on set theory and theorem-proving using formalized mathematical proofs
Coq集合论中文教程
43 stars
1 watching
3 forks
Language: Coq
last commit: almost 4 years ago coqmathset-theorytheorem-proving
Related projects:
| Repository | Description | Stars |
|---|---|---|
| | A formalization of set theory and its foundational axioms in the Coq proof assistant language | 59 |
| | A personal repository of formally verified mathematics using the Coq proof assistant | 292 |
| | Formalizing mathematical theorems from Hardy's book in Coq to create a rigorous and reproducible formalization of number theory | 53 |
| | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| | A collection of mathematical theorems and tools within the Coq proof assistant | 15 |
| | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |
| | A formalization of information theory and linear error-correcting codes in Coq. | 64 |
| | A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |
| | A collection of notes and resources on formal methods, type theory, and theorem proving using Coq. | 21 |
| | Formalized graph theory results for research and verification | 35 |
| | Tutorials and materials for teaching Coq-based mathematical component development | 17 |
| | Formalizes algebraic combinatorics and symmetric functions in Coq. | 37 |
| | A library of abstract interfaces for various mathematical structures to facilitate algebraic manipulation and type class-based reasoning in Coq | 162 |
| | Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory. | 69 |