Recursively enumerable vector spaces

Cited in

(64)

Automorphisms of substructure lattices in recursive algebra
Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
Classification of degree classes associated with r.e. subspaces
Maximal theories
Recursion theory and ordered groups
Recursion theory on fields and abstract dependence
Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
Degrees of convex dependence in recursively enumerable vector spaces
On speedable and levelable vector spaces
Turing degrees of hypersimple relations on computable structures
Generic objects in recursion theory. II: Operations on recursive approximation spaces
On recursively enumerable structures
On the lattices of NP-subspaces of a polynomial time vector space over a finite field
The computational complexity of module socles
Turing degrees and automorphism groups of substructure lattices
Effectively categorical abelian groups
Subspaces of computable vector spaces
Computable abelian groups
Orbits of maximal vector spaces
Learning families of closed sets in matroids
Iterated effective embeddings of abelian p-groups
Reverse mathematics of matroids
The Lattice of Computably Enumerable Vector Spaces
Orbits of Creative Subspaces
R. e. presented linear orders
More undecidable lattices of Steinitz exchange systems
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
Maximality in effective topology
Degrees of recursively enumerable topological spaces
\({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
Simplicity in effective topology
Automorphisms of supermaximal subspaces
Co-immune subspaces and complementation inV_∞
Decidable subspaces and recursively enumerable subspaces
Bases of supermaximal subspaces and Steinitz systems. I
The universal complementation property
Recursive constructions in topological spaces
Recursion theory on orderings. I. A model theoretic setting
On r.e. and co-r.e. vector spaces with nonextendible bases
Recursively presented Abelian groups: Effective p-Group theory. I
Simple and hyperhypersimple vector spaces
Recursively enumerable sets and degrees
Major subspaces of recursively enumerable vector spaces
A r-maximal vector space not contained in any maximal vector space
Winter meeting of the Association for Symbolic Logic, San Antonio, 1993
Torsion-free abelian groups with optimal Scott families
Finding bases of uncountable free abelian groups is usually difficult
Independence in computable algebra
Proper divisibility in computable rings
The complexity of ascendant sequences in locally nilpotent groups
Maximal r.e. equivalence relations
COMPUTABLY COMPACT METRIC SPACES
Spaces of orders and their Turing degree spectra
\(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
Recursive properties of relations on models
Computable formal contexts
Some open questions and recent results on computable Banach spaces
Dependence relations in computably rigid computable vector spaces
The geometry of computable Banach spaces
The given
A note on r-maximal subspaces of \(V_{\infty}\)
On the learnability of vector spaces
Complexity-theoretic algebra. II: Boolean algebras
A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)

This page was built for publication: Recursively enumerable vector spaces

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