Editing Theorem (section)

==Theorems in logic==

In [[mathematical logic]], a [[Theory (mathematical logic)|formal theory]] is a set of sentences within a [[formal language]]. A sentence is a [[Well-formed formulas|well-formed formula]] with no free variables. A sentence that is a member of a theory is one of its theorems, and the theory is the set of its theorems. Usually a theory is understood to be closed under the relation of [[logical consequence]]. Some accounts define a theory to be closed under the [[Logical consequence#Semantic consequence|semantic consequence]] relation (<math>\models</math>), while others define it to be closed under the [[Logical consequence#Syntactic consequence|syntactic consequence]], or derivability relation (<math>\vdash</math>).{{sfn|Boolos|Burgess|Jeffrey|2007|p=191}}{{sfn|Chiswell|Hodges|2007|p=172}}{{sfn|Enderton|2001|p=148}}{{sfn|Hedman|2004|p=89}}{{sfn|Hinman|2005|p=139}}{{sfn|Hodges|1993|p=33}}{{sfn|Johnstone|1987|p=21}}{{sfn|Monk|1976|p=208}}{{sfn|Rautenberg|2010|p=81}}{{sfn|van Dalen|1994|p=104}}

{{Clear}}<!-- stop picture bleeding into completely unrelated next section -->

[[File:Formal languages.svg|thumb|300px|right|This diagram shows the [[Syntax (logic)|syntactic entities]] that can be constructed from [[formal language]]s. The [[symbol (formal)|symbols]] and [[string (computer science)|strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.]]

For a theory to be closed under a derivability relation, it must be associated with a [[Formal system#Deductive system|deductive system]] that specifies how the theorems are derived. The deductive system may be stated explicitly, or it may be clear from the context. The closure of the empty set under the relation of logical consequence yields the set that contains just those sentences that are the theorems of the deductive system.

In the broad sense in which the term is used within logic, a theorem does not have to be true, since the theory that contains it may be [[Soundness|unsound]] relative to a given semantics, or relative to the standard [[Interpretation (logic)|interpretation]] of the underlying language. A theory that is [[Consistency#Model theory|inconsistent]] has all sentences as theorems.

The definition of theorems as sentences of a formal language is useful within [[proof theory]], which is a branch of mathematics that studies the structure of formal proofs and the structure of provable formulas. It is also important in [[model theory]], which is concerned with the relationship between formal theories and structures that are able to provide a semantics for them through [[Interpretation (logic)|interpretation]].

Although theorems may be uninterpreted sentences, in practice mathematicians are more interested in the meanings of the sentences, i.e. in the propositions they express. What makes formal theorems useful and interesting is that they may be interpreted as true propositions and their derivations may be interpreted as a proof of their truth. A theorem whose interpretation is a true statement ''about'' a formal system (as opposed to ''within'' a formal system) is called a ''[[metatheorem]]''.

Some important theorems in mathematical logic are:
 
* [[Compactness theorem|Compactness of first-order logic]] 
* [[Gödel's completeness theorem|Completeness of first-order logic]]
* [[Gödel's incompleteness theorems|Gödel's incompleteness theorems of first-order arithmetic]]
* [[Gentzen's consistency proof|Consistency of first-order arithmetic]] 
* [[Tarski's undefinability theorem]]
* [[Entscheidungsproblem#Negative answer|Church-Turing theorem of undecidability]] 
* [[Löb's theorem]] 
* [[Löwenheim–Skolem theorem]]
* [[Lindström's theorem]]
* [[Craig's theorem]] 
* [[Cut-elimination theorem]]

=== Syntax and semantics ===
{{Main|Syntax (logic)|Formal semantics (logic)}}

The concept of a formal theorem is fundamentally syntactic, in contrast to the notion of a ''true proposition,'' which introduces [[semantics]]. Different deductive systems can yield other interpretations, depending on the presumptions of the derivation rules (i.e. [[belief]], [[Theory of justification|justification]] or other [[Modal logic|modalities]]). The [[soundness]] of a formal system depends on whether or not all of its theorems are also [[Validity (logic)|validities]]. A validity is a formula that is true under any possible interpretation (for example, in classical propositional logic, validities are [[tautology (logic)|tautologies]]). A formal system is considered [[completeness (logic)|semantically complete]] when all of its theorems are also tautologies.

=== Interpretation of a formal theorem ===
{{Main|Interpretation (logic)}}<!-- Wouldn't this fit better in the page "formal theorem"? -->

=== Theorems and theories ===
{{Main|Theory|Theory (mathematical logic)}}