It is proved that every computable superatomic Boolean algebra has a strong degree of categoricity.
Similar content being viewed by others
References
S. S. Goncharov, V. S. Harizanov, J. F. Knight, C. McCoy, R. Miller, and R. Solomon, “Enumerations in computable structure theory,” Ann. Pure Appl. Log., 136, No. 3, 219-246 (2005).
J. Chisholm, E. B. Fokina, S. S. Goncharov, V. S. Harizanov, J. F. Knight, and S. Quinn, “Intrinsic bounds on complexity and definability at limit levels,” J. Symb. Log., 74, No. 3, 1047-1060 (2009).
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. Y. Franklin, and R. A. Shore, “Degrees of categoricity and the hyperarithmetic hierarchy,” Notre Dame J. Formal Log., 54, No. 2, 215-231 (2013).
S. S. Goncharov, “Degrees of autostability relative to strong constructivizations,” Trudy MIAN, 274, 119-129 (2011).
S. S. Goncharov and V. D. Dzgoev, “Autostability of models,” Algebra Logika, 19, No. 1, 45-58 (1980).
J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,” J. Symb. Log., 46, No. 3, 572-594 (1981).
C. McCoy, “\( \Delta_2^0 \)-categoricity in Boolean algebras and linear orderings,” Ann. Pure Appl. Log., 119, Nos. 1-3, 85-120 (2003).
C. F. McCoy, “Partial results in \( \Delta_3^0 \)-categoricity in linear orderings and Boolean algebras,” Algebra Logika, 41, No. 5, 531-552 (2002).
K. Harris, “Categoricity in Boolean algebras,” to appear.
N. A. Bazhenov, “\( \Delta_2^0 \)-categoricity of Boolean algebras,” Vestnik NGU, Mat., Mekh., Inf., 13, No. 2, 3-14 (2013).
S. S. Goncharov, Countable Boolean Algebras and Decidability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).
S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1999).
C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Logic Found. Math., 144, Elsevier, Amsterdam (2000).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
S. S. Goncharov, “Constructivizability of superatomic Boolean algebras,” Algebra Logika, 12, No. 1, 31-40 (1973).
C. J. Ash, “Categoricity in hyperarithmetical degrees,” Ann. Pure Appl. Log., 34, No. 1, 1-14 (1987).
P. M. Semukhin, “The degree spectra of definable relations on Boolean algebras,” Sib. Mat. Zh., 46, No. 4, 928-941 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 52, No. 3, pp. 271-283, May-June, 2013.
*Supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-276.2012.1), by the Federal Program “Scientific and Scientific-Pedagogical Cadres of Innovative Russia” for 2009-2013 (project No. 8227), and by RFBR (project No. 11-01-00236).
Rights and permissions
About this article
Cite this article
Bazhenov*, N.A. Degrees of categoricity for superatomic Boolean algebras. Algebra Logic 52, 179–187 (2013). https://doi.org/10.1007/s10469-013-9233-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-013-9233-x