 Formal proof

A formal proof or derivation is a finite sequence of sentences (called wellformed formulas in the case of a formal language) each of which is an axiom or follows from the preceding sentences in the sequence by a rule of inference. The last sentence in the sequence is a theorem of a formal system. The notion of theorem is not in general effective, therefore there may be no method by which we can always find a proof of a given sentence or determine that none exists. The concept of natural deduction is a generalization of the concept of proof.^{[1]}
The theorem is a syntactic consequence of all the wellformed formulas preceding it in the proof. For a wellformed formula to qualify as part of a proof, it must be the result of applying a rule of the deductive apparatus of some formal system to the previous wellformed formulae in the proof sequence.
Formal proofs often are constructed with the help of computers in interactive theorem proving. Significantly, these proofs can be checked automatically, also by computer. Checking formal proofs is usually simple, while the problem of finding proofs (automated theorem proving) is usually computationally intractable and/or only semidecidable, depending upon the formal system in use.
Contents
Background
Formal language
Main article: Formal languageA formal language is a set of finite sequences of symbols. Such a language can be defined without reference to any meanings of any of its expressions; it can exist before any interpretation is assigned to it – that is, before it has any meaning. Formal proofs are expressed in some formal language.
Formal grammar
Main articles: Formal grammar and Formation ruleA formal grammar (also called formation rules) is a precise description of the wellformed formulas of a formal language. It is synonymous with the set of strings over the alphabet of the formal language which constitute well formed formulas. However, it does not describe their semantics (i.e. what they mean).
Formal systems
Main article: Formal systemA formal system (also called a logical calculus, or a logical system) consists of a formal language together with a deductive apparatus (also called a deductive system). The deductive apparatus may consist of a set of transformation rules (also called inference rules) or a set of axioms, or have both. A formal system is used to derive one expression from one or more other expressions.
Interpretations
Main articles: Formal semantics (logic) and Interpretation (logic)An interpretation of a formal system is the assignment of meanings to the symbols, and truthvalues to the sentences of a formal system. The study of interpretations is called formal semantics. Giving an interpretation is synonymous with constructing a model.
See also
 Proof (truth)
References
 ^ The Cambridge Dictionary of Philosophy, deduction
External links
 "A Special Issue on Formal Proof". Notices of the American Mathematical Society. December 2008. http://www.ams.org/notices/200811/.
 2πix.com: Logic Part of a series of articles covering mathematics and logic.
Categories: Formal languages
 Proof theory
 Formal systems
 Logical syntax
 Logical truth
Wikimedia Foundation. 2010.
Look at other dictionaries:
Proof theory — is a branch of mathematical logic that represents proofs as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively defined data structures such as plain lists, boxed… … Wikipedia
Proof — may refer to: * A rigorous, compelling argument ** Formal proof ** Mathematical proof ** Proof theory, a branch of mathematical logic that represents proofs as formal mathematical objects ** Logical argument ** Evidence (law), tested evidence or… … Wikipedia
ProofCarrying Code — (PCC) is a software mechanism that allows a host system to verify properties about an application via a formal proof that accompanies the application s executable code. The host system can compare the conclusions of the proof to its own security… … Wikipedia
Formal methods — In computer science and software engineering, formal methods are particular kind of mathematically based techniques for the specification, development and verification of software and hardware systems.cite webauthor=R. W. Butlertitle=What is… … Wikipedia
Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… … Wikipedia
Formal — The term formal has a number of uses, including:General*relating to formality *opposite of informalocial* Formal occasion ** Formal attire worn on such occasions ** Formals are particular meals at some British universities ** In Australian or… … Wikipedia
Formal verification — In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods… … Wikipedia
Formal specification — A formal specification is a mathematical description of software or hardware that may be used to develop an implementation. It describes what the system should do, not (necessarily) how the system should do it. Given such a specification, it is… … Wikipedia
Prooftheoretic semantics — is an approach to the semantics of logic that attempts to locate the meaning of propositions and logical connectives not in terms of interpretations, as in Tarskian approaches to semantics, but in the role that the proposition or logical… … Wikipedia
proof of debt — United Kingdom The form (proof of debt general form) on which a creditor submits details of its claim in a liquidation. In an administration, there is no prescribed proof of debt form but in practice administrators adopt the format of the proof… … Law dictionary