Anon52MI4 / oeis-alienLinks
☆20Updated 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☆17Updated 2 years ago
- Metamath verifier in Python☆39Updated 4 months ago
- Python talking to the Lean theorem prover☆46Updated 4 years ago
- ☆93Updated last year
- Experiments with some ways of automating reasoning in lean 4☆17Updated last year
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆50Updated this week
- Bonn Lean course for winter 24/25☆36Updated last month
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 4 months ago
- ☆11Updated last year
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆53Updated last year
- "proving-contest"-backends for several theorem provers☆13Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated last week
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- ☆24Updated 3 weeks ago
- Pedagogical first-order prover in Python☆76Updated 4 months ago
- Interfacing with Large Language Models (remote and local) from Lean.☆28Updated last year
- ☆12Updated last week
- ☆22Updated last year
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆38Updated 2 weeks ago
- Python bindings for the Coq interactive proof assistant☆56Updated 3 years ago
- Formalization of Machine Learning Theory with Applications to Program Synthesis☆78Updated this week
- An automated approach to the Collatz conjecture☆12Updated 2 years ago
- Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.☆18Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆52Updated last month
- Busy Beaver deciders backed by Coq proof☆57Updated 7 months ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated last year
- Conservative floating point interval arithmetic in Lean☆23Updated last month
- A place to put our 2018 Xena project UROP thoughts and programs.☆25Updated 5 years ago
- Formalisation of the Cambridge Part II and Part III courses Graph Theory, Combinatorics, Extremal and Probabilistic Combinatorics in Lean☆60Updated 2 weeks ago