Recursively enumerable vector spaces
From MaRDI portal
Publication:4170711
DOI10.1016/0003-4843(77)90015-8zbMath0389.03019OpenAlexW2062135743MaRDI QIDQ4170711
Publication date: 1977
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(77)90015-8
Applications of computability and recursion theory (03D80) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
On speedable and levelable vector spaces ⋮ The computational complexity of module socles ⋮ Automorphisms of substructure lattices in recursive algebra ⋮ Recursively presented Abelian groups: Effective p-Group theory. I ⋮ Co-immune subspaces and complementation inV∞ ⋮ Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Orbits of maximal vector spaces ⋮ Learning Families of Closed Sets in Matroids ⋮ Decidable subspaces and recursively enumerable subspaces ⋮ Bases of supermaximal subspaces and Steinitz systems. I ⋮ Orbits of Creative Subspaces ⋮ Classification of degree classes associated with r.e. subspaces ⋮ Maximal theories ⋮ Recursion theory and ordered groups ⋮ The universal complementation property ⋮ Effectively categorical abelian groups ⋮ Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ On the learnability of vector spaces ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Winter meeting of the Association for Symbolic Logic, San Antonio, 1993 ⋮ On recursively enumerable structures ⋮ Iterated effective embeddings of abelian p-groups ⋮ On the lattices of NP-subspaces of a polynomial time vector space over a finite field ⋮ Turing degrees of hypersimple relations on computable structures ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Spaces of orders and their Turing degree spectra ⋮ Recursion theory on fields and abstract dependence ⋮ Reverse Mathematics of Matroids ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures ⋮ Complexity-theoretic algebra. II: Boolean algebras ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Subspaces of computable vector spaces ⋮ Independence in computable algebra ⋮ Proper divisibility in computable rings ⋮ A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\) ⋮ Maximality in effective topology ⋮ Degrees of recursively enumerable topological spaces ⋮ Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games ⋮ Recursive properties of relations on models ⋮ $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures ⋮ The complexity of ascendant sequences in locally nilpotent groups ⋮ Degrees of convex dependence in recursively enumerable vector spaces ⋮ Dependence relations in computably rigid computable vector spaces ⋮ R. e. presented linear orders ⋮ Maximal r.e. equivalence relations ⋮ Recursive constructions in topological spaces ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Simple and hyperhypersimple vector spaces ⋮ Recursively enumerable sets and degrees ⋮ Major subspaces of recursively enumerable vector spaces ⋮ Generic objects in recursion theory. II: Operations on recursive approximation spaces ⋮ A r-maximal vector space not contained in any maximal vector space ⋮ Recursion theory on orderings. I. A model theoretic setting ⋮ On r.e. and co-r.e. vector spaces with nonextendible bases ⋮ Simplicity in effective topology ⋮ The given ⋮ A note on r-maximal subspaces of \(V_{\infty}\) ⋮ Automorphisms of supermaximal subspaces ⋮ More undecidable lattices of Steinitz exchange systems
