Carl G. JockuschJr., and David B. Posner. Double jumps of minimal degrees. The journal of symbolic logic, vol. 43 no. 4 , pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism bases for degrees of unsotvability. Israel journal of mathematics, vol. 40 , pp. 150–164. - Richard L. Epstein. Initial segments of degrees below 0′. Memoirs of the American Mathematical Society, no. 241. American Mathematical Society, Providence1981, vi + 102 pp. - Richard A. Shore. The theory of the degrees below 0′. The journal of the London Mathematical Society, ser. 2 vol. 24 , pp. 1–14

Journal of Symbolic Logic 50 (2):550-552 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274245

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Double Jumps of Minimal Degrees.Carl G. Jockusch, David B. Posner, Richard L. Epstein & Richard A. Shore - 1985 - Journal of Symbolic Logic 50 (2):550-552.
Richard A. Shore. Determining automorphisms of the recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 65 , pp. 318– 325. - Richard A. Shore. The homogeneity conjecture. Proceedings of the National Academy of Sciences of the United States of America, vol. 76 , pp. 4218– 4219. - Richard A. Shore. On homogeneity and definability in the first-order theory of the Turing degrees. The journal of symbolic logic, vol. 47 , pp. 8– 16. - Richard A. Shore. The arithmetic and Turing degrees are not elementarily equivalent. Archiv für mathematische Logik und Grundlagenforschung, vol. 24 , pp. 137– 139. - Richard A. Shore. The structure of the degrees of unsolvabitity. Recursion theory, edited by Anil Nerode and Richard A. Shore, Proceedings of symposia in pure mathematics, vol. 42, American Mathematical Society, Providence1985, pp. 33– 51. - Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois journal of mathematics, vol. 30 , pp. 320–. [REVIEW]Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.
Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Shoenfield J. R.. On degrees of unsolvability. Annals of mathematics, second series, vol. 69 , pp. 644–653.Shoenfield J. R.. An uncountable set of incomparable degrees. Proceedings of the American Mathematical Society, vol. 11 , pp. 61–62. [REVIEW]Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):203-204.
On the Jumps of the Degrees Below a Recursively Enumerable Degree.David R. Belanger & Richard A. Shore - 2018 - Notre Dame Journal of Formal Logic 59 (1):91-107.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Model theory of the computably enumerable many-one degrees.A. Nies - 2000 - Logic Journal of the IGPL 8 (5):701-706.
Lachlan A. H.. Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society, set. 3 vol. 16 part 3 , pp. 537–569. [REVIEW]Carl G. Jockosch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
C-Quasi-Minimal enumeration degrees below c'.Boris Solon - 2006 - Archive for Mathematical Logic 45 (4):505-517.

Analytics

Added to PP
2016-06-30

Downloads
34 (#458,553)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references