Infinite dimensional proper subspaces of computable vector spaces
From MaRDI portal
(Redirected from Publication:402446)
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)
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.
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3973001 (Why is no real title available?)
- scientific article; zbMATH DE number 48828 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1461254 (Why is no real title available?)
- scientific article; zbMATH DE number 1531920 (Why is no real title available?)
- scientific article; zbMATH DE number 1390012 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- scientific article; zbMATH DE number 3316918 (Why is no real title available?)
- A r-maximal vector space not contained in any maximal vector space
- Addendum to ``Countable algebra and set existence axioms
- Algorithmic randomness and complexity.
- Chain conditions in computable rings
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Computability and randomness
- Computable Algebra, General Theory and Theory of Computable Fields
- Controlling the dependence degree of a recursively enumerable vector space
- Countable algebra and set existence axioms
- Degrees of models
- Effective content of field theory
- Effective procedures in field theory
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Ideals in computable rings
- Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
- On the complexity of radicals in noncommutative rings
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- Open questions in reverse mathematics
- Ordered Groups: A Case Study in Reverse Mathematics
- Rekursive Algebren mit Kettenbedingungen
- Reverse mathematics and fully ordered groups
- Reverse mathematics: the playground of logic
- Subspaces of computable vector spaces
- Subsystems of second order arithmetic
- The atomic model theorem and type omitting
- The computability, definability, and proof theory of Artinian rings
- Turing computability. Theory and applications
- \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
- ∏ 0 1 Classes and Degrees of Theories
Cited in
(5)
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)