Two Theorems on Truth Table Degrees
From MaRDI portal
Publication:3798648
DOI10.2307/2047567zbMath0653.03029OpenAlexW4246798101MaRDI QIDQ3798648
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2047567
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Density of a final segment of the truth-table degrees
- \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
- Classical recursion theory. Vol. II
- A criterion for completeness of degrees of unsolvability
- The upper semilattice of degrees ≤ 0′ is complemented
- T-Degrees, Jump Classes, and Strong Reducibilities
- Strong reducibilities
- Relationships Between Reducibilities
This page was built for publication: Two Theorems on Truth Table Degrees