You are on page 1of 66

Gödel’s First

Incompleteness
Do mathematical theorems like Gödel’s Theorem
Introduction

show that computers are intrinsically Discussion

Gödel’s Second
limited? Incompleteness
Theorem
Introduction
Discussion

Bas van Gijzel Answer to the


question
More questions

May 17, 2010

1
Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Slides and talk in English. Incompleteness
Theorem
Introduction
Discussion

Answer to the
question
More questions

2
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

3
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

4
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

5
Not one but two

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Not Gödel’s incompleteness theorem but Gödel’s Introduction

incompleteness theorems! Discussion

Answer to the
question
More questions

6
First incompleteness theorem

Gödel’s First
Incompleteness
Theorem
The first incompleteness theorem (Gödel-Rosser). Introduction
Discussion

Any consistent formal system S within which a Gödel’s Second


Incompleteness
certain amount of elementary arithmetic can be Theorem
Introduction
carried out is incomplete with regard to Discussion

statements of elementary arithmetic: there are Answer to the


question
such statements which can neither be proved, nor More questions

disproved in S .

7
Important concepts

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I Elementary arithmetic Gödel’s Second
Incompleteness
I Formal system Theorem
Introduction
I Proved/disproved Discussion

Answer to the
I Consistency of a formal system question
More questions
I Completeness

8
Crash course in logic concepts

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Introduction
Discussion

Answer to the
question
More questions

9
Formal system

Gödel’s First
Incompleteness
Theorem
I Formal system: axioms, inference rules. Introduction
Discussion

I Propositional logic: Gödel’s Second


Incompleteness
I Axioms: Theorem

φ → (ψ → φ)
Introduction
• Discussion

• (φ → (ψ → χ)) → ((φ → ψ) → (φ → χ)) Answer to the


question
• (¬φ → ¬ψ) → (ψ → φ) More questions

I Inference rule(s):
• Modus ponens: φ → ψ, φ ` ψ

10
Formal system

Gödel’s First
Incompleteness
Theorem
I Formal system: axioms, inference rules. Introduction
Discussion

I Propositional logic: Gödel’s Second


Incompleteness
I Axioms: Theorem

φ → (ψ → φ)
Introduction
• Discussion

• (φ → (ψ → χ)) → ((φ → ψ) → (φ → χ)) Answer to the


question
• (¬φ → ¬ψ) → (ψ → φ) More questions

I Inference rule(s):
• Modus ponens: φ → ψ, φ ` ψ

10
Formal system

Gödel’s First
Incompleteness
Theorem
I Formal system: axioms, inference rules. Introduction
Discussion

I Propositional logic: Gödel’s Second


Incompleteness
I Axioms: Theorem

φ → (ψ → φ)
Introduction
• Discussion

• (φ → (ψ → χ)) → ((φ → ψ) → (φ → χ)) Answer to the


question
• (¬φ → ¬ψ) → (ψ → φ) More questions

I Inference rule(s):
• Modus ponens: φ → ψ, φ ` ψ

10
Elementary arithmetic

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
Intuitively at least the following:
Gödel’s Second
I Natural numbers: 0, 1, 2, . . . . Incompleteness
Theorem
• Using 0 and a successor function S . Introduction
Discussion

I Addition and multiplication. Answer to the


question
I Induction principle. More questions

11
Elementary arithmetic

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
Intuitively at least the following:
Gödel’s Second
I Natural numbers: 0, 1, 2, . . . . Incompleteness
Theorem
• Using 0 and a successor function S . Introduction
Discussion

I Addition and multiplication. Answer to the


question
I Induction principle. More questions

11
Elementary arithmetic

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
Intuitively at least the following:
Gödel’s Second
I Natural numbers: 0, 1, 2, . . . . Incompleteness
Theorem
• Using 0 and a successor function S . Introduction
Discussion

I Addition and multiplication. Answer to the


question
I Induction principle. More questions

11
Elementary arithmetic

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
Intuitively at least the following:
Gödel’s Second
I Natural numbers: 0, 1, 2, . . . . Incompleteness
Theorem
• Using 0 and a successor function S . Introduction
Discussion

I Addition and multiplication. Answer to the


question
I Induction principle. More questions

11
Statements of a system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
I A statement is a logical formula, for instance p ∨ ¬p. Theorem
Introduction

I A statement φ that is provable in S , is denoted as S ` φ. Discussion

Answer to the
question
More questions

12
Statements of a system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
I A statement is a logical formula, for instance p ∨ ¬p. Theorem
Introduction

