32

Automorphisms of the lattice of recursively enumerable sets: Orbits, Adv
– Author(s) Peter Cholak, Rod Downey, Michael Stob, Peter Cholak, Rod Downey, Michael Stob

117

Recursively enumerable sets of positive integers and their decision problems
– E L Post
 1944

472

Recursively Enumerable Sets and Degrees
– R Soare
 1987

53

Classes of recursively enumerable sets and degrees of unsolvability
– Donald A Martin
 1966

22

Automorphisms of the lattice of recursively enumerable sets, Part I: Maximal sets
– R Soare
 1974

837

Theory of Recursive Functions and Effective Computability
– H Rogers
 1967

307

Classical Recursion Theory
– P Odifreddi
 1989

47

Two recursively enumerable sets of incomparable degrees of unsolvability
– R M Friedberg
 1957

10

Codable Sets and Orbits of Computably Enumerable Sets
– Leo Harrington, Robert I. Soare
 1995

13

Splitting properties and jump classes
– W Maass, R A Shore, M Stob
 1981

15

Recursively enumerable generic sets
– W Maass
 1982

14

Degrees of recursively enumerable sets which have no maximal supersets
– A H Lachlan

13

The ∆ 0 3Automorphism Method and Noninvariant Classes of Degrees
– Leo Harrington, Robert I. Soare
 1996

12

dSimple sets, small sets, and degree classes
– M Lerman, R Soare
 1980

9

On the definability of the double jump in the computably enumerable sets
– Peter A. Cholak, Leo A. Harrington
 2002

26

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

32

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

27

A criterion for completeness of degrees of unsolvability
– R Friedberg
 1957

123

Systems of Logic Based on Ordinals
– A M Turing
 1939
