Minimal Pair Constructions and Iterated Trees of Strategies
Steffen Lempp, Manuel Lerman, F. Weber · Birkhäuser Boston eBooks · 1993
We use the iterated trees of strategies approach developed in [LL1], [LL2] to prove some theorems about minimal pairs. In Section 1-3, we show how to use these methods to prove the Minimal Pair Theorem of Lachlan [L] and Yates [Y]: Theorem 3.4 (Minimal Pair). There exist nonrecursive r.e. degreesaandbsuch thata λ b = 0.