Skip to main content
SpringerLink
Log in

Enumerations and Completely Decomposable Torsion-Free Abelian Groups

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We study possible degree spectra of completely decomposable torsion-free Abelian groups.

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. Baer, R.: Abelian groups without elements of finite order. Duke Math. J. 3, 68–122 (1937)

    Article  MathSciNet  Google Scholar 

  2. Coles, R., Downey, R., Slaman, T.: Every set has a least jump enumeration. J. Lond. Math. Soc. (2) 62(3), 641–649

  3. Downey, R.: On presentations of algebraic structures. In: Sorbi (ed.) Complexity, Logic and Recursion Theory, pp. 157–205. Marcel Dekker, New York (1997)

    Google Scholar 

  4. Ershov, Y., Goncharov, S.: Constructive Models. Nauchnaya kniga, Novosibirsk (1999)

    MATH  Google Scholar 

  5. Fuchs, L.: Infinite Abelian Groups, vol. II. Academic Press, New York (1973)

    MATH  Google Scholar 

  6. Khisamiev, N.: Constructive Abelian Groups. Handbook of Recursive Mathematics, vol. 139. Elsevier, Amsterdam (1998)

    Google Scholar 

  7. Mal’tsev, A.I.: On recursive Abelian groups. Soviet Math. Dokl. 3

  8. Miller, R.: The Δ 02 -spectrum of a linear order. J. Symb. Log. 66, 470–486 (2001)

    Article  MATH  Google Scholar 

  9. Selman, A.: Arithmetical reducibilities I. Z. Math. Log. Grundlagen Math. 17, 335–370 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  10. Slaman, T.: Relative to any non-recursive set. Proc. Am. Math. Soc. 126, 2117–2122 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  11. Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin/Heidelberg (1987)

    Google Scholar 

  12. Wehner, S.: Enumerations, countable structures and Turing degrees. Proc. Am. Math. Soc. 126, 2131–2139 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Alexander G. Melnikov

Authors
  1. Alexander G. Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander G. Melnikov.

Additional information

Partially supported by President grant of Scientific School NSh-4413.2006.1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Melnikov, A.G. Enumerations and Completely Decomposable Torsion-Free Abelian Groups. Theory Comput Syst 45, 897–916 (2009). https://doi.org/10.1007/s00224-009-9175-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-009-9175-9

Keywords

Search

Navigation