The complexity of decomposability of computable rings

DOI10.1215/00294527-2023-0003OpenAlexW4360612198MaRDI QIDQ6100980

Huishan Wu

Publication date: 31 May 2023

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2023-0003

zbMATH Keywords

computable ringsdecomposable ringsblock decomposable rings

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable structures and the hyperarithmetical hierarchy
• The complexity of module radicals
• Ideals in computable rings
• On the complexity of radicals in noncommutative rings
• COMPUTABLE ABELIAN GROUPS
• Turing Computability
• Computable completely decomposable groups
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Classification from a Computable Viewpoint
• The computational complexity of torsion-freeness of finitely presented groups
• The isomorphism relation on countable torsion free abelian groups
• The decomposability problem for torsion-free abelian groups is analytic-complete

This page was built for publication: The complexity of decomposability of computable rings