I A statement φ that is provable in S , is denoted as S ` φ. Discussion

Answer to the
question
More questions

12
Consistency of a formal system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I Intuitively: a system does not derive nonsense. Gödel’s Second
Incompleteness
I A system S is consistent iff S 0 ⊥. Theorem
Introduction

I Or, a system cannot simultaneously derive S ` φ and Discussion

S ` ¬φ Answer to the
question
More questions
I More to be said in the discussion. . .

13
Consistency of a formal system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I Intuitively: a system does not derive nonsense. Gödel’s Second
Incompleteness
I A system S is consistent iff S 0 ⊥. Theorem
Introduction

I Or, a system cannot simultaneously derive S ` φ and Discussion

S ` ¬φ Answer to the
question
More questions
I More to be said in the discussion. . .

13
Consistency of a formal system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I Intuitively: a system does not derive nonsense. Gödel’s Second
Incompleteness
I A system S is consistent iff S 0 ⊥. Theorem
Introduction

I Or, a system cannot simultaneously derive S ` φ and Discussion

S ` ¬φ Answer to the
question
More questions
I More to be said in the discussion. . .

13
Consistency of a formal system

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I Intuitively: a system does not derive nonsense. Gödel’s Second
Incompleteness
I A system S is consistent iff S 0 ⊥. Theorem
Introduction

I Or, a system cannot simultaneously derive S ` φ and Discussion

S ` ¬φ Answer to the
question
More questions
I More to be said in the discussion. . .

13
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
I Intuitively: All statements are either true or untrue and Introduction

can be proved so. Discussion

Gödel’s Second
I Very strong property! Incompleteness
Theorem
Introduction
I System T is complete iff for every sentence φ : T ` φ or Discussion

T ` ¬φ. Answer to the


question
I Not: every true formula can be proved. More questions

(Completeness of FOL)
I Maximal consistent

14
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
I Intuitively: All statements are either true or untrue and Introduction

can be proved so. Discussion

Gödel’s Second
I Very strong property! Incompleteness
Theorem
Introduction
I System T is complete iff for every sentence φ : T ` φ or Discussion

T ` ¬φ. Answer to the


question
I Not: every true formula can be proved. More questions

(Completeness of FOL)
I Maximal consistent

14
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
I Intuitively: All statements are either true or untrue and Introduction

can be proved so. Discussion

Gödel’s Second
I Very strong property! Incompleteness
Theorem
Introduction
I System T is complete iff for every sentence φ : T ` φ or Discussion

T ` ¬φ. Answer to the


question
I Not: every true formula can be proved. More questions

(Completeness of FOL)
I Maximal consistent

14
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
I Intuitively: All statements are either true or untrue and Introduction

can be proved so. Discussion

Gödel’s Second
I Very strong property! Incompleteness
Theorem
Introduction
I System T is complete iff for every sentence φ : T ` φ or Discussion

T ` ¬φ. Answer to the


question
I Not: every true formula can be proved. More questions

(Completeness of FOL)
I Maximal consistent

14
Incompleteness

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I System does not have good enough inference rules. Gödel’s Second
Incompleteness
I There is a sentence for T , φ, for which T 0 φ and T 0 ¬φ. Theorem
Introduction

I Derivation is undecidable. Discussion

Answer to the
I Or: sentences of the system are not recursively question
More questions
enumerable.

15
Incompleteness

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I System does not have good enough inference rules. Gödel’s Second
Incompleteness
I There is a sentence for T , φ, for which T 0 φ and T 0 ¬φ. Theorem
Introduction

I Derivation is undecidable. Discussion

Answer to the
I Or: sentences of the system are not recursively question
More questions
enumerable.

15
Incompleteness

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I System does not have good enough inference rules. Gödel’s Second
Incompleteness
I There is a sentence for T , φ, for which T 0 φ and T 0 ¬φ. Theorem
Introduction

I Derivation is undecidable. Discussion

Answer to the
I Or: sentences of the system are not recursively question
More questions
enumerable.

15
Incompleteness

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
I System does not have good enough inference rules. Gödel’s Second
Incompleteness
I There is a sentence for T , φ, for which T 0 φ and T 0 ¬φ. Theorem
Introduction

I Derivation is undecidable. Discussion

Answer to the
I Or: sentences of the system are not recursively question
More questions
enumerable.

15
End of crash course

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Introduction
Discussion

Answer to the
question
More questions

16
First incompleteness theorem (again)

Gödel’s First
Incompleteness
Theorem
The first incompleteness theorem (Gödel-Rosser). Introduction
Discussion

Any consistent formal system S within which a Gödel’s Second


Incompleteness
certain amount of elementary arithmetic can be Theorem
Introduction
carried out is incomplete with regard to Discussion

statements of elementary arithmetic: there are Answer to the


question
such statements which can neither be proved, nor More questions

disproved in S .

17
Summary

Gödel’s First
Incompleteness
Theorem
Introduction
So what does Gödel’s first Incompleteness Theorem say? Discussion

Gödel’s Second
I About axiomatised formal theories of arithmetic. Incompleteness
Theorem
I In short, arithmetical truth isn’t provability in some Introduction
Discussion
single axiomatisable system.
Answer to the
I If T is consistent: ∃GT : T 0 GT and T 0 ¬GT . question
More questions

I But it also holds that: ConT → GT .

18
Summary

Gödel’s First
Incompleteness
Theorem
Introduction
So what does Gödel’s first Incompleteness Theorem say? Discussion

Gödel’s Second
I About axiomatised formal theories of arithmetic. Incompleteness
Theorem
I In short, arithmetical truth isn’t provability in some Introduction
Discussion
single axiomatisable system.
Answer to the
I If T is consistent: ∃GT : T 0 GT and T 0 ¬GT . question
More questions

I But it also holds that: ConT → GT .

18
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

19
Possible questions (1)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Are there unprovable truths? Introduction
Discussion

Answer to the
question
More questions

20
Possible questions (1)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Are there unprovable truths? Theorem
Introduction
Discussion

Answer to the
I S 0 A? S ∪ A ` A! question
More questions

