On the complexity of radicals in noncommutative rings

DOI10.1016/j.jalgebra.2009.07.039zbMath1182.03073OpenAlexW1986415410MaRDI QIDQ2655033

Chris J. Conidis

Publication date: 22 January 2010

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2009.07.039

zbMATH Keywords

computability theoryradicalLevitzki radicalarithmetical hierarchyprime radicaleffective descriptive set theorycomputable ringnoncommutative ring theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) General radicals and associative rings (16N80) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

The computational complexity of module socles ⋮ The complexity of radicals and socles of modules ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Effective aspects of Jacobson radicals of rings ⋮ The complexity of decomposability of computable rings ⋮ The complexity of module radicals ⋮ The complexity of primes in computable unique factorization domains

Cites Work

• Countable algebra and set existence axioms
• Addendum to ``Countable algebra and set existence axioms
• Ideals in computable rings
• Chain conditions in computable rings
• Effective procedures in field theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of radicals in noncommutative rings