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

No,

An consistent theorem system can know no bounds. There's halfway. If Peano arithmetic is inconsistent every statement in it is provably true and false. QED.



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

Search: