Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-05T12:51:33.959Z Has data issue: false hasContentIssue false

Relative Splittings of in the-Enumeration Degrees

Published online by Cambridge University Press:  31 March 2017

Marat M. Arslanov
Affiliation:
Kazan State University
Andrea Sorbi
Affiliation:
University of Siena
Samuel R. Buss
Affiliation:
University of California, San Diego
Petr Hájek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Pavel Pudlák
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access

Summary

Summary. We prove some results on the degrees. We show that splits in the e-degrees above any incomplete degree; on the other hand, one can find a splitting of into e-degrees b and d, such that for any degree

Introduction

A set A is enumeration reducible (e-reducible) to a set B if there exists a recursively enumerable (r. e.) set (called in this context an enumeration operator, or, simply, an e-operator) such that

The structure De of the e-degrees is the structure of the equivalence classes (called e-degrees) of sets of numbers under the equivalence relation generated by the preordering the e-degree of A is denoted by the symbol. De is in fact an uppersemilattice with least element where any r. e. set W: the partial ordering relation of will be denoted by

Throughout the paper we will refer to some fixed acceptable numbering of the (r. e.) sets; we therefore obtain a corresponding listing of the e-operators. We will consider finite recursive approximations to the r.e. sets (in the sense of [20, p.16]). We get corresponding finite recursive approximations to the e-operators. We will indicate by the approximation to defined by where is some fixed finite recursive approximation to K.

We adopt the usual notational conventions: see for instance Soare [20], and Cooper [9]. Given a set F, let and. Thus, We sometimes identify a given finite set with its canonical index, thus writing for instance to denote the number where u is the canonical index of F. If B and then if then

It is known ([16], [19]) that the e-degrees extend the structure of the Turing degrees: the mapping defined by (where and denote the Turing degree and the characteristic function of A, respectively) defines an order theoretic embedding preserving joins and least element.

The degrees

McEvoy ([15]) defines a jump operation on. Of particular interest is the structure (it is known that. It is shown in [8] that S is dense and S coincides with the structure of the (in fact, if and only if). One can distinguish several substructures of S. In particular, the correspond, under the above mentioned embedding, to the r. e. Turing degrees a is a if and only if for some r. e.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2000

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

1. S., Ahmad: Some results on the structure of the Σ2 enumeration degrees. Recursive Function Theory Newsletter, bf 38, 1989
2. S., Ahmad: Embedding the diamond in the Σ2 enumeration degrees. J. Symbolic Logic, 50 (1991) 195–212
3. S., Ahmad, A. H, Lachlan: Some special pairs of Σ2 e-degrees. Math. Log. Quart., 44 (1998) 431–449
4. M., Arslanov, A., Sorbi: The distribution of the Δ 0/2 enumeration degrees. (to appear)
5. S., Bereznyuk, R., Coles, A., Sorbi: The distribution of properlyΣ 0/2 enumeration degrees. Preprint, 1997
6. S. B., Cooper, C. S., Copestake: Properly Σ 2 enumeration degrees. Z. Math. Logik Grundlag. Math., 34 (1988) 491–522Google Scholar
7. S. B., Cooper: Partial degrees and the density problem. J. Symbolic Logic, 47 (1982) 854–859
8. S. B., Cooper: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ 2 sets are dense. J. Symbolic Logic, 49 (1984) 503–513
9. S. B., Cooper: Enumeration reducibility, nondeterministic computations and relative computability of partial functions. In: Recursion Theory Week, Oberwolfach 1989 (K., Ambos-Spies, G., Müller, and G. E., Sacks, editors),LectureNotes in Mathematics, 1432 (1990) 57–110Google Scholar
10. S. B., Cooper, A., Sorbi, X., Yi: Cupping and noncupping in the enumeration degrees of Σ0|2 sets. Ann. Pure Appl. Logic, 1997 (to appear)
11. L., Gutteridge: Some Results on Enumeration Reducibility. PhD thesis, Simon Fraser University, 1971
12. J., Lagemann: Embedding Theorems in the Reducibility Ordering of the Partial Degrees. PhD thesis, M.I.T., 1972
13. K., McEvoy, S. B., Cooper: On minimal pairs of enumeration degrees. J. Symbolic Logic, 50 (1985) 839–848
14. K., McEvoy: The Structure of the Enumeration Degrees. PhD thesis, School of Mathematics, University of Leeds, 1984
15. K., McEvoy: Jumps of quasi–minimal enumeration degrees. J. Symbolic Logic, 50 (1985) 839–848
16. Y. T., Medvedev: Degrees of difficulty of themass problems.Dokl. Akad. Nauk. SSSR, 104 (1955) 501–504
17. A., Nies, A., Sorbi: Branching in the enumeration degrees of Σ 0/2 sets. (to appear)
18. A., Nies, A., Sorbi: Structural properties and Σ 0/2 enumeration degrees. (to appear)
19. H., Rogers, Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967
20. R. I., Soare: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series. Springer–Verlag, Heidelberg, 1987
21. C. E. M., Yates: Three theorems on the degrees of recursively enumerable sets. Duke Math. J., 32 (1965) 461–468

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] 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
×