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, Minimal pairs and high recursively enumerable degrees, J. Symbolic Logic 39 (1974), 655–660.
P. A. Fejer, The structure of definable subclasses of the recursively enumerable degrees, Ph.D. Dissertation, University of Chicago, 1980.
P. A. Fejer and R. I. Soare, The plus-cupping theorem for the recursively enumerable degrees, these Proceedings.
R. M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Natl. Acad. Sciences, U.S.A. 43 (1957), 236–238.
A. H. Lachlan, Lower bounds for pairs of r.e. degrees, Proc. London Math. Soc. (3) 16 (1966), 537–569.
A. H. Lachlan, The impossibility of finding relative complements for recursively enumerable degrees, J. Symbolic Logic 31 (1966), 434–454.
R. E. Ladner and L. P. Sasso, The weak truth table degrees of recursively enumerable sets, Ann. Math. Logic 4 (1975), 429–448.
M. Lerman, Admissible ordinals and priority arguments, Proceedings of the Cambridge Summer School in Logic, 1971, Springer-Verlag Lecture Notes in Math., No. 337, 1973.
D. P. Miller, Doctoral Dissertation, University of Chicago, 1981.
A. A. Muchnik, On the unsolvability of the problem of reducibility in the theory of algorithms (Russ.), Doklady Academii Nauk SSSR, n.s., 108 (1956), 194–197.
R. W. Robinson, A dichotomy of the recursively enumerable sets, Zeitschr. f. Math. Logik und Grundlagen d. Math. 14 (1968), 339–356.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, N.Y., 1967.
G. E. Sacks, Recursive enumerability and the jump operator, Trans. Amer. Math. Soc. 108 (1963), 223–239.
G. E. Sacks, The recursively enumerable degrees are dense, Annals Math. (2) 80 (1964), 300–312.
G. E. Sacks, Degrees of Unsolvability, rev. ed., Annals of Math. Studies, No. 55, Princeton Univ. Press, Princeton, N.J., 1966.
J. R. Shoenfield, Undecidable and creative theories, Fundamenta Mathematicae 49 (1961), 171–179.
J. R. Shoenfield, Applications of model theory to degrees of unsolvability, 359–363, Symposium on the Theory of Models, North Holland, 1965.
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, Recursion Theory, Its Generalizations and Applications, Logic Colloquium 79, Leeds, 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
Miller, D.P. (1981). High recursively enumerable degrees and the anti-cupping property. 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/BFb0090950
Download citation
DOI: https://doi.org/10.1007/BFb0090950
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