Professional Documents
Culture Documents
Original Proof of Gödel's Completeness Theorem
Original Proof of Gödel's Completeness Theorem
https://en.wikipedia.org/w/inde...
Original proof of
Gdel's completeness
theorem
From Wikipedia, the free encyclopedia
Contents
1 Denitions and assumptions
2 Statement of the theorem and its proof
2.1 Theorem 1. Every valid formula
(true in all structures) is provable.
2.2 Theorem 2. Every formula is
either refutable or satisable in
some structure.
1 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
2 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
3 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
5 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
6 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
7 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
together in blocks:
8 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
Clearly,
9 of 19
is provable.
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
and we have
10 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
Now
is a formula of degree k and therefore by
assumption either refutable or satisable. If
is
satisable in a structure M, then, considering
, we see that is satisable
as well. If
is refutable, then so is , which is
equivalent to it; thus
is provable. Now we can
replace all occurrences of Q inside the provable
formula
by some other formula dependent on
the same variables, and we will still get a provable
formula. (This is yet another basic result of
rst-order predicate calculus. Depending on the
particular formalism adopted for the calculus, it
may be seen as a simple application of a
"functional substitution" rule of inference, as in
Gdel's paper, or it may be proved by considering
the formal proof of
, replacing in it all
occurrences of Q by some other formula with the
same free variables, and noting that all logical
axioms in the formal proof remain logical axioms
after the substitution, and all rules of inference
still apply in the same way.)
In this particular case, we replace Q(x',y') in
with the formula
. Here
(x,y|x',y') means that instead of we are writing a
dierent formula, in which x and y are replaced
with x' and y'. Note that Q(x,y) is simply replaced
by
.
then becomes
11 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
12 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
as
. Then
put
as
13 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
14 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
15 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
Extensions
Extension to rst-order predicate
calculus with equality
Gdel reduced a formula containing instances of
the equality predicate to ones without it in an
extended language. His method involves replacing
a formula containing some instances of equality
with the formula
16 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
Here
denote the predicates appearing in
(with
their respective arities), and ' is the
formula with all occurrences of equality
replaced with the new predicate Eq. If this new
formula is refutable, the original was as well;
the same is true of satisability, since we may take
a quotient of satisfying model of the new formula
by the equivalence relation representing Eq. This
quotient is well-dened with respect to the other
predicates, and therefore will satisfy the original
formula .
17 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
References
Gdel, K (1929). "ber die Vollstndigkeit
des Logikkalkls". Doctoral dissertation.
University Of Vienna. The rst proof of the
completeness theorem.
Gdel, K (1930). "Die Vollstndigkeit der
Axiome des logischen Funktionenkalkls".
Monatshefte fr Mathematik (in German) 37
(1): 349360. doi:10.1007/BF01696781.
JFM 56.0046.04. The same material as the
dissertation, except with briefer proofs, more
succinct explanations, and omitting the
lengthy introduction.
External links
Stanford Encyclopedia of Philosophy: "Kurt
18 of 19
07/21/2016 06:41 PM
https://en.wikipedia.org/w/inde...
Gdel (http://plato.stanford.edu/entries
/goedel/)"by Juliette Kennedy.
MacTutor biography: Kurt Gdel.
(http://www-groups.dcs.st-and.ac.uk/~history
/Mathematicians/Godel.html)
19 of 19
07/21/2016 06:41 PM