Degrees of convex dependence in recursively enumerable vector spaces

DOI10.1016/0168-0072(93)90191-FzbMath0769.03028MaRDI QIDQ1210136

Thomas A. Nevins

Publication date: 16 May 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Turing degreesconvex closureseffective linear dependencerecursive ordered fieldrecursively enumerable vector space

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY
• Recursively enumerable vector spaces
• Nowhere simple sets and the lattice of recursively enumerable sets

This page was built for publication: Degrees of convex dependence in recursively enumerable vector spaces