Undecidability of module homomorphisms
HTML articles powered by AMS MathViewer
- by K. H. Kim and F. W. Roush PDF
- Proc. Amer. Math. Soc. 104 (1988), 374-377 Request permission
Abstract:
For finitely additively generated torsion free modules and rings, we show existence of module monomorphisms is decidable but of epimorphisms is undecidable.References
- Mike Boyle, Brian Marcus, and Paul Trow, Resolving maps and the dimension group for shifts of finite type, Mem. Amer. Math. Soc. 70 (1987), no. 377, vi+146. MR 912638, DOI 10.1090/memo/0377
- Fritz Grunewald and Daniel Segal, Some general algorithms. I. Arithmetic groups, Ann. of Math. (2) 112 (1980), no. 3, 531–583. MR 595206, DOI 10.2307/1971091
- K. H. Kim and F. W. Roush, Some results on decidability of shift equivalence, J. Combin. Inform. System Sci. 4 (1979), no. 2, 123–146. MR 564188
- Ki Hang Kim and Fred W. Roush, Decidability of shift equivalence, Dynamical systems (College Park, MD, 1986–87) Lecture Notes in Math., vol. 1342, Springer, Berlin, 1988, pp. 374–424. MR 970567, DOI 10.1007/BFb0082843 R. A. Sarkisian, Galois cohomology on some questions in the theory of algorithms, Math. USSR Sb. 39 (1981), 519-545.
- R. A. Sarkisyan, A problem of equality for Galois cohomology, Algebra i Logika 19 (1980), no. 6, 707–725, 746–747 (Russian). MR 622614
Additional Information
- © Copyright 1988 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 104 (1988), 374-377
- MSC: Primary 03B25; Secondary 03D35, 16A99
- DOI: https://doi.org/10.1090/S0002-9939-1988-0962801-5
- MathSciNet review: 962801