Partial degrees and the density problem

Journal of Symbolic Logic 47 (4):854-859 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273104

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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

Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
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.
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.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
The Π20 enumeration degrees are not dense.William Calhoun & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (4):1364-1379.
A survey of partial degrees.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (2):130-140.
Interpreting true arithmetic in the Δ 0 2 -enumeration degrees.Thomas F. Kent - 2010 - Journal of Symbolic Logic 75 (2):522-550.
Type two partial degrees.Ko-Wei Lih - 1978 - Journal of Symbolic Logic 43 (4):623-629.
Note on degrees of partial functions.John Myhill - 1972 - Journal of Symbolic Logic 37 (2):408-408.

Analytics

Added to PP
2009-01-28

Downloads
77 (#281,729)

6 months
20 (#136,238)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.

View all 10 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.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.

Add more references