Skip to main content
SpringerLink
Log in

Degrees of categoricity for superatomic Boolean algebras

  • Published:
Algebra and Logic Aims and scope

It is proved that every computable superatomic Boolean algebra has a strong degree of categoricity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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).

    Article  MathSciNet  MATH  Google Scholar 

  2. 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).

    Article  MathSciNet  MATH  Google Scholar 

  3. E. B. Fokina, I. Kalimullin, and R. Miller, “Degrees of categoricity of computable structures,” Arch. Math. Log., 49, No. 1, 51-67 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  4. 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).

    Article  MathSciNet  MATH  Google Scholar 

  5. S. S. Goncharov, “Degrees of autostability relative to strong constructivizations,” Trudy MIAN, 274, 119-129 (2011).

    MathSciNet  Google Scholar 

  6. S. S. Goncharov and V. D. Dzgoev, “Autostability of models,” Algebra Logika, 19, No. 1, 45-58 (1980).

    MathSciNet  Google Scholar 

  7. J. B. Remmel, “Recursive isomorphism types of recursive Boolean algebras,” J. Symb. Log., 46, No. 3, 572-594 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  8. C. McCoy, “\( \Delta_2^0 \)-categoricity in Boolean algebras and linear orderings,” Ann. Pure Appl. Log., 119, Nos. 1-3, 85-120 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  9. C. F. McCoy, “Partial results in \( \Delta_3^0 \)-categoricity in linear orderings and Boolean algebras,” Algebra Logika, 41, No. 5, 531-552 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  10. K. Harris, “Categoricity in Boolean algebras,” to appear.

  11. N. A. Bazhenov, “\( \Delta_2^0 \)-categoricity of Boolean algebras,” Vestnik NGU, Mat., Mekh., Inf., 13, No. 2, 3-14 (2013).

    Google Scholar 

  12. S. S. Goncharov, Countable Boolean Algebras and Decidability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).

    Google Scholar 

  13. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1999).

    Google Scholar 

  14. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Logic Found. Math., 144, Elsevier, Amsterdam (2000).

    MATH  Google Scholar 

  15. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  16. S. S. Goncharov, “Constructivizability of superatomic Boolean algebras,” Algebra Logika, 12, No. 1, 31-40 (1973).

    Article  MATH  Google Scholar 

  17. C. J. Ash, “Categoricity in hyperarithmetical degrees,” Ann. Pure Appl. Log., 34, No. 1, 1-14 (1987).

    Article  MathSciNet  MATH  Google Scholar 

  18. P. M. Semukhin, “The degree spectra of definable relations on Boolean algebras,” Sib. Mat. Zh., 46, No. 4, 928-941 (2005).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    N. A. Bazhenov*

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    N. A. Bazhenov*

Authors
  1. N. A. Bazhenov*
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. A. Bazhenov*.

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

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-013-9233-x

Keywords:

Search

Navigation