The complexity of module radicals

DOI10.1215/00294527-2021-0017OpenAlexW3167546086MaRDI QIDQ1982020

Chris J. Conidis

Publication date: 7 September 2021

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

Full work available at URL: https://doi.org/10.1215/00294527-2021-0017

zbMATH Keywords

radicalmodulecomputability

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Other constructive mathematics (03F65)

Related Items (2)

The computational complexity of module socles ⋮ The complexity of decomposability of computable rings

Cites Work

• Addendum to ``Countable algebra and set existence axioms
• Computable algebra and group embeddings
• The complexity of radicals and socles of modules
• Effectively categorical abelian groups
• Ideals in computable rings
• On the complexity of radicals in noncommutative rings
• Turing Computability
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of module radicals