Minimal complementation below uniform upper bounds for the arithmetical degrees

DOI10.2307/2275810zbMath0873.03040OpenAlexW1994910118WikidataQ56913216 ScholiaQ56913216MaRDI QIDQ3128467

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

uniform upper boundsarithmetical degree

Mathematics Subject Classification ID

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

Related Items (1)

Coloring trees in reverse mathematics

Cites Work

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

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