What Do Gödel's Incompleteness Theorems Mean?
quantamagazine.org
What Do Gödel's Incompleteness Theorems Mean?
1–10 of 72 posts
Re: What Do Gödel's Incompleteness Theorems Mean?
#2e.g. that Godel didn't think this scrapped Hilbert's project totally:
>Gödel believed that it was possible to redefine what we mean by a formal mathematical framework, or allow for alternative frameworks. He often discussed an infinite sequence of acceptable logical systems, each more powerful than the last. Every well-formulated mathematical question might be answerable within one of them.
Re: What Do Gödel's Incompleteness Theorems Mean?
#3Interesting points in here. e.g. that Godel didn't think this scrapped Hilbert's project totally: >Gödel believed that it was possible to redefine what we mean by a formal mathematical framework, or allow for alternative frameworks. He often discussed an infinite sequence of acceptable logical systems, each more powerful than the last. Every well-formulated mathematical question might be answerable within one of them…
Overall I really enjoyed this article, short interviews with mathematicians and philosophers on a topic I've often thought about.
Re: What Do Gödel's Incompleteness Theorems Mean?
#4Re: What Do Gödel's Incompleteness Theorems Mean?
#5Re: What Do Gödel's Incompleteness Theorems Mean?
#6There is usually a 'not sufficiently complex' clause in that definition. Presburger arithmetic is complete: https://en.wikipedia.org/wiki/Presburger_arithmetic
Re: What Do Gödel's Incompleteness Theorems Mean?
#7Re: What Do Gödel's Incompleteness Theorems Mean?
#8> “incompleteness theorems” established that no formal system of mathematics — no finite set of rules, or axioms, from which everything is supposed to follow — can ever be complete.' There is usually a 'not sufficiently complex' clause in that definition. Presburger arithmetic is complete: https://en.wikipedia.org/wiki/Presburger_arithmetic
Hilbert's incidence geometry, for instance, is consistent and complete. It's just rather small.
Re: What Do Gödel's Incompleteness Theorems Mean?
#9Of all the incompleteness-style theorems, I find the Halting problem to be the most approachable and also the most interesting. Maybe it's because I'm a software dev that dabbles in math rather than the other way around. But that makes me wonder if all of Gödel's theorems can be stated if 'software form', so to speak.
Gödel's argument basically says that any system of mathematics powerful enough to implement basic arithmetic is a computer. This shouldn't be surprising to software engineers because the equivalency between Boolean logic and arithmetic is easy to show. And if you have a computer, you can build algorithms whose outcome can't be programmatically decided by other algorithms.