The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees

DOI10.1305/NDJFL/1163775443MaRDI QIDQ866498zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Andrew E. M. Lewis

Publication date 20 February 2007

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1163775443

zbMATH Keywords

densityweak truth table degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Hypersimplicity and semicomputability in the weak truth table degrees
• Intervals and sublattices of the r.e. weak truth table degrees. I: Density
• The d.r.e \(wtt\)-degrees are dense
• scientific article; zbMATH DE number 3997772
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility

Cited in

(1)

• The d.r.e \(wtt\)-degrees are dense

This page was built for publication: The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees

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