475

Recursively Enumerable Sets and Degrees
– R Soare
 1987

73

Degrees of Unsolvability
– M Lerman
 1983

48

Two recursively enumerable sets of incomparible degrees of unsolvability
– R Friedberg
 1957

25

Recursive enumerability and the jump operator
– G E Sacks
 1963

9

1984], The Elementary Theory of the Recursively Enumerable Degrees is not ℵ0categorical
– M Lerman, R A Shore, R I Soare

26

A recursively enumerable degree which will not split over all lesser ones
– A H Lachlan
 1975

45

A minimal degree less than 0
– G E Sacks
 1961

18

The theory of the degrees below 0
– Richard A. Shore
 1981

10

1982], The undecidability of the recursively enumerable degrees (research announcement
– L Harrington, S Shelah

16

First order theory of the degrees of recursive unsolvability
– S G Simpson

42

Lower bounds for pairs of recursively enumerable degrees
– A. H. Lachlan
 1966

30

Pseudojump operators. II. Transfinite iterations, hierarchies and minimal covers
– Richard A Shore
 1984

12

1971], Initial segments of the degrees of unsolvability
– M Lerman

62

Degrees of Unsolvability
– G Sacks
 1963

35

The recursively enumerable degrees are dense
– G E Sacks
 1964

28

Embedding nondistributive lattices in the recursively enumerable degrees
– A Lachlan
 1970

36

Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
– K AmbosSpies, C G Jockusch, R Shore, R I

7

1998], The Π3theory of the computably enumerable Turing degrees is undecidable
– Steffen Lempp, André Nies, Theodore, A. Slaman
 1998

32

On the unsolvability of the problem of reducibility in the theory of algorithms
– A Muchnik
 1956
