Infinite dimensional proper subspaces of computable vector spaces
From MaRDI portal
Publication:402446
DOI10.1016/j.jalgebra.2014.02.027zbMath1338.03086MaRDI QIDQ402446
Publication date: 28 August 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.02.027
03D15: Complexity of computation (including implicit computational complexity)
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
03D45: Theory of numerations, effectively presented structures
03D55: Hierarchies of computability and definability
Related Items
Primitive recursive reverse mathematics, Structure of semisimple rings in reverse and computable mathematics, Orbits of maximal vector spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Countable algebra and set existence axioms
- Addendum to ``Countable algebra and set existence axioms
- Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
- The computability, definability, and proof theory of Artinian rings
- On the strength of Ramsey's theorem
- Ideals in computable rings
- Subspaces of computable vector spaces
- On the complexity of radicals in noncommutative rings
- On the strength of Ramsey's theorem for pairs
- – CA0 and order types of countable ordered groups
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Turing Computability
- Chain conditions in computable rings
- Algorithmic Randomness and Complexity
- Reverse Mathematics: The Playground of Logic
- Open Questions in Reverse Mathematics
- Effective procedures in field theory
- Degrees of models
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- The atomic model theorem and type omitting
- Effective content of field theory
- Rekursive Algebren mit Kettenbedingungen
- Controlling the dependence degree of a recursively enumerable vector space
- A r-maximal vector space not contained in any maximal vector space
- Ordered Groups: A Case Study in Reverse Mathematics
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Computable Algebra, General Theory and Theory of Computable Fields
- ∏ 0 1 Classes and Degrees of Theories
- Reverse mathematics and fully ordered groups