Towards characterizing the >ω2-fickle recursively enumerable Turing degrees

Abstract

Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees 〈RT,≤T〉, it is not known how one can characterize the degrees d∈RT below which L can be embedded. Two important characterizations are of the L7 and M3 lattices, where the lattices are embedded below d if and only if d contains sets of “fickleness” >ω and ≥ωω respectively. We work towards finding a lattice that characterizes the levels above ω2, the first non-trivial level after ω. We considered lattices that are as “short” in height and “narrow” in width as L7 and M3, but the lattices characterize also the >ω or ≥ωω levels, if the lattices are not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some previously considered lattices, but the removals did not change the levels characterized. We discovered three lattices besides M3 that also characterize the ≥ωω-levels. Our search for >ω2-candidates can therefore be reduced to the lattice-theoretic problem of finding lattices that do not contain any of the four ≥ωω-lattices as sublattices.