Skip to main content
SpringerLink
Log in

Hyperarithmetical Categoricity of Boolean Algebras of Type \( \mathfrak{B} \)(ω α × η)

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We study the Δ 0 β -categoricity of Boolean algebras. We prove that if δ is a limit ordinal or 0, n ∈ ω, and δ+n ≥ 1, then the Boolean algebra \( \mathfrak{B} \)(ωδ+n×η) is Δ 0 δ + 2n + 1 -categorical, but not Δ 0 δ + 2n -categorical.

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, Countable Boolean Algebras and Decidability [in Russian], Nauchnaya Kniga (IDMI), Novosibirsk (1996); English transl.: Plenum, New York (1997).

    Google Scholar 

  2. Yu. L. Ershov and S. S. Goncharov, Constructive Models, [in Russian], Nauchnaya Kniga (IDMI), Novosibirsk (1999); English transl.: Consultants Bureau (2000).

  3. C. J. Ash and J. F. Khight, Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000).

    MATH  Google Scholar 

  4. C. J. Ash, J. F. Khight, M. Manasse, and T. Slaman, “Generic copies of countable structures,” Ann. Pure Appl. Logic 42, No. 3, 195–205 (1989).

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Chisholm, “Effective model theory vs. recursive model theory,” J. Symb. Log. 55, No. 3, 1168–1191 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  6. S. S. Goncharov, “On the number of nonequivalent constructivizations” [in Russian], Algebra Logika 16, No. 3, 257–282 (1977).

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Goncharov, V. Harizanov, J. Knight, Ch. McCoy, R. Miller, and R. Solomon, “Enumerations in computable structure theory,” Ann. Pure Appl. Logic 136, No. 3, 219–246 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  8. 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  MATH  MathSciNet  Google Scholar 

  9. S. S. Goncharov, “Autostability and computable families of constructivizations” [in Russian], Algebra Logika 14, No. 6, 647–680 (1975).

    Article  MATH  Google Scholar 

  10. S. S. Goncharov and V. D. Dzgoev, “Autostability of models” [in Russian], Algebra Logika 19, No. 1, 45–58 (1980); English transl.: Algebra Logic 19, 28–37 (1980).

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Ch. McCoy, Δ 02 -Categoricity in Boolean algebras and linear orderings,” Ann. Pure Appl. Logic 119, No. 1–3, 85–120 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  13. Ch. F. McCoy, “Partial results in Δ 03 -categoricity in linear orderings and Boolean algebras” [in Russian], Algebra Logika 41, No. 5, 531–552 (2002); English transl.: Algebra Logic 41, No. 5, 295–305 (2002).

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, 2, Pirogova St., 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 Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 12, No. 3, 2012, pp. 35–45.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bazhenov, N.A. Hyperarithmetical Categoricity of Boolean Algebras of Type \( \mathfrak{B} \)(ω α × η). J Math Sci 202, 40–49 (2014). https://doi.org/10.1007/s10958-014-2032-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-014-2032-7

Keywords

Search

Navigation