a proof that a logic system that is at least as powerful as an arithmetic rule is possible to deduct theorems from that are proved neither true nor false.
a proof that a logic system that is at least as powerful as an arithmetic rule is possible to deduct theorems from that are proved neither true nor false.