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.
Recommendations
- scientific article; zbMATH DE number 2237371
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
- scientific article; zbMATH DE number 5000253
- Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
- Upper semilattice of recursively enumerable Q-degrees
Cites work
Cited in
(8)- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
- Tabular degrees in \(\alpha\)-recursion theory
- On 1-degrees inside m-degrees
- scientific article; zbMATH DE number 5000253 (Why is no real title available?)
- scientific article; zbMATH DE number 3977006 (Why is no real title available?)
- Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
- scientific article; zbMATH DE number 2237371 (Why is no real title available?)
- Irreducible, singular, and contiguous degrees
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)