It is not the case that Gödel's incompleteness theorems demonstrate that arithmetical truth outruns provability in any consistent formal system, as shown by the truth of the Gödel sentence.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.