# Sets of degrees of computable fields

## Authors

Article

- Received:

DOI: 10.1007/BF02756493

- Cite this article as:
- Bienenstock, E. Israel J. Math. (1977) 27: 348. doi:10.1007/BF02756493

- 30 Views

## Abstract

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 of*F* has degree a.

## Copyright information

© Hebrew University 1977