Fedor Pakhomov, Ghent University
How to escape Tennenbaum's theorem
We construct a theory definitionally equivalent to first-order Peano arithmetic PA and a non-standard computable model of this theory. The same technique allows us to construct a theory definitionally equivalent to Zermelo-Fraenkel set theory ZF that has a computable model. See my preprint https://arxiv.org/abs/2209.00967 for more details.