Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153): Difference between revisions

It is proved (in ZFC) that every upper semi-lattice of size \(\aleph_ 1\) that has 0 and the countable predecessor property (each element has countably many predecessors) is isomorphic to an initial segment of the Turing degrees. This remarkable positive result answers questions raised by Yates in 1968. The authors first treat the case of countable linear orderings, then linear orderings of size \(\aleph_ 1\), and finally arbitrary upper semi-lattices of that size. The main arguments are forcing arguments, with key ideas credited to Shelah. Minor modifications allow this result to be adapted to both the truth-table degrees and the weak truth-table degrees. But it is known from work of Groszek and Slaman that the result cannot be extended to upper semi-lattices of size \(\aleph_ 2\), even when \(\aleph_ 2\) is less than the size of the continuum. The paper is nearly self-contained, requiring only a few constructions found in \textit{M. Lerman}'s ''Degrees of unsolvability'' (1983; Zbl 0542.03023).