Decidable subspaces and recursively enumerable subspaces

DOI10.2307/2274266zbMath0585.03016OpenAlexW2025407611MaRDI QIDQ3710516

C. J. Ash, Rodney G. Downey

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274266

zbMATH Keywords

first-order theorydecidabilityfully effective vector spacer.e. subspace

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Theory of numerations, effectively presented structures (03D45)

Related Items

On speedable and levelable vector spaces ⋮ Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Orbits of Creative Subspaces ⋮ Classification of degree classes associated with r.e. subspaces ⋮ The universal complementation property ⋮ Splitting properties of r.e. sets and degrees ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Sound, totally sound, and unsound recursive equivalence types ⋮ Automorphisms of supermaximal subspaces ⋮ More undecidable lattices of Steinitz exchange systems

Cites Work

• Unnamed Item
• Recursion theory on fields and abstract dependence
• ON A QUESTION OF A. RETZLAFF
• Direct Summands of Recursively Enumerable Vector Spaces
• On r.e. and co-r.e. vector spaces with nonextendible bases
• Recursively enumerable vector spaces
• Countable vector spaces with recursive operations Part I¹
• The Friedberg-Muchnik Theorem Re-Examined