Anon52MI4 / oeis-alienLinks
☆22Updated 2 years ago
Alternatives and similar repositories for oeis-alien
Users that are interested in oeis-alien are comparing it to the libraries listed below
Sorting:
- A formal proof of an exponentially better upper bound on Ramsey numbers☆18Updated 2 years ago
- Metamath verifier in Python☆40Updated 6 months ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆55Updated last year
- ☆11Updated last year
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 5 years ago
- An automated approach to the Collatz conjecture☆12Updated 2 years ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- "proving-contest"-backends for several theorem provers☆13Updated last year
- Bonn Lean course for winter 24/25☆38Updated last week
- ☆93Updated 2 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- ☆24Updated 3 weeks ago
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆50Updated last month
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆37Updated 7 months ago
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated last year
- Source of metamath book☆51Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆75Updated 5 months ago
- Pedagogical first-order prover in Python☆77Updated 5 months ago
- Lean 4 Metamath verifier☆21Updated 6 months ago
- ☆17Updated 7 months ago
- Experiments with some ways of automating reasoning in lean 4☆17Updated last year
- Methods for accelerating and proving theorems about 5-state Busy Beaver candidates☆20Updated 4 years ago
- Python talking to the Lean theorem prover☆46Updated 4 years ago
- Interfacing with Large Language Models (remote and local) from Lean.☆28Updated last year
- Statements of famous theorems proven in Coq [maintainer=@jmadiot]☆60Updated 2 weeks ago
- Holophrasm: a neural Automated Theorem Prover for higher-order logic☆56Updated 5 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated last year
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆25Updated 2 months ago
- Busy Beaver deciders backed by Coq proof☆58Updated 9 months ago
- A place to put our 2018 Xena project UROP thoughts and programs.☆26Updated 5 years ago