Enumerations and Completely Decomposable Torsion-Free Abelian Groups

@article{Melnikov2009EnumerationsAC,
  title={Enumerations and Completely Decomposable Torsion-Free Abelian Groups},
  author={Alexander G. Melnikov},
  journal={Theory of Computing Systems},
  year={2009},
  volume={45},
  pages={897-916}
}
We study possible degree spectra of completely decomposable torsion-free Abelian groups. 

From This Paper

Topics from this paper.
5 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

The  02 - spectrum of a linear order

  • R. Miller
  • J . Symb . Log .
  • 2001

Constructive Abelian Groups

  • N. Khisamiev
  • Handbook of Recursive Mathematics,
  • 1998
2 Excerpts

Countable Structures and Turing Degrees

  • S. Wehner, Enumerations
  • Proc . Amer . Math . Soc .
  • 1998

Relative to Ani Non-Recursive Set

  • T. Slaman
  • Proc. Amer. Math. Soc.,
  • 1998
1 Excerpt

Relative to any non - recursive set

  • T. Slaman
  • Proc . Am . Math . Soc .
  • 1998

Infinite Abelian Groups

  • L. Fuchs
  • 1973
2 Excerpts

Similar Papers

Loading similar papers…