Re:1931: Kurt Gödel shows limits of math, logic, computing, AI
by ProfHewitt on Saturday June 19, 2021 @01:58PM
(#27562714)
[Gödel 1931] was for a system for the foundations of
mathematics with orders on propositions.
The [Gödel 1931] proposition I'mUnprovable is certainly of
historical interest and may perhaps be of philosophical
interest.
However, including the proposition I'mUnprovable in
foundations makes the foundations inconsistent.
His claim is that the proposition "This proposition is not provable", formalized as "P equivalent to P is not provable" is not well formed in a typed logic, as "P"'s type is first-order, while "P is not provable"'s type is second-order. Therefore, his claim is that the proposition is simply not well-typed and therefore not interesting. Godel's proofs were discussing an untyped logic, but according to Hewitt that is not an accurate representation of mathematics.
I don't think anyone in the space agrees with him, though, as far as I could tell from some cursory reading.