Double Jumps of Minimal Degrees

&
Journal of Symbolic Logic 43 (4):715 - 724 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273510

Other Versions

edition Jockusch, Carl G.; Posner, David B.; Epstein, Richard L.; Shore, Richard A. (1985) "Double Jumps of Minimal Degrees". Journal of Symbolic Logic 50(2):550-552

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,874

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 over cardinals.C. T. Chong - 1982 - Journal of Symbolic Logic 47 (2):329-334.
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.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.
A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
S. B. Cooper. Minimal degrees and the jump operator. The journal of symbolic logic, vol. 38 , pp. 249–271.David Posner - 1975 - Journal of Symbolic Logic 40 (1):86-87.
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
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.
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.

Analytics

Added to PP
2009-01-28

Downloads
52 (#401,225)

6 months
18 (#152,793)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.

View all 19 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references