We say that a theory T satisfies arithmetic-is-recursive if any X '-computable model of T has an X-computable copy; that is, the models of T satisfy a sort of jump inversion. We give an example of a theory satisfying arithmetic-is-recursive non-trivially and prove that the theories satisfying arithmetic-is-recursive on a cone are exactly those theories with countably many omega-back-and-forth types.
展开▼
