Voir la notice de l'article provenant de la source Math-Net.Ru
@article{AL_2019_58_3_a8, author = {S. S. Goncharov and R. Miller and V. Harizanov}, title = {Turing degrees of complete formulas of almost prime models}, journal = {Algebra i logika}, pages = {417--425}, publisher = {mathdoc}, volume = {58}, number = {3}, year = {2019}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/AL_2019_58_3_a8/} }
S. S. Goncharov; R. Miller; V. Harizanov. Turing degrees of complete formulas of almost prime models. Algebra i logika, Tome 58 (2019) no. 3, pp. 417-425. http://geodesic.mathdoc.fr/item/AL_2019_58_3_a8/
[1] S. S. Goncharov, Yu. L. Ershov, Konstruktivnye modeli, Sibirskaya shkola algebry i logiki, Nauchnaya kniga, Novosibirsk, 1999 | MR
[2] A. I. Maltsev, “O rekursivnykh abelevykh gruppakh”, Dokl. AN SSSR, 146:5 (1962), 1009–1012 | Zbl
[3] A. I. Maltsev, “Konstruktivnye algebry, 1”, UMN, 16:3 (1961), 3–60 | MR | Zbl
[4] G. Keisler, Ch. Chen, Teoriya modelei, Mir, M., 1977
[5] Kh. Rodzhers, Teoriya rekursivnykh funktsii i effektivnaya vychislimost, Mir, M., 1972
[6] S. Goncharov, B. Khoussainov, “Open problems in the theory of constructive algebraic systems”, Computability theory and its applications. Current trends and open problems, Proc. 1999 AMS-IMS-SIAM joint summer research conf. (Boulder, CO, USA, June 13–17, 1999), Contemp. Math., 257, eds. P. A. Cholak et al., Am. Math. Soc., Providence, RI, 2000, 145–170 | DOI | MR | Zbl
[7] A. T. Nurtazin, “Silnye i slabye konstruktivizatsii i vychislimye semeistva”, Algebra i logika, 13:3 (1974), 311–323 | MR | Zbl
[8] S. S. Goncharov, “Problema chisla neavtoekvivalentnykh konstruktivizatsii”, Dokl. AN SSSR, 251:2 (1980), 271–274 | MR | Zbl
[9] S. S. Goncharov, “Problema chisla neavtoekvivalentnykh konstruktivizatsii”, Algebra i logika, 19:6 (1980), 621–639 | MR
[10] S. S. Goncharov, “Gruppy s konechnym chislom konstruktivizatsii”, Dokl. AN SSSR, 256:2 (1981), 269–272 | MR | Zbl
[11] S. S. Goncharov, A. V. Molokov, N. S. Romanovskii, “Nilpotentnye gruppy konechnoi algoritmicheskoi razmernosti”, Sib. matem. zh., 30:1 (1989), 82–88 | MR
[12] S. S. Goncharov, “Vychislimye odnoznachnye numeratsii”, Algebra i logika, 19:5 (1980), 507–551 | MR
[13] E. B. Fokina, I. Kalimullin, R. Miller, “Degrees of categoricity of computable structures”, Arch. Math. Logic, 49:1 (2010), 51–67 | DOI | MR | Zbl
[14] B. F. Csima, J. N. Y. Franklin, R. A. Shore, “Degrees of categoricity and the hyperarithmetic hierarchy”, Notre Dame J. Form. Log., 54:2 (2013), 215–231 | DOI | MR | Zbl
[15] N. A. Bazhenov, “Stepeni kategorichnosti superatomnykh bulevykh algebr”, Algebra i logika, 52:3 (2013), 271–283 | MR | Zbl
[16] B. Anderson, B. Csima, “Degrees that are not degrees of categoricity”, Notre Dame J. Form. Log., 57:3 (2016), 389–398 | MR | Zbl
[17] E. Fokina, A. Frolov, I. Kalimullin, “Categoricity spectra for rigid structures”, Notre Dame J. Form. Log., 57:1 (2016), 45–57 | DOI | MR | Zbl
[18] R. Miller, “$\mathbf{d}$-computable categoricity for algebraic fields”, J. Symb. Log., 74:4 (2009), 1325–1351 | DOI | MR | Zbl
[19] E. B. Fokina, V. Harizanov, A. Melnikov, “Computable model theory”, Turing's Legacy: Developments from Turing's ideas in logic, Lect. Notes Log., 42, ed. R. Downey, Cambridge Univ. Press, Assoc. Symbol. Logic, Cambridge, 2014, 124–194 | MR
[20] N. A. Bazhenov, “Spektry avtoustoichivosti bulevykh algebr”, Algebra i logika, 53:6 (2014), 764–769 | MR
[21] S. S. Goncharov, “Stepeni avtoustoichivosti otnositelno silnykh konstruktivizatsii”, Algoritmicheskie voprosy algebry i logiki, K 80-letiyu so dnya rozhd. akad. S. I. Adyana, Tr. MIAN, 274, MAIK, M., 2011, 119–129
[22] E. A. Palyutin, “Ob algebrakh formul schetno kategorichnykh teorii”, Colloq. Math., 31:2 (1974), 157–159 | DOI | MR | Zbl
[23] J. H. Schmerl, “A decidable $\aleph_{0}$-categorical theory with a non-recursive Ryll-Nardzewski function”, Fundam. Math., 98:2 (1978), 121–125 | DOI | MR | Zbl
[24] N. Bazhenov, “Prime model with no degree of autostability relative to strong constructivizations”, Evolving computability, 11th conf. comput. Europe, CiE 2015 (Bucharest, Romania, June 29–July 3, 2015), Lect. Notes Comput. Sci., 9136, eds. A. Beckmann et al., Springer-Verlag, Berlin, 2015, 117–126 | DOI | MR | Zbl
[25] S. S. Goncharov, “Ob avtoustoichivosti otnositelno silnykh konstruktivizatsii pochti prostykh modelei”, UMN, 65:5 (395) (2010), 107–142 | DOI | MR | Zbl
[26] M. Morley, “Decidable models”, Israel J. Math., 25:3/4 (1976), 233–240 | DOI | MR | Zbl
[27] R. Miller, “Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey”, Computability and complexity, Essays ded. R. G. Downey on the occasion of his 60th birthday, Lect. Notes Comput. Sci., 10010, eds. A. Day et al., Springer, Cham, 2017, 254–270 | DOI | MR | Zbl