Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Proof theory |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
Proof theory, a form of metamathematics, studies the ways in which proofss are used in mathematics. However, in contrast to common mathematics, statements and proofs in proof theory are purely formal. This means that they are specified in a formal language that usually employs some symbolic logic.
Therefore, on the one hand, proof theory admits no ambiguity. On the other hand, it is restricted to those statements that can be expressed in the chosen language. In this strictly formal sense, proof theory is not necessarily a form of metamathematics, but can have immediate applications in artificial intelligence, where automated deduction plays an important role.
Proof theory studies how tautologies can be proven with the help of some formal calculus. Based on the axioms and rules of inference of such a system, derivations of logical statements are constructed. These derivations constitute formal proofs of the statements.
As such, proof theory is related to syntax in logic; model theory correspondingly relates to semantics. The method of proof theory is to consider proofs as combinatorial objects, or examples of data structures, in their own right. As such they may be manipulated or operated on systematically, the set of all proofs in a formal language being itself a formal language.
In some situations, the term proof theory may be used to refer to a concrete calculus. For example, one may state that there is no proof theory for second-order logic, meaning that there is no syntactical calculus for this logic that simultaneously (1) is sound, and (2) is complete, and (3) admits a proof-checking algorithm. First-order logic and many logics "below" admit a proof theory.
Historically, the field was established by David Hilbert, generally considered one of the greatest mathematicians of the late 19th and early 20th century. The major step forward technically speaking was the work of Gerhard Gentzen on the method of cut-elimination. See the pages sequent and sequent calculus.
Proof theory, model theory, axiomatic set theory, and recursion theory are the so-called "four theories" of the foundations of mathematics.
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Proof theory."
| Domain | Title |
Books |
|
Source: compiled by the editor from various references; see credits. | |
| The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com. |
| Expression | Frequency per Day |
number proof theory | 14 |
proof theory | 2 |
| Source: compiled by the editor from various references; see credits. | |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "e-f-h-o-o-o-p-r-r-t-y" | |
-3 letters: footrope, orthoepy. | |
-4 letters: foretop, oophyte, orphrey, poofter, proofer, reproof, rooftop, torrefy, trooper. | |
-5 letters: foetor, footer, frothy, hoofer, hooper, hoopoe, hooter, phooey, poetry, poorer, porter, pother, pretor, report, reroof, rhetor, roofer, rooter, ropery, theory, thorpe, torero, torpor, trophy. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 52 4F 4F 46      54 48 45 4F 52 59 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01010010 01001111 01001111 01000110 00100000 01010100 01001000 01000101 01001111 01010010 01011001 |
HTML Code (1990) (references)P R O O F   T H E O R Y |
ISO 10646 (1991-1993) (references)0050 0052 004F 004F 0046      0054 0048 0045 004F 0052 0059 |
Encryption (beginner's substitution cypher): (references)50524949402544239495259 |
| 1. Usage: Commercial 2. Expressions: Internet 3. Anagrams 4. Orthography | 5. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.