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
Addison, J. W. [1959] Some consequences of the axiom of constructibility, Fund. Math. 46, 337–357.
Balbes, R. and Dwinger, P. [1974] Distributive lattices, University of Missouri Press, Columbia, Missouri.
Church, A. and Quine, W. V. [1952] Some theorems on definability and decidability, J. Symb. Logic 17, 179–187.
Epstein, R. [1979] Degrees of unsolvability: Structure and theory, Lect. Notes in Math. 759, Springer-Verlag, Berlin.
Ershov, Yu. L., Lavrov, I. A., Taimanov, A. D. and Taitslin, A. M. [1965] Elementary theories, Russian Mathematical Surveys 20, 35–105.
Feiner, L. [1970] The strong homogeneity conjecture, J. Symb. Logic 35, 375–377.
Friedberg, R. M. [1957] The fine structure of degrees of unsolvability of recursively enumerable sets, seminars of Cornell Institute for Symbolic Logic, pp.404–406.
Friedberg, R. M. [1957a] A criterion for completeness of degrees of unsolvability, J. Symb. Logic 22, 159–160.
Harding, C. J. [1974] Forcing in recursion theory, Thesis, University College of Swansea.
Harrington, L. and Kechris, A. [1975] A basis result for Σ 03 sets of reals with an application to minimal covers, Proc. Am. Math. Soc. 53, 445–448.
Harrington, L. and Shore, R. A. [1981] Definable degrees and automorphisms of D, to appear.
Jockusch, C. G. Jr. [1973] An application of Σ 04 determinacy to the degrees of unsolvability, J. Symb. Logic 38, 293–294.
Jockusch, C. G. Jr. [1974] Review of Selman [1972] in Math Reviews 47 #3155.
Jockusch, C. G. Jr. and Simpson, S. G. [1976] A degree theoretic definition of the ramified analytical hierarchy, Ann. Math.Logic, 10,1–32.
Jockusch, C. G. Jr. and Soare, R. I. [1970] Minimal covers and arithmetical sets, Proc. Am. Math. Soc. 25, 856–859.
Jockusch, C. G. Jr. and Solovay, R. M. [1977] Fixed points of jump preserving automorphisms of degrees, Israel J. Math. 26, 91–94.
Lachlan, A. H. [1968] Distributive initial segments of the degrees of unsolvability, Z. f. Math. Logik und Grund. d. Math, 14, 457–472.
Lachlan, A. H. [1969] Initial segments of one-one degrees, Pacific J. Math. 29, 351–366.
Lachlan, A. H. [1970] Initial segments of many-one degrees, Can. J. Math. 22, 75–85.
Lavrov, I. A. [1963] Effective inseparability of the sets of identically true formulae and finitely refutable formulae for certain elementary theories, Alg. i. Logika 2, 5–18.
Lerman, M. [1978] Initial segments of the degrees below O′, Notices Am. Math. Soc. 25, A-506.
Lerman, M., Shore, R. A. and Soare, R. I. [1981] The elementary theory of the recursively enumerable degrees is not XO-categorical, to appear.
Moschovakis, Y. N. [1973] Uniformization in a playful universe, Bull. Am. Math. Soc. 77, 731–736.
Nerode, A. and Shore, R. A. [1979] Second order logic and first order theories of reducibility orderings, in The Kleene Symposium, J. Barwise, J. Keisler and K. Kunen eds. North-Holland, Amsterdam.
Nerode, A. and Shore, R. A. [1981] Reducibility orderings: Theories, definability and automorphisms, Ann. Math. Logic 18, 61–89.
Rabin, M. [1965] A simple method for undecidability proofs and some applications, Logic Methodology and Philosophy of Science, Proc. 1964 Int. Congress, Bar-Hillel ed., North-Holland, Amsterdam, 58–68.
Rabin, M. and Scott, D. [n.d.] The undecidability of some simple theories, mimeographed notes.
Richter, L. S. C. [1979] On automorphisms of the degrees that preserve jumps, Israel J. Math. 32, 27–31.
Rogers, H. Jr. [1967] Theory of Recursive Functions and Effective Computability, McGraw Hill Co., New York.
Rogers, H. Jr. [1967a] Some problems of definability in recursive function theory, in Sets Models and Recursion Theory, Proc. of the Summer School in Mathematical Logic and Tenth Logic Colloquium Lancaster August–September 1965, Crossley, J. N. ed., North-Holland, Amsterdam.
Sacks, G. E. [1966] Degrees of Unsolvability, Am. Math. Studies no. 55, 2nd ed. Princeton University Press, Princeton, N.J.
Selman, A. L. [1972] Applications of forcing to the degree theory of the arithmetic hierarchy, Proc. London Math. Soc. (3), 25, 586–602.
Shore, R. A. [1979] The homogeneity conjecture, Proc. Nat. Ac. Sci. 76, no. 9, 4218–4219.
Shore, R. A. [1980] The degrees recursively enumerable in a degree d. Abstracts Am. Math. Soc. 1, no.6.
Shore, R. A. [1981] On homogeneity and definability in the first order theory of the Turing degrees, J. Symb. Logic, to appear.
Shore, R. A. [1981a] The theory of the degrees below O′, J. London Math. Soc., to appear.
Simpson, S. G. [1977] First order theory of the degrees of recursive unsolvability, Ann. Math. (2) 105, 121–139.
Spector, C. [1956] On degrees of recursive unsolvability, Ann. Math. 64, 581–592.
Yates, C. E. M. [1970] Initial segments of the degrees of unsolvability Part II: Minimal degrees, J. Symb. Logic 35, 243–266.
Yates, C. E. M. [1972] Initial segments and implications for the structure of degrees, in Conference in Mathematical Logic, London 1970. Hodges ed. Lecture Notes in Mathematics no.255, Springer-Verlag, Berlin, 305–335.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Shore, R.A. (1981). The degrees of unsolvability: Global results. 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/BFb0090953
Download citation
DOI: https://doi.org/10.1007/BFb0090953
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