On Decidable Categoricity for Almost Prime Models of the Signature of Graphs
M. I. Marchuk · Siberian Advances in Mathematics · 2021
Abstract We study the degrees of decidable categoricity for almost prime models and their relationship with the degrees of the sets of complete formulas. We show that a result of Goncharov, Harizanov, and Miller for models of infinite signature is valid for models of the signature of graphs.