The complexity of radicals and socles of modules

DOI10.1215/00294527-2019-0036zbMath1484.03019OpenAlexW2991360866MaRDI QIDQ2176411

Huishan Wu

Publication date: 4 May 2020

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

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1574996414

zbMATH Keywords

modulessoclesradicalsreverse mathematics

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

The computational complexity of module socles ⋮ Reverse mathematics and semisimple rings ⋮ Structure of semisimple rings in reverse and computable mathematics ⋮ Effective aspects of Jacobson radicals of rings ⋮ Ring structure theorems and arithmetic comprehension ⋮ The complexity of module radicals ⋮ Characterizing von Neumann regular rings in reverse mathematics

Cites Work

• Countable algebra and set existence axioms
• Ideals in computable rings
• Subspaces of computable vector spaces
• On the complexity of radicals in noncommutative rings
• Chain conditions in computable rings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of radicals and socles of modules