Skip to main content

Questions tagged [arithmetic-degree]

Use to describe questions about the structure of the arithmetic degrees (subsets of N under the relation of relative arithmetic definability) as used in higher computability theory.

Filter by
Sorted by
Tagged with
6 votes
3 answers
444 views

Is $0^{(\omega)}$ a minimal cover in the arithmetic degrees

Is it known if $0^{(\omega)}$ a minimal cover in the arithmetic degrees? In the Turing degrees to show that $0'$ (indeed $0^{(n)}$) isn't a minimal cover one uses the density of r.e. degrees. ...
Peter Gerdes's user avatar
  • 3,029