CiE 2007: Computation and Logic in the Real World pp 566-574 | Cite as
Enumerations and Torsion Free Abelian Groups
Conference paper
Abstract
We study possible spectrums of torsion free Abelian groups. We code families of finite sets into group and set up the correspondence between their algorithmic complexities.
Keywords
Boolean Algebra Recursive Function Torsion Free Abelian Group Computable Enumeration Turing Degree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Downey, R., Jockusch, G.: Every low Boolean algebra is isomorphic to a recursive one. Proc. Amer. Math. Soc 122, 871–880 (1994)MathSciNetCrossRefMATHGoogle Scholar
- 2.Ershov, Y., Goncharov, S.: Constuctive models. Novosibirsk, Nauchnaya kniga (1999)Google Scholar
- 3.Miller, R.: The \(\Delta^{0}_{2}\)-spectrum of a linear order (preprint)Google Scholar
- 4.Slaman, T.: Relative to ani non-recursive set. Proc. of the Amer. Math. Soc 126, 2117–2122 (1998)MathSciNetCrossRefMATHGoogle Scholar
- 5.Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)CrossRefMATHGoogle Scholar
- 6.Fuchs, L.: Infinite Abelian Groups, vol. II. Academic Press, San Diego (1973)MATHGoogle Scholar
- 7.Wehner, S.: Enumerations, countable structures and Turing degrees. Proc. of the Amer. Math. Soc. 126, 2131–2139 (1998)MathSciNetCrossRefMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2007