21
Possible questions (2)

Lucas argument:
Gödel’s First
Gödel’s theorem states that in any consistent Incompleteness
Theorem
system which is strong enough to produce simple Introduction
Discussion
arithmetic there are formulas which cannot be Gödel’s Second
proved in the system, but which we can see to be Incompleteness
Theorem
true. Introduction
Discussion

Answer to the
question
More questions
I We have to prove consistency for that system!
I Humans cannot prove formal systems consistent in
general.
I “Going out of the system” is not possible in general.
(Goldbach’s conjecture)

22
Possible questions (2)

Lucas argument:
Gödel’s First
Gödel’s theorem states that in any consistent Incompleteness
Theorem
system which is strong enough to produce simple Introduction
Discussion
arithmetic there are formulas which cannot be Gödel’s Second
proved in the system, but which we can see to be Incompleteness
Theorem
true. Introduction
Discussion

Answer to the
question
More questions
I We have to prove consistency for that system!
I Humans cannot prove formal systems consistent in
general.
I “Going out of the system” is not possible in general.
(Goldbach’s conjecture)

22
Possible questions (2)

Lucas argument:
Gödel’s First
Gödel’s theorem states that in any consistent Incompleteness
Theorem
system which is strong enough to produce simple Introduction
Discussion
arithmetic there are formulas which cannot be Gödel’s Second
proved in the system, but which we can see to be Incompleteness
Theorem
true. Introduction
Discussion

Answer to the
question
More questions
I We have to prove consistency for that system!
I Humans cannot prove formal systems consistent in
general.
I “Going out of the system” is not possible in general.
(Goldbach’s conjecture)

22
Possible questions (2)

Lucas argument:
Gödel’s First
Gödel’s theorem states that in any consistent Incompleteness
Theorem
system which is strong enough to produce simple Introduction
Discussion
arithmetic there are formulas which cannot be Gödel’s Second
proved in the system, but which we can see to be Incompleteness
Theorem
true. Introduction
Discussion

Answer to the
question
More questions
I We have to prove consistency for that system!
I Humans cannot prove formal systems consistent in
general.
I “Going out of the system” is not possible in general.
(Goldbach’s conjecture)

22
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
Introduction
The . . . claims to give all answers/claims to be a complete Discussion

system. By Gödel’s incompleteness theorems this cannot be Gödel’s Second


Incompleteness
true! Theorem
Introduction
Discussion
I bible.
Answer to the
I law. question
More questions

I system of propositional logic.

23
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
Introduction
The . . . claims to give all answers/claims to be a complete Discussion

system. By Gödel’s incompleteness theorems this cannot be Gödel’s Second


Incompleteness
true! Theorem
Introduction
Discussion
I bible.
Answer to the
I law. question
More questions

I system of propositional logic.

23
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
Introduction
The . . . claims to give all answers/claims to be a complete Discussion

system. By Gödel’s incompleteness theorems this cannot be Gödel’s Second


Incompleteness
true! Theorem
Introduction
Discussion
I bible.
Answer to the
I law. question
More questions

I system of propositional logic.

23
(Negation) completeness of a theory

Gödel’s First
Incompleteness
Theorem
Introduction
The . . . claims to give all answers/claims to be a complete Discussion

system. By Gödel’s incompleteness theorems this cannot be Gödel’s Second


