Dynamic Properties of Computably Enumerable Sets (1995)

Cached

Download Links

by Leo Harrington , Robert I. Soare
Venue:In Computability, Enumerability, Unsolvability, volume 224 of London Math. Soc. Lecture Note Ser
Citations:1 - 0 self

Documents Related by Co-Citation

6 Contiguity and distributivity in the enumerable Turing degrees – R G Downey, S Lempp - 1997
4 Embedding finite lattices into the computably enumerable degrees - a status survey – S Lempp, M Lerman, D R Solomon - 2002
6 A theorem on minimal degrees – J R Shoenfield - 1966
9 Degrees of Unsolvability: Structure and Theory – R Epstein - 1979
9 The density of the nonbranching degrees – P A Fejer - 1983
6 The Turing universe is not rigid – S B Cooper - 1997
3 On homogeneity and definability in the first-order theory of the Turing degrees – R A Shore - 1982
3 Some applications of forcing to hierarchy problems in arithmetic – P G Hinman - 1969
4 Computing degrees of unsolvability – H Rogers - 1959
6 The recursively enumerable degrees have infinitely many onetypes – K Ambos-Spies, R I Soare - 1989
2 Three easy constructions of recursively enumerable sets – C G Jockusch - 1981
2 The fine structure of degrees of unsolvability of recursively enumerable sets – R Friedberg - 1957
4 Lattice embeddings into the r.e. degrees preserving 1 – K Ambos-Spies, S Lempp, M Lerman - 1995
1 Undecidability and 1-types in intervals of the computably enumerable degrees – Klaus Ambos-spies, Denis R. Hirschfeldt, Richard A. Shore - 2000
4 Undecidability and 1-types in the recursively enumerable degrees – K Ambos-Spies, R A Shore - 1993
3 Category methods in recursion theory – J Myhill - 1961
2 The ∀∃ theory of D(≤, ∨, ′ ) is undecidable – Richard A. Shore, Theodore A. Slaman - 2003
1 editors (2000). Computability Theory and its Applications. Current Trends and Open Problems – P A Cholak, S Lempp, M Lerman - 1999
1 Reminiscences of logicians. With Contributions by – J N Crossley - 1975