Standard

On Decidable Categoricity for Almost Prime Models of the Signature of Graphs. / Marchuk, M. I.

в: Siberian Advances in Mathematics, Том 31, № 4, 10.2021, стр. 283-300.

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

Harvard

APA

Vancouver

Marchuk MI. On Decidable Categoricity for Almost Prime Models of the Signature of Graphs. Siberian Advances in Mathematics. 2021 окт.;31(4):283-300. doi: 10.1134/S1055134421040039

Author

Marchuk, M. I. / On Decidable Categoricity for Almost Prime Models of the Signature of Graphs. в: Siberian Advances in Mathematics. 2021 ; Том 31, № 4. стр. 283-300.

BibTeX

@article{9c1f81e87fe24187bf08f5d101e562c1,
title = "On Decidable Categoricity for Almost Prime Models of the Signature of Graphs",
abstract = "We study the degrees of decidable categoricity for almost prime models and theirrelationship with the degrees of the sets of complete formulas. We show that a result ofGoncharov, Harizanov, and Miller for models of infinite signature is valid for models ofthe signature of graphs.",
keywords = "almost prime model, computable model, decidable categoricity, decidable model, degree of decidable categoricity, prime model, spectrum of decidable categoricity",
author = "Marchuk, {M. I.}",
note = "Funding Information: The work was partially supported by the Russian Foundation for Basic Research (project no. 20-01-00300). Publisher Copyright: {\textcopyright} 2021, Pleiades Publishing, Ltd.",
year = "2021",
month = oct,
doi = "10.1134/S1055134421040039",
language = "English",
volume = "31",
pages = "283--300",
journal = "Siberian Advances in Mathematics",
issn = "1055-1344",
publisher = "PLEIADES PUBLISHING INC",
number = "4",

}

RIS

TY - JOUR

T1 - On Decidable Categoricity for Almost Prime Models of the Signature of Graphs

AU - Marchuk, M. I.

N1 - Funding Information: The work was partially supported by the Russian Foundation for Basic Research (project no. 20-01-00300). Publisher Copyright: © 2021, Pleiades Publishing, Ltd.

PY - 2021/10

Y1 - 2021/10

N2 - We study the degrees of decidable categoricity for almost prime models and theirrelationship with the degrees of the sets of complete formulas. We show that a result ofGoncharov, Harizanov, and Miller for models of infinite signature is valid for models ofthe signature of graphs.

AB - We study the degrees of decidable categoricity for almost prime models and theirrelationship with the degrees of the sets of complete formulas. We show that a result ofGoncharov, Harizanov, and Miller for models of infinite signature is valid for models ofthe signature of graphs.

KW - almost prime model

KW - computable model

KW - decidable categoricity

KW - decidable model

KW - degree of decidable categoricity

KW - prime model

KW - spectrum of decidable categoricity

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

UR - https://www.mendeley.com/catalogue/de59bd21-00d0-3b09-a86b-88f51ae82547/

U2 - 10.1134/S1055134421040039

DO - 10.1134/S1055134421040039

M3 - Article

AN - SCOPUS:85121748261

VL - 31

SP - 283

EP - 300

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 4

ER -

ID: 35227924