The enumeration spectrum hierarchy of \(n\)-families (Q2827955)

A 0-family is defined here as a set of natural numbers, and inductively for nonzero ordinal \(\alpha\), an \(\alpha\)-family is a countable set of \(\beta\)-families, \(\beta<\alpha\). For \(n<\omega\), a finitary \(n\)-family is an \(n\)-family built up from 0-families that are finite. Also inductively defined is the notion of an \(\alpha\)-family being c.e.~in a set. The enumeration spectrum of a family is the collection of Turing degrees of all sets in which the family is c.e. Via coding families into graphs, results about enumeration spectra translate into results about degree spectra.NEWLINENEWLINEThis paper shows that if \(0<n<\omega\), there exists an \(n\)-family whose enumeration spectrum consists of the non-low\({}_{2n-1}\) degrees, but no \(n\)-family's enumeration spectrum equals the non-low\({}_{2n}\) degrees. A parallel result holds for finitary \(n\)-families, with \(2n-1\) and \(2n\) replaced by \(2n-2\) and \(2n-1\), respectively. The authors also construct an \(\omega+1\)-family whose enumeration spectrum consists of the non-low\({}_\omega\) degrees.