incompleteness theorem states that for any ω-consistent recursive
axiomatic system powerful enough to describe the arithmetic of the
natural numbers (for example, Peano arithmetic), there are true
propositions about the natural numbers that can be neither proved nor
disproved from the

Reply via email to