The complexity of decomposability of computable rings
From MaRDI portal
Publication:6100980
Recommendations
Cites work
- Classification from a Computable Viewpoint
- Computability and randomness
- Computable abelian groups
- Computable completely decomposable groups
- Computable structures and the hyperarithmetical hierarchy
- scientific article; zbMATH DE number 1633834 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 107550 (Why is no real title available?)
- Ideals in computable rings
- On the complexity of radicals in noncommutative rings
- The complexity of module radicals
- The computational complexity of torsion-freeness of finitely presented groups
- The decomposability problem for torsion-free abelian groups is analytic-complete
- The isomorphism problem for computable Abelian p-groups of bounded length
- The isomorphism problem for torsion-free abelian groups is analytic complete
- The isomorphism relation on countable torsion free abelian groups
- Turing computability. Theory and applications
Cited in
(3)
This page was built for publication: The complexity of decomposability of computable rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100980)