Documents Related by Co-Citation

472 Recursively Enumerable Sets and Degrees – R Soare - 1987
73 Degrees of Unsolvability – M Lerman - 1983
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
42 Lower bounds for pairs of recursively enumerable degrees – A. H. Lachlan - 1966
25 Recursive enumerability and the jump operator – G E Sacks - 1963
47 Two recursively enumerable sets of incomparable degrees of unsolvability – R M Friedberg - 1957
9 1984], The Elementary Theory of the Recursively Enumerable Degrees is not ℵ0-categorical – 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
16 First order theory of the degrees of recursive unsolvability – S G Simpson
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
23 Distributive initial segments of the degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 14 – A Lachlan - 1968
28 Embedding nondistributive lattices in the recursively enumerable degrees – A Lachlan - 1970
45 A minimal degree less than 0 – G E Sacks - 1961
7 1998], The Π3-theory 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