Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T03:37:53.641Z Has data issue: false hasContentIssue false

Degree invariance in the Π10classes

Published online by Cambridge University Press:  12 March 2014

Rebecca Weber*
Affiliation:
Department of Mathematics, 6188 Kemeny Hall, Dartmouth College, Hanover, NH 03755, USA, E-mail: rweber@math.dartmouth.edu

Abstract

Let denote the collection of all Π10 classes, ordered by inclusion. A collection of Turing degrees in is called invariant over if there is some collection of Π10 classes representing exactly the degrees such that is invariant under automorphisms of . Herein we expand the known degree invariant classes of , previously including only {0} and the array noncomputable degrees, to include all highn and non-lown degrees for n > 2. This is a corollary to a very general definability result. The result is carried out in a substructure G of , within which the techniques used model those used by Cholak and Harrington [6] to obtain the same definability for the c.e. sets. We work back and forth between G and to show that this definability in G gives the desired degree invariance over .

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable