Abstract
AbstractWe use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for a particular Turing degree d with d′ = 0″, but that not all such fields are 0′-computably categorical. We also prove related results about algebraic fields with splitting algorithms, and fields of finite transcendence degree over ℚ.
Publisher
Cambridge University Press (CUP)
Reference36 articles.
1. Effective choice for relations and reducibilities in classes of constructive and positive models
2. Computable algebra, general theory, and theory of computable fields;Rabin;Transactions of the American Mathematical Society,1960
3. Miller R.G. and Schoutens H. , Computably categorical fields via Fermat's Last Theorem, to appear.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献