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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
N. A. Bazhenov, “Autostability spectra for Boolean algebras,” Algebra i logika 53, 764 (2014) [Algebra and Logic 53, 502 (2015)].
N. A. Bazhenov, “Degrees of autostability relative to strong constructivizations for Boolean algebras,” Algebra i logika 55, 133 (2016) [Algebra and Logic 55, 87 (2016)].
N. A. Bazhenov, “A note on effective categoricity for linear orderings,” Lecture Notes Comput. Sci. 10185, 85 (2017).
N. A. Bazhenov, “Autostability spectra for decidable structures,” Math. Structures Comput. Sci. 28, 392 (2018).
N. A. Bazhenov, I. Sh. Kalimullin, and M. M. Yamaleev, “Degrees of categoricity vs. strong degrees of categoricity,” Algebra i logika 55, 257 (2016) [Algebra and Logic 55, 173 (2016)].
N. A. Bazhenov and M. I. Marchuk, “Degrees of autostability relative to strong constructivizations of graphs,” Sib. Matem. Zh. 59, 719 (2018) [Siberian Math. J. 59, 565 (2018)].
C. C. Chang and H. J. Keisler, Model Theory (North-Holland, Amsterdam, 1990).
B. F. Csima, J. N. Y. Franklin, and R. A. Shore, “Degrees of categoricity and the hyperarithmetic hierarchy,” Notre Dame J. Formal Logic 54, 215 (2013).
E. B. Fokina, “Index sets of decidable models,” Sib. Matem. Zh. 48, 1167 (2007) [Siberian Math. J. 48, 939 (2007)].
E. Fokina, A. Frolov, and I. Kalimullin, “Categoricity spectra for rigid structures,” Notre Dame J. Formal Logic 57, 45 (2016).
E. B. Fokina, S. S. Goncharov, V. Harizanov, O. V. Kudinov, and D. Turetsky, “Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations,” Algebra i logika 54, 520 (2015) [Algebra and Logic 54, 336 (2015)].
E. B. Fokina, I. Kalimullin, and R. Miller, “Degrees of categoricity of computable structures,” Arch. Math. Logic 49, 51 (2010).
S. S. Goncharov, “Problem of the number of non-self-equivalent constructivizations,” Algebra i logika 19, 621 (1980) [Algebra and Logic 19, 401 (1980)].
S. S. Goncharov, “Computability and computable models,” in: Mathematical Problems from Applied Logic. II. Logics for the XXIst century, 99 (Springer, New York, 2007).
S. S. Goncharov, “Autostability of prime models under strong constructivizations,” Algebra i logika 48, 729 (2009) [Algebra and Logic 48, 410 (2009)].
S. S. Goncharov, “On autostability of almost prime models relative to strong constructivizations,” Uspekhi Mat. Nauk 65, no. 5, 107 (2010) [Russian Math. Surveys 65, 901 (2010)].
S. S. Goncharov, “Degrees of autostability relative to strong constructivizations,” Trudy Mat. Inst. Steklov 274, 119 (2011) [Proc. Steklov Inst. Math. 274, 105 (2011)].
S. S. Goncharov, N. A. Bazhenov, and M. I. Marchuk, “The index set of linear orderings that are autostable relative to strong constructivizations,” Vestnik Novosibirsk. Gos. Univ., Ser. Mat. Mekh. Inform. 15, no. 3, 51 (2015) [in Russian].
S. S. Goncharov, N. A. Bazhenov, and M. I. Marchuk, “Index sets of autostable relative to strong constructivizations constructive models for familiar classes,” Dokl. Ross. Akad. Nauk 464, 12 (2015) [Dokl. Math. 92, 525 (2015)].
S. S. Goncharov, N. A. Bazhenov, and M. I. Marchuk, “The index set of Boolean algebras autostable relative to strong constructivizations,” Sib. Matem. Zh. 56, 498 (2015) [Siberian Math. J. 56, 393 (2015)].
S. S. Goncharov, N. A. Bazhenov, and M. I. Marchuk, “The index set of the groups autostable relative to strong constructivizations,” Sib. Matem. Zh. 58, 95 (2017) [Siberian Math. J. 58, 72 (2017)].
S. Goncharov, V. Harizanov, and R. Miller, “On decidable categoricity and almost prime models,” Siberian Adv. Math. 30, 200 (2020).
S. S. Goncharov and M. I. Marchuk, “Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations,” Algebra i logika 54, 163 (2015) [Algebra and Logic 54, 108 (2015)].
S. S. Goncharov and M. I. Marchuk, “Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations,” Algebra i logika 54, 663 (2015) [Algebra and Logic 54, 428 (2015)].
S. S. Goncharov and M. I. Marchuk, “Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations,” Dokl. Ross. Akad. Nauk 461, 140 (2015) [Dokl. Math. 91, 158 (2015)].
M. I. Marchuk, “Index set of structures with two equivalence relations that are autostable relative to strong constructivizations,” Algebra i logika 55, 465 (2016) [Algebra and Logic 55, 306 (2016)].
R. Miller and A. Shlapentokh, “Computable categoricity for algebraic fields with splitting algorithms,” Trans. Amer. Math. Soc. 367, 3955 (2015).
A. T. Nurtazin, “Strong and weak constructivization and computable families,” Algebra i logika 13, 311 (1974) [Algebra and Logic 13, 177 (1975)].
E. N. Palvovskiĭ, “Index sets of prime models,” Sib. Elektron. Mat. Izv. 5, 200 (2008) [in Russian].
E. N. Palvovskiĭ, “Estimation of the algorithmic complexity of classes of computable models,” Sib. Matem. Zh. 49, 635 (2008) [Siberian Math. J. 49, 512 (2008)].
ACKNOWLEDGMENTS
The author is grateful to Sergeĭ S. Goncharov and Nikolaĭ A. Bazhenov for useful discussions.
Funding
The work was partially supported by the Russian Foundation for Basic Research (project no. 20-01-00300).
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Marchuk, M.I. On Decidable Categoricity for Almost Prime Models of the Signature of Graphs. Sib. Adv. Math. 31, 283–300 (2021). https://doi.org/10.1134/S1055134421040039
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1055134421040039