Recursively enumerable vector spaces

Cited In (61)

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

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)