Skip to main content
1 of 2
Eric
  • 2.6k
  • 1
  • 23
  • 25

Is TA (true arithmetic) interpretable in a recursively axiomatizable theory?

Can there exist a consistent, recursively axiomatizable theory $T$, such that $\forall \phi, TA\vdash \phi \Rightarrow$ $T\vdash \tau(\phi)$, where $\tau$ is some suitable translation from the language of $TA$ to that of $T$?

Eric
  • 2.6k
  • 1
  • 23
  • 25