Completely Autoreducible Degrees

&
Mathematical Logic Quarterly 22 (1):571-575 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19760220164

Other Versions

reprint Jockusch, Carl G.; Paterson, Michael S. (1976) "Completely Autoreducible Degrees". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22(1):571-575

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

The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
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.
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.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
Inhomogeneity of the p-s-Degrees of Recursive Functions.Asae Mochizuki & Juichi Shinoda - 2000 - Mathematical Logic Quarterly 46 (3):385-392.
The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Mathematical Logic Quarterly 14 (7-12):159-166.
Degrees of Souslin Trees.Stefan Bilaniuk - 1991 - Mathematical Logic Quarterly 37 (33-35):513-524.
Degrees of analytic sets.Karel Hrbacek - 1983 - Mathematical Logic Quarterly 29 (2):75-82.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.

Analytics

Added to PP
2013-11-24

Downloads
16 (#1,192,648)

6 months
4 (#1,246,862)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.
Constructive Logic and the Medvedev Lattice.Sebastiaan A. Terwijn - 2006 - Notre Dame Journal of Formal Logic 47 (1):73-82.

Add more citations

References found in this work

Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.

Add more references