E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely...

is allowed to be infinite enumerable. It follows that an automated theorem prover will fail to terminate while searching for a proof precisely when the...

Vampire is an automatic theorem prover for first-order classical logic developed in the Department of Computer Science at the University of Manchester...

computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by...

Isabelle automated theorem prover is a higher-order logic (HOL) theorem prover, written in Standard ML and Scala. As an LCF-style theorem prover, it is based...

Android E (PC DOS), a text editor E (programming language), an object-oriented programming language E (theorem prover), a modern, high performance prover for...

Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at Stanford and Edinburgh by Robin Milner and collaborators in...

Aided Reasoning Engine) is a first-order classical logic automated theorem prover. It was initially built for the study of the enhancement effects of...

SNARK, (SRI's New Automated Reasoning Kit), is a theorem prover for multi-sorted first-order logic intended for applications in artificial intelligence...

Lindemann–Weierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states the following: Lindemann–Weierstrass theorem — if...

deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In mainstream mathematics, the axioms...

Nqthm is a theorem prover sometimes referred to as the Boyer–Moore theorem prover. It was a precursor to ACL2. The system was developed by Robert S. Boyer...

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function f...

theorem, it provides a proof for Fermat's Last Theorem. Both Fermat's Last Theorem and the modularity theorem were believed to be impossible to prove...

The Larch Prover, or LP for short, is an interactive theorem proving system for multi-sorted first-order logic. It was used at MIT and elsewhere during...

In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, b...

Interactive Theorem Proving (ITP) is an annual international academic conference on the topic of automated theorem proving, proof assistants and related...

and Richard Taylor proved the modularity theorem for semistable elliptic curves, which was enough to imply Fermat's Last Theorem. Later, a series of...

Vreeswijk, which is about a hen named Agda. This alludes to the name of the theorem prover Coq, which was named after Thierry Coquand. The main way of defining...

the Isabelle theorem prover. Other proofs are also known. Gödel's incompleteness theorems Original proof of Gödel's completeness theorem Batzoglou, Serafim...

fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste...

theorem states that no consistent system of axioms whose theorems can be listed by an effective procedure (i.e. an algorithm) is capable of proving all...

theorem proving ACL2 theorem prover E equational theorem prover Gandalf theorem prover HOL theorem prover Isabelle theorem prover LCF theorem prover Otter...

In mathematics, the mean value theorem (or Lagrange's mean value theorem) states, roughly, that for a given planar arc between two endpoints, there is...

In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle...

argumentation system that is more specific than being just an automated theorem prover. Tools and techniques of automated reasoning include the classical logics...

In mathematics, the Stolz–Cesàro theorem is a criterion for proving the convergence of a sequence. It is named after mathematicians Otto Stolz and Ernesto...

In mathematical analysis, the intermediate value theorem states that if f {\displaystyle f} is a continuous function whose domain contains the interval...

well-quasi-ordered under homeomorphic embedding. The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960); a short proof was given...

forth. The theorem was first established by Picard and Goursat using an iterative scheme: the basic idea is to prove a fixed point theorem using the contraction...