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.
Partially supported by President grant of Scientific School NSh-4413.2006.1.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Downey, R., Jockusch, G.: Every low Boolean algebra is isomorphic to a recursive one. Proc. Amer. Math. Soc 122, 871–880 (1994)
Ershov, Y., Goncharov, S.: Constuctive models. Novosibirsk, Nauchnaya kniga (1999)
Miller, R.: The \(\Delta^{0}_{2}\)-spectrum of a linear order (preprint)
Slaman, T.: Relative to ani non-recursive set. Proc. of the Amer. Math. Soc 126, 2117–2122 (1998)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Fuchs, L.: Infinite Abelian Groups, vol. II. Academic Press, San Diego (1973)
Wehner, S.: Enumerations, countable structures and Turing degrees. Proc. of the Amer. Math. Soc. 126, 2131–2139 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melnikov, A.G. (2007). Enumerations and Torsion Free Abelian Groups. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)