isadofschi / combinatorial_nullstellensatzLinks
A Lean formal proof of the Combinatorial Nullstellensatz
☆11Updated 2 years ago
Alternatives and similar repositories for combinatorial_nullstellensatz
Users that are interested in combinatorial_nullstellensatz are comparing it to the libraries listed below
Sorting:
- Verifying encodings into propositional logic in Lean☆12Updated last year
- Formalization of Arithmetization of Mathematics/Metamathematics☆12Updated 2 months ago
- ☆16Updated last year
- egraph <-> json☆14Updated 8 months ago
- PL syntax macros.☆19Updated 2 weeks ago
- The formal proof of the Odd Order Theorem☆30Updated 2 weeks ago
- ☆23Updated 3 years ago
- Experiments with some ways of automating reasoning in lean 4☆16Updated last year
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- A tool to auto-generate and render slides from Markdown comments in the Lean editor.☆18Updated last month
- Complexity analysis in Lean☆10Updated last year
- Reference sheet for people who know Lean 3 and want to write tactic-based proofs in Lean 4☆27Updated 6 months ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆15Updated 2 years ago
- Formalization of Wigderson's graph coloring algorithm in Coq☆9Updated last year
- An interface for using mwillsey/egg with math simplification.☆13Updated last year
- ☆21Updated 2 weeks ago
- HoTT Book formalisations in Rzk.☆18Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆35Updated this week
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆23Updated 2 months ago
- An reimplementation of the Proost proof-assistant written in Lean 4☆12Updated last year
- Formalizing convex polyhedra in Coq☆24Updated 10 months ago
- ☆13Updated 2 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Notes (and implementation) of unification with binders☆14Updated 3 weeks ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 5 months ago
- ☆21Updated 3 years ago
- ☆12Updated 2 years ago
- ☆31Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago