I will introduce Kumabe-Slaman forcing and discuss the steps for using
that forcing in hyperarithmetic and arithmetic settings, to prove an extended
Posner-Robinson theorem. This, along with other initial segment results, shows
the $\Sigma_2$-theory of the arithmetic and hyperarithmetic degrees in the language
of upper semi-lattices is decidable.