Hacker News new | past | comments | ask | show | jobs | submit login

Contrary to popular opinion, [Gödel 1931] did not actually prove inferential undecidability (sometimes called "inferential incompleteness") of Russell's Principia Mathematica for the reasons explained here:

https://papers.ssrn.com/abstract=3603021

The article linked above gives a correct proof of inferential incompleteness.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: