Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Addison, J., The method of alternating chains, in Theory of Models, North-Holland, Amsterdam, 1965 (p. 1–16).
Cooper, S. B., Doctoral Dissertation, University of Leicester, 1971.
Epstein, Richard L., Minimal Degrees of Unsolvability and the Full Approximation Construction, Memiors of the A.M.S., no. 162, 1975.
Epstein, Richard L., Degrees of Unsolvability: Structure and Theory, Lecture Notes in Mathematics no. 759, Springer-Verlag, New York.
Epstein, Richard L., Initial Segments of Degrees ≤ 0′, to appear.
Ershov, A. Hierarchy of Sets I, II, III, Algebra and Logic, vol. 7, no. 1, no. 4 (1968) and vol. 9, no. 1 (1970). (English translation, Consultants Bureau, N.Y.).
Gold, Limiting recursion, Journal of Symbolic Logic, vol. 30, no. 1, p. 28–48, 1965.
Putnam, H., Trial and error predicates and the solution to a problem of Mostowski, Journal of Symbolic Logic, vol. 30, no. 1, p. 49–57, 1965.
Rogers, Hartley, Theory of Recursive Functions and Effective Computation, McGraw-Hill, New York.
Sacks, Gerald, Degrees of Unsolvability, Annals of Math. Studies, no. 55, Princeton, New Jersey, revised edition, 1965.
Shoenfield, J. R., On the degrees of unsolvability, Annals of Mathematics, vol. 69, p. 644–653, 1959.
Soare, Robert, Recursively enumerable sets and degrees, Bull. A.M.S., vol. 84, no. 6 (1978), p. 1149.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Epstein, R.L., Haas, R., Kramer, R.L. (1981). Hierarchies of sets and degrees below 0′. 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/BFb0090937
Download citation
DOI: https://doi.org/10.1007/BFb0090937
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