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$?
Is TA (true arithmetic) interpretable in a recursively axiomatizable theory?
Eric
- 2.6k
- 1
- 23
- 25