Minimal Pair Constructions and Iterated Trees of Strategies
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)
- 159 Downloads
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.
KeywordsBasic Module Minimal Pair True Path Finite Tree Finite Outcome
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [LL2]Lempp, S. and M. Lerman, The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. In preparation.Google Scholar
- [P]Posner, D. , High degrees. Ph.D. Dissertation, University of California, Berkeley.Google Scholar
- [SS]Shore, R.A. and T.A. Slaman, Working below a high recursively enumerable degree. To appear.Google Scholar
- [So]Soare, R.I. , Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Springer-Verlag, Berlin, Heidelberg, New York.Google Scholar
© Springer Science+Business Media New York 1993