Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees

From MaRDI portal
Publication:3767338





[Part II is reviewed below (see Zbl 0631.03032).] We solve a question of \textit{P. Odifreddi} [Bull. Am. Math. Soc., New. Ser. 4, 37-86 (1981; Zbl 0484.03024)] by showing that, given \(n>0\), there exists an r.e. tt-degree containing exactly \(2^ n-1\) r.e. m-degrees. The method is rather like a ``full approximation argument.











This page was built for publication: Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767338)