Chain conditions in computable rings

DOI10.1090/S0002-9947-2010-05013-5zbMath1215.03017MaRDI QIDQ3065750

Chris J. Conidis

Publication date: 6 January 2011

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

computability theoryreverse mathematicsNoetherian ringArtinian ringring of finite length

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Related Items (12)

The computability, definability, and proof theory of Artinian rings ⋮ Open Questions in Reverse Mathematics ⋮ Reverse mathematics and semisimple rings ⋮ On the complexity of radicals in noncommutative rings ⋮ The complexity of radicals and socles of modules ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Structure of semisimple rings in reverse and computable mathematics ⋮ Effective aspects of Jacobson radicals of rings ⋮ Orders on computable rings ⋮ Ring structure theorems and arithmetic comprehension ⋮ Proper divisibility in computable rings ⋮ Characterizing von Neumann regular rings in reverse mathematics

Cites Work

• Countable algebra and set existence axioms
• Addendum to ``Countable algebra and set existence axioms
• Ideals in computable rings
• Subspaces of computable vector spaces
• Rings with minimal condition for left ideals
• Effective procedures in field theory
• Rekursive Algebren mit Kettenbedingungen
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chain conditions in computable rings