Structure of semisimple rings in reverse and computable mathematics
From MaRDI portal
Publication:6077944
DOI10.1007/s00153-023-00885-3OpenAlexW4379880612MaRDI QIDQ6077944
Publication date: 27 September 2023
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-023-00885-3
Complexity of computation (including implicit computational complexity) (03D15) Foundations of classical theories (including reverse mathematics) (03B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite dimensional proper subspaces of computable vector spaces
- Reverse mathematics and order theoretic fixed point theorems
- Countable algebra and set existence axioms
- The computability, definability, and proof theory of Artinian rings
- The complexity of radicals and socles of modules
- Ring structure theorems and arithmetic comprehension
- Ideals in computable rings
- Subspaces of computable vector spaces
- Lifting proofs from countable to uncountable mathematics
- Chain conditions in computable rings
- Ordered Groups: A Case Study in Reverse Mathematics
- REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
- Reverse mathematics and fully ordered groups
This page was built for publication: Structure of semisimple rings in reverse and computable mathematics