Geodesic
Punctual categoricity spectra of computably categorical structures
Algebra i logika, Tome 60 (2021) no. 3, pp. 335-343.

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

@article{AL_2021_60_3_a6,
     author = {N. A. Bazhenov and I. Sh. Kalimullin},
     title = {Punctual categoricity spectra of computably categorical structures},
     journal = {Algebra i logika},
     pages = {335--343},
     publisher = {mathdoc},
     volume = {60},
     number = {3},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2021_60_3_a6/}
}
TY  - JOUR
AU  - N. A. Bazhenov
AU  - I. Sh. Kalimullin
TI  - Punctual categoricity spectra of computably categorical structures
JO  - Algebra i logika
PY  - 2021
SP  - 335
EP  - 343
VL  - 60
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2021_60_3_a6/
LA  - ru
ID  - AL_2021_60_3_a6
ER  - 
%0 Journal Article
%A N. A. Bazhenov
%A I. Sh. Kalimullin
%T Punctual categoricity spectra of computably categorical structures
%J Algebra i logika
%D 2021
%P 335-343
%V 60
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2021_60_3_a6/
%G ru
%F AL_2021_60_3_a6
N. A. Bazhenov; I. Sh. Kalimullin. Punctual categoricity spectra of computably categorical structures. Algebra i logika, Tome 60 (2021) no. 3, pp. 335-343. http://geodesic.mathdoc.fr/item/AL_2021_60_3_a6/

[1] I. Kalimullin, A. Melnikov, K. M. Ng, “Algebraic structures computable without delay”, Theoret. Comput. Sci., 674 (2017), 73–98 | DOI | Zbl

[2] N. Bazhenov, R. Downey, I. Kalimullin, A. Melnikov, “Foundations of online structure theory”, Bull. Symb. Log., 25:2 (2019), 141–181 | DOI | Zbl

[3] I. Sh. Kalimullin, A. G. Melnikov, K. M. Ng, “Razlichnye versii kategorichnosti bez zaderzhek”, Algebra i logika, 56:2 (2017), 256–266 | Zbl

[4] I. Sh. Kalimullin, A. G. Melnikov, “Punctual categoricity relative to a computable oracle”, Lobachevskii J. Math., 42:4 (2021), 735–742 | DOI | Zbl

[5] E. B. Fokina, I. Kalimullin, R. Miller, “Degrees of categoricity of computable structures”, Arch. Math. Logic, 49:1 (2010), 51–67 | DOI | Zbl

[6] 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

[7] L. Kristiansen, Papers on subrecursion theory, dr. scient.-graden, Research report 217, PhD thesis, Dep. Inform., Univ. Oslo, 1996

[8] N. Bazhenov, I. Kalimullin, A. Melnikov, K. M. Ng, “Online presentations of finitely generated structures”, Theor. Comput. Sci., 844 (2020), 195–216 | DOI | Zbl

[9] C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees”, Trans. Am. Math. Soc., 298:2 (1986), 497–514 | DOI | Zbl

[10] N. Bazhenov, “Turing computable embeddings, computable infinitary equivalence, and linear orders”, Unveiling Dynamics and Complexity, 13th conf. comput. Europe, CiE 2017 (Turku, Finland, June 12–16, 2017), Lect. Notes Comput. Sci., 10307, eds. J. Kari et al., Springer, Cham, 2017, 141–151 | DOI | Zbl

[11] C. J. Ash, J. F. Knight, “Pairs of recursive structures”, Ann. Pure Appl. Logic, 46:3 (1990), 211–234 | DOI | Zbl