Incompleteness
true! Theorem
Introduction
Discussion
I bible.
Answer to the
I law. question
More questions

I system of propositional logic.

23
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

24
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

25
Second incompleteness theorem

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion
The second incompleteness theorem (Gödel). Gödel’s Second
Incompleteness
For any consistent formal system S within which a Theorem
Introduction
certain amount of elementary arithmetic can be Discussion

carried out, the consistency of S cannot be proved Answer to the


question
in S itself. More questions

26
Amount of elementary arithmetics

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Different amount of arithmetics! Theorem
Introduction
Discussion

Answer to the
question
Gödel numbering of sentences. More questions

27
Amount of elementary arithmetics

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Different amount of arithmetics! Theorem
Introduction
Discussion

Answer to the
question
Gödel numbering of sentences. More questions

27
Summary

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

So what do Gödel’s Second Incompleteness Theorems say? Gödel’s Second


Incompleteness
I About axiomatised formal theories of arithmetic. Theorem
Introduction
Discussion
I Certain amount of arithmetic.
Answer to the
question
I Such a system cannot prove its own consistency. More questions

28
Summary

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

So what do Gödel’s Second Incompleteness Theorems say? Gödel’s Second


Incompleteness
I About axiomatised formal theories of arithmetic. Theorem
Introduction
Discussion
I Certain amount of arithmetic.
Answer to the
question
I Such a system cannot prove its own consistency. More questions

28
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

29
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

30
What we can claim

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
I Arithmetical truth isn’t provability in some single Incompleteness
Theorem
axiomatisable system. Introduction
Discussion
I No super foundation of mathematics that is complete.
Answer to the
(Principia Mathematica) question
More questions

31
What we can claim

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
I Arithmetical truth isn’t provability in some single Incompleteness
Theorem
axiomatisable system. Introduction
Discussion
I No super foundation of mathematics that is complete.
Answer to the
(Principia Mathematica) question
More questions

31
What we should not claim

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
I By Gödel’s theorems I hereby pronounce. . . Incompleteness
Theorem
• machines less powerful than humans. Introduction

• formal systems useless. Discussion

Answer to the
• logic as an attempt to formalise AI useless. question
More questions

32
Do mathematical theorems like Gödel’s show
that computers are intrinsically limited?
Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Do mathematical theorems like Gödel’s show that Introduction
Discussion

computers are intrinsically limited? Answer to the


question
More questions

33
Do mathematical theorems like Gödel’s show
that computers are intrinsically limited?
Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

Gödel’s Second
Incompleteness
Theorem
Do mathematical theorems like Gödel’s show that Introduction
Discussion

computers are intrinsically limited? Answer to the


question
More questions

No!

34
Outline

Gödel’s First
Gödel’s First Incompleteness Theorem Incompleteness
Theorem
Introduction Introduction
Discussion
Discussion
Gödel’s Second
Incompleteness
Theorem
Introduction
Gödel’s Second Incompleteness Theorem Discussion

Introduction Answer to the


question
Discussion More questions

Answer to the question


More questions

35
What we can ask(1)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I Are humans formal systems? Gödel’s Second


Incompleteness
Theorem
I Are humans “complete”? Introduction
Discussion
I Do we even care? Answer to the
question
I An infinitude of human formal systems? More questions

36
What we can ask(1)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I Are humans formal systems? Gödel’s Second


Incompleteness
Theorem
I Are humans “complete”? Introduction
Discussion
I Do we even care? Answer to the
question
I An infinitude of human formal systems? More questions

36
What we can ask(1)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I Are humans formal systems? Gödel’s Second


Incompleteness
Theorem
I Are humans “complete”? Introduction
Discussion
I Do we even care? Answer to the
question
I An infinitude of human formal systems? More questions

36
What we can ask(2)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I What can humans effectively calculate? Gödel’s Second


Incompleteness
Theorem
I Related: Church-Turing thesis and its variants. Introduction
Discussion
I Are mathematics useful if they have so little practical Answer to the
question
consequences? More questions

37
What we can ask(2)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I What can humans effectively calculate? Gödel’s Second


Incompleteness
Theorem
I Related: Church-Turing thesis and its variants. Introduction
Discussion
I Are mathematics useful if they have so little practical Answer to the
question
consequences? More questions

37
What we can ask(2)

Gödel’s First
Incompleteness
Theorem
Introduction
Discussion

I What can humans effectively calculate? Gödel’s Second


Incompleteness
Theorem
I Related: Church-Turing thesis and its variants. Introduction
Discussion
I Are mathematics useful if they have so little practical Answer to the
question
consequences? More questions

37

You might also like