A theory satisfying a strong version of Tennenbaum's theorem
arXiv:2309.11598
Abstract
We answer a question of Pakhomov by showing that there is a consistent, c.e. theory such that no theory which is definitionally equivalent to has a computable model. A key tool in our proof is the model-theoretic notion of mutual algebraicity.
21 pages