Infinite dimensional proper subspaces of computable vector spaces

DOI10.1016/J.JALGEBRA.2014.02.027zbMATH Open1338.03086OpenAlexW2014139076MaRDI QIDQ402446FDOQ402446

Authors: Chris J. Conidis 

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

Recommendations

• Subspaces of computable vector spaces
• A Characterization of Infinite Dimension for Vector Spaces
• Coarse infinite-dimensionality of hyperspaces of finite subsets
• Finest chains of subspaces in infinite-dimensional vector spaces
• scientific article; zbMATH DE number 96092
• The Lattice of Computably Enumerable Vector Spaces
• Finite dimensional orthocomplemented subspaces of \({\ell}^{\infty}\)
• Infinitary properties of valued and ordered vector spaces
• Computability of the metric projection onto finite-dimensional linear subspaces
• On certain non-constructive properties of infinite-dimensional vector spaces.

zbMATH Keywords

computability theoryreverse mathematicsvector space\(\Pi_1^0\)-classeslow basis theorem

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Title not available (Why is that?)
• Algorithmic randomness and complexity.
• Title not available (Why is that?)
• Subsystems of second order arithmetic
• Computability and randomness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subspaces of computable vector spaces
• Effective content of field theory
• ∏ 0 1 Classes and Degrees of Theories
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• On the strength of Ramsey's theorem for pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Degrees of models
• Reverse mathematics: the playground of logic
• Open questions in reverse mathematics
• The atomic model theorem and type omitting
• Title not available (Why is that?)
• Countable algebra and set existence axioms
• On the strength of Ramsey's theorem
• Title not available (Why is that?)
• 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
• Ideals in computable rings
• On the complexity of radicals in noncommutative rings
• \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
• Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
• Turing computability. Theory and applications
• Chain conditions in computable rings
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Reverse mathematics and fully ordered groups

Cited In (5)

• Orbits of maximal vector spaces
• Structure of semisimple rings in reverse and computable mathematics
• Primitive recursive reverse mathematics
• Finest chains of subspaces in infinite-dimensional vector spaces
• Subspaces of computable vector spaces

This page was built for publication: Infinite dimensional proper subspaces of computable vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402446)