The computability, definability, and proof theory of Artinian rings

DOI10.1016/j.aim.2018.10.036zbMath1454.03016OpenAlexW2898898042WikidataQ129024316 ScholiaQ129024316MaRDI QIDQ1628418

Chris J. Conidis

Publication date: 4 December 2018

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2018.10.036

zbMATH Keywords

proof theorycomputability theoryreverse mathematicsdefinabilityArtinian ring

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Second- and higher-order arithmetic and fragments (03F35) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Primitive recursive reverse mathematics ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Structure of semisimple rings in reverse and computable mathematics

Cites Work

• Countable algebra and set existence axioms
• Addendum to ``Countable algebra and set existence axioms
• The decision problem for exponential diophantine equations
• Ideals in computable rings
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• The word problem in semi-groups with cancellation
• Turing Computability
• Chain conditions in computable rings
• Algorithmic Randomness and Complexity
• Open Questions in Reverse Mathematics
• Effective procedures in field theory
• Low upper bounds of ideals
• Rekursive Algebren mit Kettenbedingungen
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• Recursive Unsolvability of a problem of Thue
• Unnamed Item
• 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: The computability, definability, and proof theory of Artinian rings