anton-petrunin / birkhoffLinks
Euclidean plane and its relatives; a minimalist introduction.
☆18Updated last month
Alternatives and similar repositories for birkhoff
Users that are interested in birkhoff are comparing it to the libraries listed below
Sorting:
- A place to put our 2018 Xena project UROP thoughts and programs.☆25Updated 5 years ago
- Stacks project, from a homotopy type theory point-of-view (hPOV)☆14Updated 4 years ago
- Deposited packages of the homalg project☆15Updated 3 months ago
- Open textbook on modal logic☆23Updated last month
- Mathematical notes and papers☆26Updated 2 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆33Updated 3 months ago
- Metamath verifier in Python☆40Updated 2 months ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated last month
- An encyclopedia of proofs☆62Updated 9 months ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 5 years ago
- A Lean 4 formalization of partial combinatory algebras.☆14Updated 7 months ago
- Algebra Number Theory book☆48Updated 3 years ago
- Source of metamath book☆49Updated last year
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆43Updated last year
- type-system, revised unification algorithm and runtime time representations☆14Updated 5 years ago
- A partial formalization of Geometric Algebra in the Lean formal proof verification system.☆53Updated last year
- M4 algebraic geometry course in Lean☆59Updated 5 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- multilingual dictionary of mathematical terminology☆19Updated last month
- ☆13Updated 2 weeks ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated 11 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- The formal proof of the Odd Order Theorem☆32Updated last month
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆13Updated 5 months ago
- mmj2 GUI Proof Assistant for the Metamath project☆76Updated 10 months ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago