A Computable Structure with Non-Standard Computability
R. R. Avdeev, V. G. Puzarenko · Siberian Advances in Mathematics · 2019
We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.