Decidable subspaces and recursively enumerable subspaces

DOI10.2307/2274266MaRDI QIDQ3710516zbMATH OpenOpenAlexFDO

Authors 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

decidabilityfirst-order theoryfully effective vector spacer.e. subspace

Mathematics Subject Classification ID

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

Recommendations

• A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
• On speedable and levelable vector spaces
• scientific article; zbMATH DE number 749925
• scientific article; zbMATH DE number 130871
• Subspaces of computable vector spaces

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Countable vector spaces with recursive operations Part I¹
• Direct Summands of Recursively Enumerable Vector Spaces
• ON A QUESTION OF A. RETZLAFF
• On r.e. and co-r.e. vector spaces with nonextendible bases
• Recursion theory on fields and abstract dependence
• Recursively enumerable vector spaces
• The Friedberg-Muchnik Theorem Re-Examined

Cited in

(23)

• Co-immune subspaces and complementation inV_∞
• The universal complementation property
• Classification of degree classes associated with r.e. subspaces
• scientific article; zbMATH DE number 4217338 (Why is no real title available?)
• Decidability, partial decidability and sharpness relation for L-subsets
• scientific article; zbMATH DE number 176212 (Why is no real title available?)
• Recursive properties of relations on models
• Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)
• Sound, totally sound, and unsound recursive equivalence types
• scientific article; zbMATH DE number 130871 (Why is no real title available?)
• Simple permutations: Decidability and unavoidable substructures
• Orbits of Creative Subspaces
• A decidable subclass of the minimal Gödel class with identity
• Splitting properties of r.e. sets and degrees
• The decidable properties of subrecursive functions
• On speedable and levelable vector spaces
• More undecidable lattices of Steinitz exchange systems
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• The Lattice of Computably Enumerable Vector Spaces
• On reduction of the decision problem of recursively enumerable sets to the separability problem
• Subspaces of computable vector spaces
• A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
• Automorphisms of supermaximal subspaces

This page was built for publication: Decidable subspaces and recursively enumerable subspaces

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