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 theory; reverse mathematics; Noetherian ring; Artinian ring; ring of finite length

Mathematics Subject Classification ID

03B30: Foundations of classical theories (including reverse mathematics)

03D80: Applications of computability and recursion theory

03F35: Second- and higher-order arithmetic and fragments

Related Items

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