https://hackerpaper.kaipfister.de/p/2406.05442/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=45088710urn:hackerpapers:mention:2406.05442:45088710Mon, 01 Sep 2025 01:50:21 GMT<p>&gt; What Godel actually proved is that given a consistent formal system capable of representing arithmetic, there are statements in the language of that system such that neither the statement nor its negation can be proved in the system. It goes what step further, there are statements that are true but can not be proved. &gt; Godel&#x27;s theorems are notoriously liable to misinterpretation, and to be honest this sounds like one. What do you think was Godel&#x27;s philosophical motivation for investigating incompleteness? &quot;Many philosophers and logicians have explored the significance of these theorems.…</p><p><a href="https://hackerpaper.kaipfister.de/p/2406.05442/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.HO