Geodesic
On spectra of computable models
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 4, pp. 93-97 
E. B. Fokina. On spectra of computable models. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 4, pp. 93-97. http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a5/
@article{VNGU_2006_6_4_a5,
     author = {E. B. Fokina},
     title = {On spectra of computable models},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {93--97},
     year = {2006},
     volume = {6},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a5/}
}
TY  - JOUR
AU  - E. B. Fokina
TI  - On spectra of computable models
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2006
SP  - 93
EP  - 97
VL  - 6
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a5/
LA  - ru
ID  - VNGU_2006_6_4_a5
ER  - 
%0 Journal Article
%A E. B. Fokina
%T On spectra of computable models
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2006
%P 93-97
%V 6
%N 4
%U http://geodesic.mathdoc.fr/item/VNGU_2006_6_4_a5/
%G ru
%F VNGU_2006_6_4_a5

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

For every $n\in N$ we construct an example of theory with countably many countable models, such that its isomorphism type is defined by two dimensions. If we fix the second dimension, the first dimension gives the spectrum $\{1,\dots,n\}$. If we fix the first one then all models with this dimension are computable or are not computable simultaneously.

[1] Goncharov S. S., “Konstruktivnye modeli $\omega_1$-kategorichnykh teorii”, Matematicheskie zametki, 23 (1978), 885–888 | MR | Zbl

[2] Kudaibergenov K. Z., “O konstruktivnykh modelyakh nerazreshimykh teorii”, Sib. mat. zhurn., 21:5 (1980), 155–158 | MR | Zbl

[3] Khisamiev N. G., “Silno konstruktivnye modeli razreshimoi teorii”, Izv. Akad. nauk Kazakh. SSR. Ser. fiz.-mat., 35:1 (1974), 83–84 | MR

[4] Baldwin J., Lachlan A., “On strongly minimal sets”, J. symbol. log., 36 (1971), 79–96 | DOI | MR | Zbl

[5] Harrington L., “Recursively presentable prime models”, J. symbol. log., 39 (1974), 305–309 | DOI | MR | Zbl

[6] Hirschfeldt D. R., Khoussainov B., Semukhin P., “An uncountably categorical theory whose only computably presentable model is saturated”, Notre Dame J. form. log., 47:1 (2006), 63–71 | DOI | MR | Zbl

[7] Khoussainov B., Nies A., Shore R., “On recursive models of theories”, Notre Dame J. form. log., 38:2 (1997), 165–178 | DOI | MR | Zbl

[8] Nies A., “A new spectrum of recursive models”, Notre Dame J. form. log., 40 (1999), 307–314 | DOI | MR | Zbl