Interactive theorem proving
- Interactive theorem proving
Interactive theorem proving is the field of computer science and mathematical logic concerned with tools to develop formal proofs by man-machine collaboration. This involves some sort of proof assistant: an interactive proof editor, or other interface, with which a human can guide the search for proofs, the details of which are stored in, and some steps provided by, a computer.
Examples include:
* HOL theorem provers - A family of tools ultimately derived from the LCF theorem prover. In these systems the logical core is a library of their programming language. Theorems represent new elements of the language and can only be introduced via "strategies" which guarantee logical correctness. Strategy composition gives users the ability to produce significant proofs with relatively few interactions with the system. Members of the family include:
** [http://hol.sourceforge.net/ HOL4] - The "primary descendant". Moscow ML based.
**HOL Lite - A thriving "minimalist fork". OCaml based.
**Isabelle - With a BSD license. Based on Standard ML.
**ProofPower - Went proprietary, then returned to open source. Based on Standard ML.
* Prototype Verification System (PVS) - a proof language and system based on higher-order logic
* Coq - Which allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification.
* PhoX - A proof assistant based on higher-order logic which is eXtensible
* MINLOG - A proof assistant based on first-order minimal logic.
See also
* Automated theorem proving
* Computer-assisted proof
* Proof verification
Wikimedia Foundation.
2010.
Look at other dictionaries:
Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… … Wikipedia
Interactive proof — can refer to: *Interactive proof system *Interactive theorem proving … Wikipedia
Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… … Wikipedia
HOL theorem prover family — HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharingsimilar logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library in some programming language … Wikipedia
LCF (theorem prover) — LCF (Logic for Computable Functions) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin Milner and others. LCF introduced the general purpose programming language ML to allow users to write … Wikipedia
SNARK theorem prover — SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… … Wikipedia
Pythagorean theorem — See also: Pythagorean trigonometric identity The Pythagorean theorem: The sum of the areas of the two squares on the legs (a and b) equals the area of the square on the hypotenuse (c) … Wikipedia
Automated reasoning — is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… … Wikipedia
List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… … Wikipedia
Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… … Wikipedia
