A c.e. weak truth table degree which is array noncomputable and r-maximal
From MaRDI portal
Recommendations
- Multiple permitting and array noncomputability
- Computably enumerable sets in the Solovay and the strong weak truth table degrees
- Working with strong reducibilities above totally -c.e. and array computable degrees
- Hypersimplicity and semicomputability in the weak truth table degrees
- Array nonrecursiveness and relative recursive enumerability
Cited in
(5)- Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
- scientific article; zbMATH DE number 4172959 (Why is no real title available?)
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Working with strong reducibilities above totally -c.e. and array computable degrees
- Computably enumerable sets in the Solovay and the strong weak truth table degrees
This page was built for publication: A c.e. weak truth table degree which is array noncomputable and r-maximal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670755)