Cansomeone please explain Godel's incompleteness theorem?

  • Context: Graduate 
  • Thread starter Thread starter Simfish
  • Start date Start date
  • Tags Tags
    Explain Theorem
Click For Summary
SUMMARY

Gödel's Incompleteness Theorem establishes a fundamental distinction between "true" statements and "provable" statements within formal systems. Specifically, any system capable of defining the integers and performing operations like addition and multiplication will contain true statements that cannot be proven within that system, rendering it "incomplete." This theorem serves to highlight the limitations of formal mathematical systems, particularly in the context of theories such as the first-order theory of real closed fields, where tools like mathematical induction can lead to incompleteness.

PREREQUISITES
  • Understanding of formal mathematical systems
  • Familiarity with first-order logic
  • Knowledge of number theory, particularly integers
  • Basic concepts of mathematical induction
NEXT STEPS
  • Explore Gödel's Incompleteness Theorem in detail
  • Study the implications of incompleteness in formal systems
  • Investigate the first-order theory of real closed fields
  • Learn about mathematical induction and its limitations in completeness
USEFUL FOR

Mathematicians, logicians, and students of formal systems who seek to understand the limitations of provability and truth in mathematical theories.

Simfish
Gold Member
Messages
811
Reaction score
2
I see so many references to it. Can someone please explain what it exactly is and what it's useful for?
 
Physics news on Phys.org
i only know what i read in the funny papers, but as i recall, it makes a distinction between statements that are "true", and statements that are "provable" in a given system, i.e. logically derivable in a finite number of steps via allowable rules of reasoning from given axioms and prior proved results.

then it throws a spear through our hopes that "true" and "provable" are the same thing, except in rather small systems. i.e. as i recall, any system sophisticated enough to allow a definition of the real numbers, will have some true statements that are not provable. hence such a system is "incomplete".

so it seems you can perhaps do some arithmetic in a complete system, but not calculus.

but there are many more knowledgeable people than me here, and they will surely improve or correct these naive comments.

in my professional life it has not been useful for anything except to keep mathematicians humble. i.e. no mathematically interesting statements have ever been found to my knowledge that actually were unprovable.
 
any system sophisticated enough to allow a definition of the real numbers, will have some true statements that are not provable

Actually, it's integers. More specifically, it has to be able to describe addition and multiplication of integers.




One use of the incompleteness theorem is *drumroll* to prove a theory incomplete; or to give a greater understanding of what it means for a theory to be complete.

For example, one might want to consider the first-order theory of real closed fields. (The first-order version of the theory of real numbers) One might ask "what additional tools may I use to study this theory, but allow it to remain complete?" Godel's incompleteness theorem proves that mathematical induction is not one such tool; we can use mathematical induction to define the word "integer", thus getting number theory, then use Godel to prove the resulting theory incomplete.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
748
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 73 ·
3
Replies
73
Views
10K
  • · Replies 131 ·
5
Replies
131
Views
13K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 18 ·
Replies
18
Views
4K