A theory satisfying a strong version of Tennenbaum's theorem

Autor:	Lutz, Patrick, Walsh, James
Rok vydání:	2023
Předmět:	Mathematics - Logic
Druh dokumentu:	Working Paper
Popis:	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. Comment: 21 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2309.11598 Zobrazit plný text záznamu View this record from Arxiv