The recursively enumerable alpha-degrees are dense

Annals of Mathematical Logic 9 (1/2):123 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(76)90007-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

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

On suborderings of the alpha-recursively enumerable alpha-degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):369.
On alpha- and beta-recursively enumerable degrees.Wolfgang Maass - 1979 - Annals of Mathematical Logic 16 (3):205.
Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Degrees of unsolvability complementary between recursively enumerable degrees, Part I.S. B. Cooper - 1972 - Annals of Mathematical Logic 4 (1):31.
Undecidability and 1-types in the recursively enumerable degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):294-295.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.

Analytics

Added to PP
2014-01-17

Downloads
6 (#1,480,465)

6 months
1 (#1,719,665)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
Discrete transfinite computation models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.

View all 14 citations / Add more citations

References found in this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
Metarecursively enumerable sets and their metadegrees.Graham C. Driscoll - 1968 - Journal of Symbolic Logic 33 (3):389-411.

View all 16 references / Add more references