Abstract
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.
Research partially supported by NSF Grant DMS-9100114.
Research partially supported by NSF Grants DMS-8900349 and DMS-900539.
Research partially supported by NSF Grant DMS-8900349.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambos-Spies, K. [1984], An extension of the non-diamond theorem in classical and α-recursion theory. J. Symbolic Logic, 49, 586–607.
Cooper, S.B. [1974], Minimal pairs and high recursively enumerable degrees. J. Symbolic Logic, 39, 665–660.
Lachlan, A.H. [1966], Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc, 16, 537–569.
Lempp, S and M. Lerman [1990], Priority arguments using iterated trees of strategies. In: Recursion Theory Week, 1989, Lecture Notes in Mathematics #1482, 277–296. Springer-Verlag, Berlin, Heidelberg, New York.
Lempp, S. and M. Lerman, The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. In preparation.
Posner, D. [1977], High degrees. Ph.D. Dissertation, University of California, Berkeley.
Shoenfield, J.R. [1959], On degrees of unsolvability. Ann. Math, 69, 644–653.
Shore, R.A. and T.A. Slaman, Working below a high recursively enumerable degree. To appear.
Soare, R.I. [1987], Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Springer-Verlag, Berlin, Heidelberg, New York.
Yates, C.E.M. [1966], A minimal pair of recursively enumerable degrees. J. Symbolic Logic, 31, 159–168.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Anil Nerode on the occasion of his sixtieth birthday
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lempp, S., Lerman, M., Weber, F. (1993). Minimal Pair Constructions and Iterated Trees of Strategies. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_17
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0325-4_17
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6708-9
Online ISBN: 978-1-4612-0325-4
eBook Packages: Springer Book Archive