Minimal complementation below uniform upper bounds for the arithmetical degrees

DOI10.2307/2275810MaRDI QIDQ3128467zbMATH OpenOpenAlexWikidataFDO

Authors Masahiro Kumabe

Publication date 8 October 1997

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275810

zbMATH Keywords

arithmetical degreeuniform upper bounds

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds for the arithmetical degrees
• Minimal upper bounds for arithmetical degrees
• A single minimal complement for the c.e. degrees
• Minimal complements for degrees below 0′

Cites work

• Degrees joining to 0′
• Minimal upper bounds for arithmetical degrees
• The impossibility of finding relative complements for recursively enumerable degrees
• The strong anticupping property for recursively enumerable degrees
• Two theorems on degrees of models of true arithmetic
• Upper bounds for the arithmetical degrees

Cited in

(4)

• Upper bounds for the arithmetical degrees
• Coloring trees in reverse mathematics
• Minimal upper bounds for arithmetical degrees
• Models of arithmetic and upper bounds for arithmetic sets

This page was built for publication: Minimal complementation below uniform upper bounds for the arithmetical degrees

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