A c.e. weak truth table degree which is array noncomputable and r-maximal

DOI10.1007/978-3-319-94418-0_30MaRDI QIDQ1670755zbMATH OpenOpenAlexFDO

Authors Martin Monath

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94418-0_30

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Multiple permitting and array noncomputability
• New Computational Paradigms
• 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
• New Computational Paradigms

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)