A theory satisfying a strong version of Tennenbaum's theorem
Lutz, Patrick, James Walsh · arXiv (Cornell University) · 2023
We answer a question of Pakhomov by showing that there is a consistent, c.e. theory $T$ such that no theory which is definitionally equivalent to $T$ has a computable model. A key tool in our proof is the model-theoretic notion of mutual algebraicity.