Skip to main content
added 9 characters in body
Source Link
Peter Smith
  • 1.6k
  • 11
  • 19

What about the textbook general version of the original Gödel incompleteness theorem: if $T$ is recursively axiomatized, sufficiently strong, and $\omega$-consistent, it is incomplete (where sufficient strength means representing every recursive function)?

What about the textbook general version of the Gödel incompleteness theorem: if $T$ is recursively axiomatized, sufficiently strong, and $\omega$-consistent, it is incomplete (where sufficient strength means representing every recursive function)?

What about the textbook general version of the original Gödel incompleteness theorem: if $T$ is recursively axiomatized, sufficiently strong, and $\omega$-consistent, it is incomplete (where sufficient strength means representing every recursive function)?

Post Made Community Wiki
Source Link
Peter Smith
  • 1.6k
  • 11
  • 19

What about the textbook general version of the Gödel incompleteness theorem: if $T$ is recursively axiomatized, sufficiently strong, and $\omega$-consistent, it is incomplete (where sufficient strength means representing every recursive function)?