On Decidable Categoricity for Almost Prime Models of the Signature of Graphs. / Marchuk, M. I.
In: Siberian Advances in Mathematics, Vol. 31, No. 4, 10.2021, p. 283-300.Research output: Contribution to journal › Article › peer-review
}
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