Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

In consistent systems, false theorems are always unprovable.

So it's only interesting when unprovable theorems are true.

(If you're looking for a false theorem that isn't disprovable, simply negate an unprovable true theorem.)



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

Search: