Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
From MaRDI portal
Publication:1094415
DOI10.1007/BF01620762zbMath0631.03032MaRDI QIDQ1094415
Publication date: 1988
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Tabular degrees in \(\alpha\)-recursion theory, On the structures inside truth-table degrees, Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees, Two Theorems on Truth Table Degrees
Cites Work
- Unnamed Item
- Unnamed Item
- The density of the nonbranching degrees
- Completely mitotic r. e. degrees
- Classical recursion theory. Vol. II
- On degrees of recursively enumerable sets
- The recursively enumerable degrees are dense
- T-Degrees, Jump Classes, and Strong Reducibilities
- Two Theorems on Truth Table Degrees
- Strong reducibilities
- Minimal pairs and high recursively enumerable degrees
- The weak truth table degrees of recursively enumerable sets
- A recursively enumerable degree which will not split over all lesser ones
- A Note on Bounded-Truth-Table Reducibility
- Relationships Between Reducibilities