Sets of degrees of computable fields
- Cite this article as:
- Bienenstock, E. Israel J. Math. (1977) 27: 348. doi:10.1007/BF02756493
Given a Σ2 (resp. Σ1) degree of recursive unsolvability a, a computable field (resp. a computable field with a splitting algorithm)F is constructed in any given characteristic, such that the set of dimensions of all finite extensions ofF has degree a.