leoprover / Leo-IIILinks
An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
☆50Updated last week
Alternatives and similar repositories for Leo-III
Users that are interested in Leo-III are comparing it to the libraries listed below
Sorting:
- Pedagogical first-order prover in Python☆76Updated 4 months ago
- ☆154Updated last week
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆53Updated last year
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆84Updated 3 months ago
- Formalization of Machine Learning Theory with Applications to Program Synthesis☆78Updated this week
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 2 years ago
- Lean 4 Metamath verifier☆21Updated 5 months ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- Python bindings for the Coq interactive proof assistant☆56Updated 3 years ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆151Updated last year
- Logic and Mechanized Reasoning☆107Updated 3 months ago
- Holophrasm: a neural Automated Theorem Prover for higher-order logic☆56Updated 5 years ago
- "proving-contest"-backends for several theorem provers☆13Updated 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 3 weeks ago
- The MMT Language and System☆76Updated last month
- Metamath verifier in Python☆39Updated 4 months ago
- Graph Theory [maintainers=@chdoc,@damien-pous]☆39Updated last month
- A library of mechanised undecidability proofs in the Coq proof assistant.☆124Updated last month
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated last year
- A best-first-search theorem prover implemented in Isabelle☆34Updated 3 years ago
- A lazy-grounding Answer-Set Programming system☆63Updated 8 months ago
- Statements of famous theorems proven in Coq [maintainer=@jmadiot]☆60Updated 4 months ago
- Verified decision procedures for modal logics in Lean☆12Updated 5 years ago
- Language based on Rewriting Logic☆140Updated 2 weeks ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- ⚙️ A conflict-driven nogood learning answer set solver☆127Updated last week
- 🦮 An introduction to our Answer Set Programming tools focusing on gringo, clingo, and clasp.☆83Updated 2 years ago
- Implementation of the λΠ-calculus modulo rewriting☆217Updated 2 months ago