|
6
|
Contiguity and distributivity in the enumerable Turing degrees
– R G Downey, S Lempp
- 1997
|
|
9
|
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
– S Lempp, M Lerman
- 1997
|
|
4
|
Embedding finite lattices into the computably enumerable degrees - a status survey
– S Lempp, M Lerman, D R Solomon
- 2002
|
|
11
|
Not every finite lattice is embeddable in the recursively enumerable degrees
– A H Lachlan, R I Soare
- 1980
|
|
3
|
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
– M Lerman
- 1998
|
|
6
|
A theorem on minimal degrees
– J R Shoenfield
- 1966
|
|
3
|
Decidability of the “almost all” theory of degrees
– J Stillwell
- 1972
|
|
9
|
Degrees of Unsolvability: Structure and Theory
– R Epstein
- 1979
|
|
11
|
The density of infima in the recursively enumerable degrees
– T A Slaman
- 1991
|
|
1
|
The ∀∃-theory of R(≤, ∨, ∧) is undecidable
– Russell G. Miller, Andre O. Nies, Richard, A. Shore
- 2004
|
|
9
|
The density of the nonbranching degrees
– P A Fejer
- 1983
|
|
6
|
The Turing universe is not rigid
– S B Cooper
- 1997
|
|
3
|
Degrees of classes of RE sets
– J R Shoenfield
- 1976
|
|
2
|
Undecidable and creative theories
– J R Shoenfield
- 1961
|
|
3
|
On homogeneity and definability in the first-order theory of the Turing degrees
– R A Shore
- 1982
|
|
2
|
Plus cupping in the recursively enumerable degrees, Handwritten notes
– L Harrington
- 1978
|
|
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
|
|
12
|
Lattice embeddings into the recursively enumerable degrees
– K Ambos-Spies, M Lerman
- 1986
|
