Controlling the dependence degree of a recursively enumerable vector space

DOI10.2307/2271945MaRDI QIDQ4182492zbMATH OpenOpenAlexFDO

Authors Richard A. Shore

Publication date 1978

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

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

zbMATH Keywords

Canonical Completely Effective Vector SpaceDegree of DifficultyDependence DegreeRecursively Enumerable Vector SpaceRecursively Presented Vector SpacesTuring Degree

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Vector spaces, linear dependence, rank, lineability (15A03)

Cites work

• Countable vector spaces with recursive operations Part II
• scientific article; zbMATH DE number 3443640 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)

Cited in

(11)

• Classification of degree classes associated with r.e. subspaces
• Recursion theory on fields and abstract dependence
• Computable abelian groups
• R. e. presented linear orders
• Co-immune subspaces and complementation inV_∞
• Bases of supermaximal subspaces and Steinitz systems. I
• The universal complementation property
• Recursively presented Abelian groups: Effective p-Group theory. I
• Infinite dimensional proper subspaces of computable vector spaces
• Independence in computable algebra
• Dependence relations in computably rigid computable vector spaces

This page was built for publication: Controlling the dependence degree of a recursively enumerable vector space

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