isadofschi / combinatorial_nullstellensatz
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
- The formal proof of the Odd Order Theorem☆30Updated last week
- Mathematical stories☆13Updated 4 years ago
- Formalization of Arithmetization of Mathematics/Metamathematics☆12Updated 2 months ago
- ☆23Updated 2 years ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆23Updated last month
- ☆31Updated last year
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆15Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- ☆16Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆35Updated last month
- ☆20Updated 2 weeks ago
- PL syntax macros.☆19Updated last week
- Verifying encodings into propositional logic in Lean☆12Updated last year
- ☆11Updated last year
- Formalizing convex polyhedra in Coq☆24Updated 10 months ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Experiments with some ways of automating reasoning in lean 4☆16Updated last year
- A tool to auto-generate and render slides from Markdown comments in the Lean editor.☆18Updated 3 weeks ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- A formalization of the theory behind the mugen library☆19Updated 10 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last week
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Formalization of Wigderson's graph coloring algorithm in Coq☆9Updated last year
- Plain-text declaration export for Lean 4☆15Updated 6 months ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- Notes (and implementation) of unification with binders☆14Updated last month