Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-18T19:56:58.076Z Has data issue: false hasContentIssue false

On the structure of gamma degrees

Published online by Cambridge University Press:  24 March 2017

By
Alan P. Silver
Edited by
Juha Oikkonen  and
Jouko Väänänen
Juha Oikkonen
Affiliation:
University of Helsinki
Jouko Väänänen
Affiliation:
University of Helsinki
Get access
Type
Chapter
Information
Logic Colloquium '90 , pp. 290 - 305
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Adleman, Leonard and Manders, K., Reducibility, randomness and intractibility , Proc. 9th Annual ACM Symposium on the Theory of Computing , 1977, pp. 151–163.Google Scholar
Ambos-Spies, Klaus, On the structure of the polynomial time degrees of recursive sets , Habilitationsschrift, Forschungsbericht Nr. 206, Universität Dortmund, 1985.
Copestake, Kate, Enumeration degrees of Σ2 sets , Ph.D. thesis, Leeds University, 1987.
Ladner, Richard, Lynch, Nancy and Selman, Alan L., A comparison of polynomial time reducibilities , Theoretical Computer Science , 1 (1975), pp. 103–123.Google Scholar
Long, Timothy J., On γ-reducibility versus polynomial time many-one reducibility , Theoretical Computer Science , 14 (1981), pp. 91–101.Google Scholar
Long, Timothy J., Strong non-deterministic polynomial-time reducibilities , Theoretical Computer Science , 21 (1982), pp. 1–25.Google Scholar
Silver, Alan P., On polynomial time bounded reducibilities , Ph.D. thesis, Leeds University, May 1991.
Watson, Phil, Concerning D-recursively enumerable sets and s-reducibility of Σ2 Sets , Ph.D. thesis, Leeds University, 1988.
Watson, Phil, On restricted forms of enumeration reducibility , Annals of Pure and Applied Logic , 49 (1990), pp. 75–96.Google Scholar
Zakharov, S. D., e- and s-degrees , Algebra and Logic , 23 (1984), pp. 273–281.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×