- theorem proving
- мат. доказательство теоремы
Большой англо-русский и русско-английский словарь. 2001.
theorem proving
Смотреть что такое "theorem proving" в других словарях:
Theorem Proving in Higher-Order Logics — (TPHOLs) is an annual international academic conference on the topic of automated reasoning in higher order logics. The first TPHOLs was held in Cambridge, UK in 1987, but in the early years was an informal gathering of researchers interested in… … Wikipedia
Theorem Proving System — The Theorem Proving System (TPS) is an automated theorem proving system for first order and higher order logic. TPS has been developed at Carnegie Mellon University. An educational version of it is known as ETPS (Educational Theorem Proving… … Wikipedia
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
International Workshop on First-Order Theorem Proving — The International Workshop on First Order Theorem Proving (FTP) is a scientific meeting of researchers interested in automated theorem proving for first order logic and related fields. FTP workshops are less formal than many conferences, but more … Wikipedia
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… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Cook–Levin theorem — In computational complexity theory, the Cook–Levin theorem, also known as Cook s theorem, states that the Boolean satisfiability problem is NP complete. That is, any problem in NP can be reduced in polynomial time by a deterministic Turing… … 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
Herbrand's theorem — is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). [J. Herbrand: Recherches sur la theorie de la demonstration. Travaux de la Societe des Sciences et des Lettres de Varsovie, Class III, Sciences Mathematiques et… … Wikipedia
Otter (theorem prover) — Otter is an automated theorem prover developed by William McCune at Argonne National Laboratory in Illinois. Otter was the first widely distributed, high performance theorem prover for first order logic, and it pioneered a number of important… … Wikipedia
