Cansomeone please explain Godel's incompleteness theorem?

  • Thread starter Thread starter Simfish
  • Start date Start date
  • Tags Tags
    Explain Theorem
AI Thread Summary
Gödel's incompleteness theorem distinguishes between "true" statements and "provable" statements within mathematical systems, revealing that in sufficiently complex systems, such as those that can define real numbers, there exist true statements that cannot be proven. This implies that such systems are inherently "incomplete." While the theorem has not led to the discovery of unprovable mathematical statements, it serves to keep mathematicians humble and provides insights into the limitations of formal theories. One practical application of the theorem is in analyzing the completeness of mathematical theories, such as the first-order theory of real closed fields, where it shows that certain tools, like mathematical induction, can lead to incompleteness. Overall, Gödel's theorem emphasizes the complexities and boundaries of mathematical logic.
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.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top