Any theory that can represent all recursive functions has no consistent decidable extension, however there are such theories that do not interpret even as weak an arithmetic as Robinson’s theory $R$. See these slides for a bit more details. (A paper is coming soon, hopefully.)
Emil Jeřábek
- 47.1k
- 4
- 147
- 208