Lean theorem prover
E1578107
UNEXPLORED
Lean theorem prover is an interactive proof assistant and programming language designed for writing and verifying formal mathematical proofs and certified software.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Lean theorem prover canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T23281161 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lean theorem prover Context triple: [Curry–Howard correspondence, usedIn, Lean theorem prover]
-
A.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
B.
Archive of Formal Proofs
The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
-
C.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
D.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Lean theorem prover Target entity description: Lean theorem prover is an interactive proof assistant and programming language designed for writing and verifying formal mathematical proofs and certified software.
-
A.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
B.
Archive of Formal Proofs
The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
-
C.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
D.
HOL theorem prover
The HOL theorem prover is an interactive proof assistant for higher-order logic, widely used in formal verification of hardware, software, and mathematical theories.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.