Geodesic
A~computable structure with non-standard computability
Matematičeskie trudy, Tome 21 (2018) no. 2, pp. 3-60

Voir la notice de l'article provenant de la source Math-Net.Ru

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$ model of an undecidable submodel complete theory. 
@article{MT_2018_21_2_a0,
     author = {R. R. Avdeev and V. G. Puzarenko},
     title = {A~computable structure with non-standard computability},
     journal = {Matemati\v{c}eskie trudy},
     pages = {3--60},
     publisher = {mathdoc},
     volume = {21},
     number = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MT_2018_21_2_a0/}
}
TY  - JOUR
AU  - R. R. Avdeev
AU  - V. G. Puzarenko
TI  - A~computable structure with non-standard computability
JO  - Matematičeskie trudy
PY  - 2018
SP  - 3
EP  - 60
VL  - 21
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MT_2018_21_2_a0/
LA  - ru
ID  - MT_2018_21_2_a0
ER  - 
%0 Journal Article
%A R. R. Avdeev
%A V. G. Puzarenko
%T A~computable structure with non-standard computability
%J Matematičeskie trudy
%D 2018
%P 3-60
%V 21
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MT_2018_21_2_a0/
%G ru
%F MT_2018_21_2_a0
R. R. Avdeev; V. G. Puzarenko. A~computable structure with non-standard computability. Matematičeskie trudy, Tome 21 (2018) no. 2, pp. 3-60. http://geodesic.mathdoc.fr/item/MT_2018_21_2_a0/