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
K. Ambos-Spies, On the structure of the recursively enumerable degrees, Dissertation, University of Munich, 1980.
K. Ambos-Spies, C. Jockusch, R. A. Shore, and R. I. Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Trans. Amer. Math. Soc. 281 (1984), 109–128.
K. Ambos-Spies, On pairs of recursively enumerable degrees, Trans. Amer. Math. Soc. 283 (1984), 507–531.
K. Ambos-Spies, Cupping and noncapping in the r.e. weak truth table and Turing degrees, Archiv für Math. Logik und Grundlagen der Math., to appear.
M. Bickford and C. F. Mills, Lowness properties of r.e. sets, to appear
R. Epstein, Degrees of unsolvability: Structure and theory, Lecture Notes in Mathematics. vol. 759. Springer Verlag, Berlin, Heidelberg, New York (1980).
M. Ingrassia, P-genericity for recursively enumerable sets, Doctoral Dissertation, University of Illinois at Urbana-Champaign, 1981
M. Ingrassia, P-generic r.e. degrees are dense, to appear
C. Jockusch, Degrees of generic sets, in Recursion Theory, its Generalisations and Applications, ed. by F. R. Drake and S. S. Wainer, Cambridge University Press, Cambridge (1980), 110–139.
C. Jockusch and D. Posner, Double jumps of minimal degrees, J. Symbolic Logic 43 (1978), 715–724.
C. Jockusch, Three easy constructions of recursively enumerable sets, in Logic Year 1979–80 (Lecture Notes in Mathematics, 859) ed. by M. Lerman, J. H. Schmerl, and R. I. Soare, Springer Verlag, Berlin, Heidelberg, New York (1981), 83–91.
A. H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16 (1966), 537–569.
W. Maass, R. A. Shore, and M. Stob, Splitting properties and jump classes, Israel J. Math 39 (1981), 210–224.
W. Maass, Recursively enumerable generic sets, J. Symbolic Logic 47 (1982), 809–823.
W. Maass, Variations on promptly simple sets, to appear in J. Symbolic Logic.
J. Mohrherr, A refinement of lown and highn for the r.e. degrees, Z. Math. Logik und Grundlagen Math., to appear.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
R. I. Soare, The infinite injury priority method, J. Symbolic Logic 41 (1976), 513–530.
R. I. Soare, Fundamental methods for constructing recursively enumerable degrees, in Recursion Theory: Its Generalisations and Applications, Ed. by F. R. Drake and S. S. Wainer, Cambridge University Press, Cambridge (1980).
R. I. Soare, Recursively enumerable sets and degrees: the study of computable functions and computably generated sets, Springer Verlag, Berlin, Heidelberg, New York, to appear.
Author information
Authors and Affiliations
Editor information
Additional information
Dedicated to the fond memory of Bill Boone
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Jockusch, C.G. (1985). Genericity for recursively enumerable sets. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076222
Download citation
DOI: https://doi.org/10.1007/BFb0076222
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15673-4
Online ISBN: 978-3-540-39596-6
eBook Packages: Springer Book Archive