Geodesic
Categoricity and complexity of relations over algebraic structures
Algebra i logika, Tome 54 (2015) no. 5, pp. 628-637.

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

Presented by the Program Committee of the Conference “Mal'tsev Readings”. 
@article{AL_2015_54_5_a4,
     author = {J. A. Tussupov},
     title = {Categoricity and complexity of relations over algebraic structures},
     journal = {Algebra i logika},
     pages = {628--637},
     publisher = {mathdoc},
     volume = {54},
     number = {5},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2015_54_5_a4/}
}
TY  - JOUR
AU  - J. A. Tussupov
TI  - Categoricity and complexity of relations over algebraic structures
JO  - Algebra i logika
PY  - 2015
SP  - 628
EP  - 637
VL  - 54
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2015_54_5_a4/
LA  - ru
ID  - AL_2015_54_5_a4
ER  - 
%0 Journal Article
%A J. A. Tussupov
%T Categoricity and complexity of relations over algebraic structures
%J Algebra i logika
%D 2015
%P 628-637
%V 54
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2015_54_5_a4/
%G ru
%F AL_2015_54_5_a4
J. A. Tussupov. Categoricity and complexity of relations over algebraic structures. Algebra i logika, Tome 54 (2015) no. 5, pp. 628-637. http://geodesic.mathdoc.fr/item/AL_2015_54_5_a4/

[1] S. S. Goncharov, “Avtoustoichivost i vychislimye semeistva konstruktivizatsii”, Algebra i logika, 14:6 (1975), 647–680 | MR | Zbl

[2] C. J. Ash, “Categoricity in hyperarithmetical degrees”, Ann. Pure Appl. Logic, 34:1 (1987), 1–14 | DOI | MR | Zbl

[3] M. S. Manasse, Techniques and counterexamples in almost categorical recursive model theory, PhD Thesis, Univ. Wisconsin, Madison, 1982 | MR

[4] C. J. Ash, A. Nerode, “Intrinsically recursive relations”, Aspects of effective algebra, Proc. conf. 1979, ed. J. N. Crossley, Monash Univ., Clayton, Aust., Upside Down A Book Co., Steel's Creek, 26–41 | MR | Zbl

[5] C. Ash, J. Knight, M. Manasse, T. Slaman, “Generic copies of countable structures”, Ann. Pure Appl. Logic, 42:3 (1989), 195–205 | DOI | MR | Zbl

[6] J. Chisholm, “Effective model theory vs. recursive model theory”, J. Symb. Log., 55:3 (1990), 1168–1191 | DOI | MR | Zbl

[7] S. S. Goncharov, “Problema chisla neavtoekvivalentnykh konstruktivizatsii”, Algebra i logika, 19:6 (1980), 621–639 | MR

[8] S. Wehner, “Enumeration, countable structure and Turing degrees”, Proc. Am. Math. Soc., 126:7 (1998), 2131–2139 | DOI | MR | Zbl

[9] T. Slaman, “Relative to any nonrecursive”, Proc. Am. Math. Soc., 126:7 (1998), 2117–2122 | DOI | MR | Zbl

[10] S. Goncharov, V. Harizanov, J. Knight, C. McCoy, R. Miller, R. Solomon, “Enumerations in computable structure theory”, Ann. Pure Appl. Logic, 136:3 (2005), 219–246 | DOI | MR | Zbl

[11] J. Chisholm, E. B. Fokina, S. S. Goncharov, V. S. Harizanov, J. F. Knight, S. Quinn, “Intrinsic bounds on complexity and definability at limit levels”, J. Symb. Log., 74:3 (2009), 1047–1060 | DOI | MR | Zbl

[12] S. S. Goncharov, “Isomorphisms and definable relations on computable models”, Logic colloquium 2005, Proc. of the annual European summer meeting of Assoc. Symbolic Logic (Athens, Greece, July 28 – August 3, 2005), Lect. Notes Log., 28, eds. C. Dimitracopoulos et al., Cambridge Univ. Press, Cambridge; Assoc. Symbolic Logic, Urbana, IL, 2008, 26–45 | MR | Zbl

[13] D. A. Tusupov, “Orientirovannyi graf konechnoi $\Delta^\alpha_0$-razmernosti”, Vestn. NGU. Ser. matem., mekh., inform., 7:1 (2007), 102–113 | MR | Zbl

[14] A. H. Mekler, “Stability of nilpotent groups of class 2 and prime exponent”, J. Symb. Log., 46 (1981), 534–562 | DOI | MR

[15] D. R. Hirschfeldt, B. Khoussainov, R. A. Shore, A. M. Slinko, “Degree spectra and computable dimensions in algebraic structures”, Ann. Pure Appl. Logic, 115:1–3 (2002), 71–113 | DOI | MR | Zbl

[16] J. A. Tussupov, “Isomorphisms and algorithmic properties structures with two equivalences”, Bull. Symbolic Logic, 18:3 (2012), 468