@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",
}