SettingsTheorem proving software systems
ACL2
ACL2 is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover.
ACL2 is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover.
E theorem prover
E is a modern, high performance theorem prover for full first-order logic with equality.
E is a modern, high performance theorem prover for full first-order logic with equality.
EQP
EQP, an abbreviation for equational prover, is an automated theorem proving program for equational logic, developed by the Mathematics and Computer Science Division of the Argonne National...
EQP, an abbreviation for equational prover, is an automated theorem proving program for equational logic, developed by the Mathematics and Computer Science Division of the Argonne National...
Gandalf (theorem prover)
Gandalf is a first-order automated theorem prover applied to several domain-specific tasks such as Semantic web.
Gandalf is a first-order automated theorem prover applied to several domain-specific tasks such as Semantic web.
Geometry Expert
Geometry Expert (GEX) is a Chinese software for dynamic diagram drawing and automated geometry theorem proving and discovering.
Geometry Expert (GEX) is a Chinese software for dynamic diagram drawing and automated geometry theorem proving and discovering.
Isabelle (proof assistant)
The Isabelle theorem prover is an interactive theorem prover, successor of the Higher Order Logic theorem prover.
The Isabelle theorem prover is an interactive theorem prover, successor of the Higher Order Logic theorem prover.
Isabelle (theorem prover)
The Isabelle theorem prover is an interactive theorem proving framework, a successor of the Higher Order Logic (HOL) theorem prover.
The Isabelle theorem prover is an interactive theorem proving framework, a successor of the Higher Order Logic (HOL) theorem prover.
KeY
The KeY tool is used in formal verification of Java programs.It accepts both specifications written in JML or OCL to Java source files.
The KeY tool is used in formal verification of Java programs.It accepts both specifications written in JML or OCL to Java source files.
Larch Prover
Larch Prover, or LP for short, is an interactive theorem proving system for multisorted first-order logic.
Larch Prover, or LP for short, is an interactive theorem proving system for multisorted first-order logic.
Lean theorem prover
A lean theorem prover is an automated theorem prover implemented in a minimum amount of code.
A lean theorem prover is an automated theorem prover implemented in a minimum amount of code.
Logic Theorist
Logic Theorist is a computer program written in 1955 and 1956 by Allen Newell, Herbert Simon and J. C. Shaw.
Logic Theorist is a computer program written in 1955 and 1956 by Allen Newell, Herbert Simon and J. C. Shaw.
MASON (Java)
MASON is an multi-agent simulation environment developed in Java at George Mason University's Evolutionary Computation Laboratory in conjunction with the GMU Center for Social Complexity.
MASON is an multi-agent simulation environment developed in Java at George Mason University's Evolutionary Computation Laboratory in conjunction with the GMU Center for Social Complexity.
Mathematica
Mathematica is a computational software program used in scientific, engineering, and mathematical fields and other areas of technical computing.
Mathematica is a computational software program used in scientific, engineering, and mathematical fields and other areas of technical computing.
Mathematics Mechanization and Automated Reasoning Platform
Mathematics Mechanization and Automated Reasoning Platform (Chinese: 数学机械化自动推理平台), or Mathematics-Mechanization Platform (MMP, code named elimino), is a group of automated theore...
Mathematics Mechanization and Automated Reasoning Platform (Chinese: 数学机械化自动推理平台), or Mathematics-Mechanization Platform (MMP, code named elimino), is a group of automated theore...
Metamath
Metamath is a language for developing strictly formalized mathematical definitions and proofs accompanied by a proof checker for this language and a growing database of thousands of proved theor...
Metamath is a language for developing strictly formalized mathematical definitions and proofs accompanied by a proof checker for this language and a growing database of thousands of proved theor...
Mizar system
The Mizar system consists of a language for writing strictly formalized mathematical definitions and proofs, a computer program which is able to check proofs written in this language, and a libr...
The Mizar system consists of a language for writing strictly formalized mathematical definitions and proofs, a computer program which is able to check proofs written in this language, and a libr...
Nqthm
Nqthm is a theorem prover sometimes referred to as the Boyer–Moore theorem prover.
Nqthm is a theorem prover sometimes referred to as the Boyer–Moore theorem prover.
NuPRL
NuPRL is a higher-order proof development system developed at Cornell University.
NuPRL is a higher-order proof development system developed at Cornell University.
OBJ (programming language)
OBJ is a programming language family introduced by Joseph Goguen in 1976.
OBJ is a programming language family introduced by Joseph Goguen in 1976.
OBJ3
OBJ3 is a version of OBJ based on order-sorted rewriting.
OBJ3 is a version of OBJ based on order-sorted rewriting.
Planner (programming language)
Planner is a programming language designed by Carl Hewitt at MIT, and first published in 1969.
Planner is a programming language designed by Carl Hewitt at MIT, and first published in 1969.
Prover9
Prover9 is an automated theorem prover for First-order and equational logic developed by William McCune.
Prover9 is an automated theorem prover for First-order and equational logic developed by William McCune.
SPASS
SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.
SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.
Tau (theorem prover)
Tau is a robust and general purpose, interactive (live on the web), user-configurable automated theorem prover for first-order predicate logic with equality.
Tau is a robust and general purpose, interactive (live on the web), user-configurable automated theorem prover for first-order predicate logic with equality.
Theorem Proving System
The Theorem Proving System (TPS) is an automated theorem proving system for first-order and higher-order logic.
The Theorem Proving System (TPS) is an automated theorem proving system for first-order and higher-order logic.
Twelf
Twelf is an implementation of the logical framework LF. It is used for logic programming and for the formalization of programming language theory.
Twelf is an implementation of the logical framework LF. It is used for logic programming and for the formalization of programming language theory.
Uclid
UCLID (, the same as "Euclid") is a decision procedure for CLU logic and can be used as a tool for bounded model checking of infinite-state systems.
UCLID (, the same as "Euclid") is a decision procedure for CLU logic and can be used as a tool for bounded model checking of infinite-state systems.
Vampire (theorem prover)
Vampire is an automatic theorem prover for first-order classical logic developed in the Computer Science Department of the University of Manchester by Prof.
Vampire is an automatic theorem prover for first-order classical logic developed in the Computer Science Department of the University of Manchester by Prof.