This is a preview of subscription content, log in via an institution to check access.
References
A. Montalbàn, “Up to equimorphism, hyperarithmetic is recursive,” J. Symb. Log., 70, No. 2, 360-378 (2005).
A. Montalbàn, “On the equimorphism types of linear orderings,” Bull. Symb. Log., 13, No. 1, 71-99 (2007).
N. Greenberg and A. Montalbán, “Ranked structures and arithmetic transfinite recursion,” Trans. Am. Math. Soc., 360, No. 3, 1265-1307 (2008).
E. Fokina, D. Rossegger, and L. San Mauro, “Bi-embeddability spectra and bases of spectra,” arXiv:1808.05451 [math.LO].
E. B. Fokina, I. Kalimullin, and R. Miller, “Degrees of categoricity of computable structures,” Arch. Math. Log., 49, No. 1, 51-67 (2010).
B. F. Csima, J. N. Franklin, and R. A. Shore, “Degrees of categoricity and the hyperarithmetic hierarchy,” Notre Dame J. Formal Log., 54, No. 2, 215-231 (2013).
C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., Vol. 144, Elsevier, Amsterdam (2000).
N. A. Bazhenov, “Effective categoricity for distributive lattices and Heyting algebras,” Lobachevskii J. Math., 38, No. 4, 600-614 (2017).
N. Bazhenov, E. Fokina, D. Rossegger, and L. San Mauro, “Degrees of biembeddability categoricity of equivalence structures,” Arch. Math. Log. (2018); https://doi.org/10.1007/s00153-018-0650-3.
S. S. Goncharov and V. D. Dzgoev, “Autostability of models,” Algebra and Logic, 19, No. 1, 28-36 (1980).
J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,” J. Symb. Log., 46, No. 3, 572-594 (1981).
J. B. Remmel, “Recursively categorical linear orderings,” Proc. Am. Math. Soc., 83, No. 2, 387-391 (1981).
R. G. Downey, A.M. Kach, S. Lempp, A. E. M. Lewis-Pye, A. Montalbán, and D. D. Turetsky, “The complexity of computable categoricity,” Adv. Math., 268, 423-466 (2015).
Author information
Authors and Affiliations
Corresponding author
Additional information
∗Supported by RFBR, project no. 16-31-60058 mol_a_dk.
∗∗Supported by the Austrian Science Fund FWF, project P 27527.
∗∗∗Supported by RFBR, project no. 17-31-50026 mol_nr.
∗∗∗∗Supported by the Austrian Science Fund FWF, projects P 27527 and M 2461.
Translated from Algebra i Logika, Vol. 57, No. 5, pp. 601-608, September-October, 2018.
Rights and permissions
About this article
Cite this article
Bazhenov, N.A., Fokina, E.B., Rossegger, D. et al. Computable Bi-Embeddable Categoricity. Algebra Logic 57, 392–396 (2018). https://doi.org/10.1007/s10469-018-9511-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-018-9511-8