Subspaces of computable vector spaces
From MaRDI portal
Recommendations
Cites work
Cited in
(27)- Decidable subspaces and recursively enumerable subspaces
- The complexity of radicals and socles of modules
- Categories and functors in reverse and computable mathematics
- Turing degrees and automorphism groups of substructure lattices
- scientific article; zbMATH DE number 2079882 (Why is no real title available?)
- Ring structure theorems and arithmetic comprehension
- Dependence relations in computably rigid computable vector spaces
- Orbits of maximal vector spaces
- Infinite dimensional proper subspaces of computable vector spaces
- Structure of semisimple rings in reverse and computable mathematics
- Orders on computable rings
- Computable abelian groups
- Primitive recursive reverse mathematics
- Rice sequences of relations
- Reverse mathematics of matroids
- Ideals in computable rings
- The complexity of computable categoricity
- On speedable and levelable vector spaces
- The Lattice of Computably Enumerable Vector Spaces
- Chain conditions in computable rings
- Characterizing von Neumann regular rings in reverse mathematics
- Reverse mathematics and semisimple rings
- A robuster Scott rank
- The complexity of ascendant sequences in locally nilpotent groups
- Degrees of convex dependence in recursively enumerable vector spaces
- Computable formal contexts
- Turing meets Schanuel
This page was built for publication: Subspaces of computable vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456206)