Subspaces of computable vector spaces
This paper is continuation of the work begun by a subset of the authors in [\textit{R. G. Downey}, et al., J. Algebra 314, No. 2, 872--887 (2007; Zbl 1127.03037)]. The authors prove results on the computability theory and reverse mathematics of existence theorems for vector subspaces. They construct a computable vector space \(V\) of dimension greater than 1 (over a computable field) such that deg\((W) \gg 0\) for all nontrivial proper subspaces \(W\) of \(V\), and another similar vector space for which deg\((W) \geq 0^\prime\) for all finite-dimensional nontrivial proper subspaces \(W\). They also prove the reverse mathematical analogs of these results, showing that, over RCA\(_0\), the system WKL\(_0\) is equivalent to the statement ``every vector space of dimension greater than one over an infinite field has a nontrivial proper subspace and that ACA\(_0\) is equivalent to ``every vector space of dimension greater than one over an infinite field has a finite-dimensional nontrivial proper subspace. Early work in computable vector spaces includes [\textit{J. C. E. Dekker}, J. Symb. Log. 34, 363--387 (1969; Zbl 0185.02003)] and early work on reverse mathematics of vector spaces is described in section III.4 of [\textit{S. G. Simpson}, Subsystems of second order arithmetic. Berlin: Springer (1999; Zbl 0909.03048)].
- Degrees of convex dependence in recursively enumerable vector spaces
- On speedable and levelable vector spaces
- Characterizing von Neumann regular rings in reverse mathematics
- Reverse mathematics and semisimple rings
- The complexity of radicals and socles of modules
- Turing degrees and automorphism groups of substructure lattices
- Ring structure theorems and arithmetic comprehension
- Ideals in computable rings
- Turing meets Schanuel
- Computable abelian groups
- Orbits of maximal vector spaces
- Rice sequences of relations
- Reverse mathematics of matroids
- The Lattice of Computably Enumerable Vector Spaces
- Chain conditions in computable rings
- A robuster Scott rank
- Decidable subspaces and recursively enumerable subspaces
- Infinite dimensional proper subspaces of computable vector spaces
- scientific article; zbMATH DE number 2079882 (Why is no real title available?)
- The complexity of computable categoricity
- Orders on computable rings
- The complexity of ascendant sequences in locally nilpotent groups
- Primitive recursive reverse mathematics
- Structure of semisimple rings in reverse and computable mathematics
- Computable formal contexts
- Categories and functors in reverse and computable mathematics
- Dependence relations in computably rigid computable vector spaces
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)