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.
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.