Algebra and Logic

, Volume 41, Issue 4, pp 274–283 | Cite as

A Class of Strongly Decomposable Abelian Groups

  • N. G. Khisamiev


Let G be a completely decomposable torsion-free Abelian group and G= ⊕ Gi, where G i is a rank 1 group. If there exists a strongly constructive numbering ν of G such that (G,ν) has a recursively enumerable sequence of elements g i G i , then G is called a strongly decomposable group. Let pi, i∈ω, be some sequence of primes whose denominators are degrees of a number p i and let \(\mathop \oplus \limits_{i \in \omega } Q_{Pi} \). A characteristic of the group A is the set of all pairs ‹ p,k› of numbers such that \(p_{i_1 } = ... = p_{i_k } = p\) for some numbers i1,...,i k . We bring in the concept of a quasihyperhyperimmune set, and specify a necessary and sufficient condition on the characteristic of A subject to which the group in question is strongly decomposable. Also, it is proved that every hyperhyperimmune set is quasihyperhyperimmune, the converse being not true.

strongly decomposable Abelian group hyperhyperimmune set quasihyperhyperimmune set 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. I. Mal'tsev, “On recursive Abelian groups,” Dokl. Akad. NaukSSSR, 146, No. 5, 1009-1012 (1962).Google Scholar
  2. 2.
    N. G. Khisamiev, “Constructiveabelian groups,” in Handbook of Recursive Mathematics, Vol. 2, Elsevier, Amsterdam (1998), pp. 1177-1230.Google Scholar
  3. 3.
    N. G. Khisamiev and A. N. Krykpaeva, “Effectivelycompletely decomposable Abelian groups,” Sib. Mat. Zh., 38, No. 6, 1410-1412 (1997).Google Scholar
  4. 4.
    N. G. Khisamiev, “Strongly constructive Abelian p-groups,” Algebra Logika,22, No. 2, 198-217 (1983).Google Scholar
  5. 5.
    N. G. Khisamiev, “Strongly completelydecomposable Abelian groups,” in Proc. Int. Conf. “Logic and Its Applications,” Novosibirsk (2000), p. 106.Google Scholar
  6. 6.
    M. I. Kargapolov and Yu. I. Merzlyakov, Fundamentals of Group Theory [in Russian],3d edn., Nauka, Moscow (1982).Google Scholar
  7. 7.
    L. Fuchs, Infinite Abelian Groups, Vol. 1,Academic Press, New York (1970).Google Scholar
  8. 8.
    Yu. L. Ershov, Problems of Decidability andConstructive Models [in Russian], Nauka, Moscow (1980).Google Scholar
  9. 9.
    A. I. Mal'tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).Google Scholar
  10. 10.
    H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).Google Scholar

Copyright information

© Plenum Publishing Corporation 2002

Authors and Affiliations

  • N. G. Khisamiev

There are no affiliations available

Personalised recommendations