Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding

DOI10.1016/0168-0072(89)90031-6zbMath0628.03032OpenAlexW2065728362MaRDI QIDQ1092897

Rodney G. Downey

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90031-6

zbMATH Keywords

r.e. wtt-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Intervals and sublattices of the r.e. weak truth table degrees. I: Density

Cites Work

• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• Pairs without infimum in the recursively enumerable weak truth table degrees
• T-Degrees, Jump Classes, and Strong Reducibilities
• Bounding minimal pairs
• Minimal pairs and high recursively enumerable degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding