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
S. B. Cooper, On a theorem of C.E.M.Yates, handwritten notes,1974.
L. Harrington, On Cooper's proof of a theorem of Yates I, and II, handwritten notes, 1976.
L. Harrington, Plus-cupping in the r.e. degrees, handwritten notes, 1978.
A. H. Lachlan, The impossibility of finding relative complements for recursively enumerable degrees, J. Symbolic Logic 31 (1966), 434–454.
—, Lower bounds for pairs of r.e. degrees, Proc. London Math. Soc. 16 (1966), 537–567.
—, A recursively enumerable degree which will not split over all lesser ones, Ann. Math. Logic 9 (1975), 307–365.
—, Bounding minimal pairs, J. Symbolic Logic 44 (1979), 626–642.
David Miller, High recursively enumerable degrees and the anti-cupping property, this volume.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
G. E. Sacks, On the degrees less than O, Ann. of Math. (2) 77 (1963), 211–231.
—, The recursively enumerable degrees are dense, Ann. of Math. (2) 80 (1964), 300–312.
J. R. Shoenfield, Application of model theory to degrees of unsolvability, Sympos. Theory of Models, North-Holland, Amsterdam, 1965, 359–363.
R. I. Soare, The infinite injury priority method, J. Symbolic Logic 41 (1976), 513–530.
R. I. Soare, Recursively enumerable sets and degrees, Bull. A.M.S. 84 (1978), 1149–1181.
R. I. Soare, Fundamental methods for constructing recursively enumerable degrees, Recursion theory, its generalizations and applications, Logic Colloquium 79, Leeds, England, Cambridge University Press, to appear.
C. E. M. Yates, A minimal pair of r.e. degrees, J. Symbolic Logic 31 (1966), 159–168.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Fejer, P.A., Soare, R.I. (1981). The plus-cupping theorem for the recursively enumerable degrees. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds) Logic Year 1979–80. Lecture Notes in Mathematics, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090938
Download citation
DOI: https://doi.org/10.1007/BFb0090938
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10708-8
Online ISBN: 978-3-540-38673-5
eBook Packages: Springer Book Archive