Skip to main content

0-Categorical Completely Decomposable Torsion-Free Abelian Groups

  • Conference paper
Mathematical Theory and Computational Practice (CiE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5635))

Included in the following conference series:

Abstract

We show that every homogeneous completely decomposable torsion-free abelian group is 0-categorical. We give a description of effective categoricity for some natural class of torsion-free abelian groups. In particular, we give examples of 0-categorical but not 0-categorical torsion-free abelian groups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baer, R.: Abelian Groups Without Elements of Finite Order. Duke Math. J. 3, 68–122 (1937)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ershov, Y.L., Goncharov, S.S.: Constructive Models, Novosibirsk, Nauchnaya Kniga (1999)

    Google Scholar 

  3. Goncharov, S.S.: Countable Boolean Algebras and Decidability. Siberian School of Algebra and Logic, Novosibirsk, Nauchnaya Kniga (1996)

    Google Scholar 

  4. Goncharov, S.S.: Autostability of Models and Abelian Groups. Algebra and Logic 19, 13–27 (1980) (English translation)

    Article  MathSciNet  MATH  Google Scholar 

  5. Goncharov, S.S.: The Problem of the Number of Non-Autoequivalent Constructivisations. Algebra and Logic 19, 401–414 (1980) (English translation)

    Article  Google Scholar 

  6. Goncharov, S.S., Dzgoev, V.D.: Autostability of Models. Algebra and Logic 19(1), 45–58 (1980)

    MathSciNet  MATH  Google Scholar 

  7. Lempp, S., McCoy, C., Miller, R., Solomon, R.: Computable Categoricity of Trees of Finite Height. Journal of Symbolic Logic (2005)

    Google Scholar 

  8. McCoy, C.: Categoricity in Boolean Algebras and Linear Orderings. Annals of Pure and Applied Logic 119, 85–120 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Nurtazin, A.T.: Computable Classes and Algebraic Criteria of Autostability. Summary of Scientific Schools, Math. Inst. SB USSRAS, Novosibirsk (1974)

    Google Scholar 

  10. Remmel, J.B.: Recursively Categorical Linear Orderings. Proc. Amer. Math. Soc. 83, 387–391 (1981)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  12. Fuchs, L.: Infinite Abelian Groups, vol. I, II. Academic Press, London (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melnikov, A.G. (2009). 0-Categorical Completely Decomposable Torsion-Free Abelian Groups. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03072-7

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics