Hacker News new | ask | show | jobs
by ProfHewitt 2377 days ago
Gödel's proof of inferential undecidability (incompleteness) does not work in strongly typed theories because his proposition I'mUnprovable does not exist.