Abstract
This chapter presents the important method of forcing with trees to contruct minimal degrees. Variations on this method have produced many results on degrees and their initial segments as presented in Lerman [1983]. Theorems using the minimal degree construction can be found in the bibliographies of Epstein [1975] and [1979].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Minimal Degrees Below \(\emptyset^{\prime\prime}\) . In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31932-7
Online ISBN: 978-3-642-31933-4
eBook Packages: Computer ScienceComputer Science (R0)