Standard

The Index Set of the Class of Autostable Ordered Abelian Groups. / Marchuk, M. I.

в: Siberian Advances in Mathematics, Том 31, № 1, 02.2021, стр. 40-44.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Marchuk, MI 2021, 'The Index Set of the Class of Autostable Ordered Abelian Groups', Siberian Advances in Mathematics, Том. 31, № 1, стр. 40-44. https://doi.org/10.1134/S1055134421010041

APA

Marchuk, M. I. (2021). The Index Set of the Class of Autostable Ordered Abelian Groups. Siberian Advances in Mathematics, 31(1), 40-44. https://doi.org/10.1134/S1055134421010041

Vancouver

Marchuk MI. The Index Set of the Class of Autostable Ordered Abelian Groups. Siberian Advances in Mathematics. 2021 февр.;31(1):40-44. doi: 10.1134/S1055134421010041

Author

Marchuk, M. I. / The Index Set of the Class of Autostable Ordered Abelian Groups. в: Siberian Advances in Mathematics. 2021 ; Том 31, № 1. стр. 40-44.

BibTeX

@article{2fdeb4b2025444d5a593948dbd82bfdc,
title = "The Index Set of the Class of Autostable Ordered Abelian Groups",
abstract = "We find an exact estimate for the algorithmic complexity of the class of autostable orderedAbelian groups.",
keywords = "autostability, autostable model, computable categoricity, computable model, index set, ordered Abelian group",
author = "Marchuk, {M. I.}",
note = "Funding Information: The work was partially supported by the Russian Foundation for Basic Research (project 17-01-00247). Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.",
year = "2021",
month = feb,
doi = "10.1134/S1055134421010041",
language = "English",
volume = "31",
pages = "40--44",
journal = "Siberian Advances in Mathematics",
issn = "1055-1344",
publisher = "PLEIADES PUBLISHING INC",
number = "1",

}

RIS

TY - JOUR

T1 - The Index Set of the Class of Autostable Ordered Abelian Groups

AU - Marchuk, M. I.

N1 - Funding Information: The work was partially supported by the Russian Foundation for Basic Research (project 17-01-00247). Publisher Copyright: © 2021, Pleiades Publishing, Ltd. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021/2

Y1 - 2021/2

N2 - We find an exact estimate for the algorithmic complexity of the class of autostable orderedAbelian groups.

AB - We find an exact estimate for the algorithmic complexity of the class of autostable orderedAbelian groups.

KW - autostability

KW - autostable model

KW - computable categoricity

KW - computable model

KW - index set

KW - ordered Abelian group

UR - http://www.scopus.com/inward/record.url?scp=85103965518&partnerID=8YFLogxK

U2 - 10.1134/S1055134421010041

DO - 10.1134/S1055134421010041

M3 - Article

AN - SCOPUS:85103965518

VL - 31

SP - 40

EP - 44

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 1

ER -

ID: 28363874