Chapter 6 The recursively enumerable degrees

Studies in Logic and the Foundations of Mathematics

Volumn 140, Issue C, 1999, Pages 169-197

  Shore, Richard A ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013416239     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(99)80022-6     Document Type: Chapter

References (93)

1. Ambos-Spies K. On the structure of the recursively enumerable degrees. Ph.D. Thesis (1980), University of Munich
2. Ambos-Spies K. Generators of the recursively enumerable degrees. In: Ebbinghaus H.-D., Müller G.H., and Sacks G.E. (Eds). Recursion Theory Week, Proceedings. Oberwolfach 1984. Lecture Notes in Mathematics Vol. 1141 (1985), Springer, Berlin 1-28
3. Preprint. Ambos-Spies K. Automorphism bases for the recursively enumerable degrees (1993)
4. 5 and the contiguous degrees (1999)
5. Ambos-Spies K., Fejer P.A., Lempp S., and Lerman M. Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. J. Symbolic Logic 61 (1996) 880-905
6. Ambos-Spies K., Jockusch Jr. C.G., Shore R.A., and Soare R.I. Trans. Amer. Math. Soc. 281 (1984) 109-128
7. Ambos-Spies K., Lempp S., and Lerman M. Lattice embeddings into the r.e. degrees preserving 1. In: Prawitz D., and Westerahl D. (Eds). Logic and Philosophy of Science: Papers from the 9th ICLMPS (1994), Kluwer Academic Publishers, Dordrecht 179-198
8. Ambos-Spies K., Lempp S., and Lerman M. Lattice embeddings into the r.e. degrees preserving 0 and 1. J. London Math. Soc. 49 2 (1994) 1-15
9. Ambos-Spies K., and Lerman M. Lattice embeddings into the recursively enumerable degrees. J. Symbolic Logic 51 (1986) 257-272
10. Ambos-Spies K., and Lerman M. Lattice embeddings into the recursively enumerable degrees II. J. Symbolic Logic 54 (1989) 735-760
11. Ambos-Spies K., and Shore R.A. Undecidability and 1-types in the r.e. degrees. Ann. Pure Appl. Logic 63 (1993) 3-37
12. Ambos-Spies K., and Soare R.I. The recursively enumerable degrees have infinitely many one-types. Ann. Pure Appl. Logic 44 (1989) 1-23
13. Becker H.A. Characterization of jump operators. J. Symbolic Logic 53 (1988) 708-728
14. Cholak P., and Downey R.G. Lattice nonembeddings and intervals of the recursively enumerable degrees. Ann. Pure Appl. Logic 61 (1993) 195-221
15. Cholak P., Downey R.G., and Shore R.A. Intervals without critical triples. In: Makowsky J.A., and Ravve E.V. (Eds). Logic Colloquium '95. Lecture Notes in, Logic vol. 11 (1998), Springer, Heidelberg 17-43
16. Cooper S.B. Minimal pairs and high recursively enumerable degrees. J. Symbolic Logic 39 (1974) 655-660
17. Cooper S.B. The jump is definable in the structure of the degrees of unsolvability (research announcement). Bull. Amer. Math. Soc. 23 (1990) 151-158
18. Cooper S.B. Beyond Gödel's theorem: the failure to capture information content. University of Leeds, Department of Pure Mathematics, Preprint Series No. 4 (1996)
19. Cooper S.B. The degrees below O′. this Handbook (1999)
20. Downey R.G. Lattice nonembeddings and initial segments of the recursively enumerable degrees. Ann. Pure Appl. Logic 49 (1990) 97-119
21. Downey R.G. Notes on the O‴ priority method with special attention to density results. In: Ambos-Spies K., and Müller G.H. (Eds). Recursion Theory Week. Lecture Notes in Mathematics Vol. 1432 (1990), Springer, Berlin 111-140
22. Downey R.G., and Lempp S. Contiguity and distributivity in the enumerable Turing degrees. J. Symbolic Logic 62 (1997) 1215-1240
23. 2 recursively enumerable sets. J. Symbolic Logic 60 (1995) 727-756
24. 2 recursively enumerable degrees. Israel J. Math. 94 (1996) 221-246
25. Downey R.G., and Shore R.A. There is no degree invariant half-jump. Proc. Amer. Math. Soc. 125 (1997) 3033-3037
26. Fejer P.A. The density of the nonbranching degrees. Ann. Pure Appl. Logic 24 (1983) 113-130
27. Friedberg R.M. Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Nat. Acad. Sci. 43 (1957) 236-238
28. Harrington L., and Shelah S. The undecidability of the recursively enumerable degrees (research announcement). Bull. Amer. Math. Soc., (N.S.) 6 (1982) 79-80
29. Harrington L., and Soare R.I. Post's program and incomplete recursively enumerable sets. Proc. Nat. Acad. Sci. 88 (1991) 10242-10246
30. Jockusch Jr. C.G., and Shore R.A. Pseudo-jump operators I: the r.e. case. Trans. Amer. Math. Soc. 275 (1983) 599-609
31. Jockusch Jr. C.G., and Shore R.A. Pseudo-jump operators II: Transfinite iterations, hierarchies and minimal covers. J. Symbolic Logic 49 (1984) 1205-1236
32. Kleene S.C., and Post E. The upper semi-lattice of degrees of recursive unsolvability. Ann. Math. 59 2 (1954) 379-407
33. In: Kechris A.S., and Moschovakis Y. (Eds). Cabal Seminar 76-77. Lecture Notes in Mathematics Vol. 689 (1978), Springer, Berlin
34. Lachlan A.H. Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc. 16 (1966) 537-569
35. Lachlan A.H. The impossibility of finding relative complements for recursively enumerable degrees. J. Symbolic Logic 31 (1966) 434-454
36. Lachlan A.H. The elementary theory of recursively enumerable sets. Duke Math. J. 35 (1968) 123-146
37. Lachlan A.H. Embedding nondistributive lattices in the recursively enumerable degrees. In: Hodges W. (Ed). Conference in Mathematical Logic. London, 1970. Lecture Notes in Mathematics Vol. 255 (1972), Springer, Berlin 149-172
38. Lachlan A.H. The priority method for the construction of recursively enumerable sets. In: Mathias A.R.D., and Rogers Jr. H. (Eds). Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics Vol. 337 (1973), Springer, Berlin 299-310
39. Lachlan A.H. A recursively enumerable degree which will not split over all lesser ones. Ann. Math. Logic 9 (1975) 307-365
40. Lachlan A.H. Uniform enumeration operators. J. Symbolic Logic 40 (1975) 401-409
41. Lachlan A.H. Decomposition of recursively enumerable degrees. Proc. Amer. Math. Soc. 79 (1980) 629-634
42. Lachlan A.H., and Soare R.I. Not every finite lattice is embeddable in the recursively enumerable degrees. Adv. Math. 37 (1980) 74-82
43. Lempp S., and Lerman M. A finite lattice without critical triples that cannot be embedded into the enumerable Turing degrees. Ann Pure Appl. Logic 87 (1997) 167-185
44. 3 theory of the enumerable Turing degrees is undecidable. Trans. Amer. Math. Soc. 350 (1998) 2719-2736
45. Lerman M. Degrees of Unsolvability (1983), Springer, Berlin
46. Unpublished manuscript. Lerman M. General ∀∃-decision method for degree structures (1993)
47. Lerman M. Embeddings into the recursively enumerable degrees. In: Cooper S.B., Slaman T.A., and Wainer S.S. (Eds). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. LMSLNS Vol. 224 (1996), Cambridge University Press, Cambridge, UK 185-204
48. Lerman M. A necessary and sufficient condition for embedding ranked finite lattices into the computably enumerable degrees. Ann. Pure Appl. Logic 94 (1998) 143-180
49. to appear. Lerman M. A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees (1999)
50. Lerman M., and Shore R.A. Decidability and invariant classes for degree structures. Trans. Amer. Math. Soc. 310 (1988) 669-692
51. 0 -categorical. Adv. Math. 53 (1984) 301-320
52. Maass W. Recursively enumerable generic sets. J. Symbolic Logic 47 (1982) 809-823
53. Miller D. High recursively enumerable degrees and the anti-cupping property. In: Lerman M., Schmerl J., and Soare R.I. (Eds). Logic Year 1979-1980: University of Connecticut. Lecture Notes in Mathematics Vol. 859 (1981), Springer, Berlin 230-245
54. Muchnik A.A. On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. Nauk SSSR (N.S.) 108 (1956) 29-32
55. Muchnik A.A. Solution of Post's reduction problem and of certain other problems in the theory of algorithms. Trudy Moskov Mat. Obsc. 7 (1958) 391-405
56. Nies A., Shore R.A., and Slaman T. Definability in the recursively enumerable degrees. Bull. Symbolic Logic 2 (1996) 392-404
57. Nies A., Shore R.A., and Slaman T. Interpretability and definability in the recursively enumerable degrees. Proc. London Math. Soc. 77 3 (1998) 241-249
58. Post E.L. Finite combinatory processes-formulation. J.Symbolic Logic 1 (1936) 103-105
59. Post E.L. Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc. 50 (1944) 284-316
60. Robinson R.W. Interpolation and embedding in the recursively enumerable degrees. Ann. of Math. 93 2 (1971) 285-314
61. Rogers Jr. H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
62. Rogers Jr. H. Some problems of definability in recursive function theory. In: Crossley J.N. (Ed). Sets, Models, and Recursion Theory, Proceedings of the Summer School in Mathematical Logic and 10th Logic Colloquium. Leicester, August-Sept. 1965 (1967), North-Holland, Amsterdam 183-201
63. Sacks G.E. Degrees of Unsolvability. Ann. of Math. Stud. Vol. 55 (1963), Princeton University Press, Princeton, NJ
64. Sacks G.E. Recursive enumerability and the jump operator. Trans. Amer. Math. Soc. 108 (1963) 223-239
65. Sacks G.E. On the degrees less than O′. Ann. of Math. 77 2 (1963) 211-231
66. Sacks G.E. The recursively enumerable degrees are dense. Ann. of Math. 80 2 (1964) 300-312
67. Sacks G.E. Degrees of Unsolvability. Ann. of Math. Stud. 2nd ed. Vol. 55 (1966), Princeton University Press, Princeton, NJ
68. Shoenfield J.R. On degrees of unsolvability. Ann. Math. 69 2 (1959) 644-653
69. Shoenfield J.R. Undecidable and creative theories. Fund. Math. 49 (1961) 171-179
70. Shoenfield J.R. An application of model theory to degrees of unsolvability. In: Addison J.W., Henkin L., and Tarski A. (Eds). Symposium on the Theory of Models (1965), North-Holland, Amsterdam 359-363
71. Shoenfield J.R. Degrees of Unsolvability. Math. Stud. Vol. 2 (1971), North-Holland, Amsterdam
72. abstract#219. Shoenfield J.R., and Soare R.I. The generalized diamond theorem. Recursive Function Theory Newsletter 19 (1978)
73. Shore R.A. On the ∀∃-sentences of α-recursion theory. In: Fenstad J.E., Gandy R.O., and Sacks G.E. (Eds). Generalized Recursion Theory II. Studies in Logic and the Foundations of Mathematics Vol. 94 (1978), North-Holland, Amsterdam 331-354
74. Shore R.A. Finitely generated codings and the degrees r.e. in a degree d. Proc. Amer. Math. Soc. 84 (1982) 256-263
75. Shore R.A. A non-inversion theorem for the jump operator. Ann. Pure Appl. Logic 40 (1988) 277-303
76. 2 recursively enumerable degree. Archive for Math. Logic 29 (1990) 201-211
77. Shore R.A., and Slaman T.A. Working below a high recursively enumerable degree. J. Symbolic Logic 58 (1993) 824-859
78. Slaman T.A. Degree structures. Proc. Int. Cong. Math. Kyoto 1990 (1991), Springer, Tokyo 303-316
79. Slaman T.A. The density of infima in the recursively enumerable degrees. Ann Pure Appl. Logic 52 (1991) 155-179
80. Slaman T.A. The global Turing degrees. In: Griffor E.R. (Ed). Handbook of Computability Theory (1999), Elsevier, Amsterdam 155-168
81. Slaman T.A., and Soare R.I. Algebraic aspects of the computably enumerable degrees. Proc. Nat. Acad. Sci. 92 (1995) 617-621
82. to appear. Slaman T.A., and Soare R.I. Extension of embeddings in the recursively enumerable degrees. Ann. Math. (1998)
83. Slaman T., and Steel J.R. Definable functions on degrees. In: Kechris A.S., Martin D.A., and Steel J.R. (Eds). Cabal Seminar 81-85. Lecture Notes in Mathematics Vol. 1333 (1988), Springer, Berlin 37-55
84. in preparation. Slaman T.A., and Woodin W.H. Definability in Degree Structures (2000)
85. Soare R.I. Recursively Enumerable Sets and Degrees (1987), Springer, Berlin
86. Soare R.I. The lattice of recursively enumerable sets. this Handbook (1999)
87. Steel J.R. A classification of jump operators. J. Symbolic Logic 47 (1982) 347-358
88. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42 2 (1936) 230-265
89. Turing A.M. Systems of logic based on ordinals. Proc. London Math. Soc. 45 (1939) 161-228
90. Weinstein B.J. On Embeddings of the 1-3-1 into the Recursively Enumerable Degrees. PhD Thesis (1988), University of California, Berkeley
91. Yates C.E.M. Three theorems on the degrees of recursively enumerable sets. Duke Math. J. 32 (1965) 461-468
92. Yates C.E.M. A minimal pair of recursively enumerable degrees. J. Symbolic Logic 31 (1966) 159-168
93. Yates C.E.M. On the degrees of index sets. Trans. Amer. Math. Soc. 121 (1966) 309-328