Controlling the dependence degree of a recursively enumerable vector space

DOI10.2307/2271945zbMath0399.03032OpenAlexW2022403147MaRDI QIDQ4182492

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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Countable vector spaces with recursive operations Part II