A theory satisfying a strong version of Tennenbaum's theorem
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.