TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES

TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES (1999)

Cached

Download Links

[www.nd.edu]

by Peter A. Cholak , Stephen M. Walk

BibTeX

@MISC{Cholak99towardthe,
    author = {Peter A. Cholak and Stephen M. Walk},
    title = {TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES},
    year = {1999}
}

Bookmark

OpenURL

Abstract

Citations

411	Recursively Enumerable Sets and Degrees - Soare - 1987
44	Two recursively enumerable sets of incomparable degrees of unsolvability - Friedberg - 1957
36	Lower bounds for pairs of recursively enumerable degrees - Lachlan - 1966
32	An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees - Ambos-Spies, Jockusch, et al. - 1984
31	The recursively enumerable degrees are dense - Sacks - 1964
30	On the unsolvability of the problem of reducibility in the theory of algorithms - Muchnik - 1956
26	Array nonrecursive sets and multiple permitting arguments - Downey, Jockusch, et al. - 1990
25	Embedding nondistributive lattices in the recursively enumerable degrees - Lachlan - 1970
20	Array nonrecursive degrees and genericity - Downey, Jockusch, et al. - 1996
19	Kolmogorov complexity and instance complexity of recursively enumerable sets - Kummer - 1996
17	Double jumps of minimal degrees - Posner - 1978
16	A minimal pair of recursively enumerable degrees - Yates - 1966
15	Splitting theorems in recursion theory - Downey, Stob
15	Reducibility and completeness for sets of integers - Friedberg, Rogers - 1959
15	The weak truth table degrees of recursively enumerable sets - Ladner, Sasso - 1975
13	Automorphisms of the lattice of Π0 1 classes, perfect thin classes, and ANC degrees - Cholak, Coles, et al.
13	Lattice nonembeddings and initial segments of the recursively enumerable degrees - Downey - 1990
13	Splitting properties and jump classes - Maass, Shore, et al. - 1981
12	jump classes and strong reducibilities - Downey, Jockusch - 1987
11	On pairs of recursively enumerable degrees - Ambos-Spies - 1984
11	Degree theoretical splitting properties of recursively enumerable sets - Ambos-Spies, Fejer - 1988
11	Not every finite lattice is embeddable in the recursively enumerable degrees - Lachlan, Soare - 1980
11	The density of infima in the recursively enumerable degrees - Slaman - 1991
10	0 2 degrees and transfer theorems - Downey - 1987
9	The density of the nonbranching degrees - Fejer - 1983
9	Relative recursive enumerability - Soare, Stob - 1982
7	Lattice embeddings below a nonlow2 recursively enumerable degree - Downey, Shore - 1996
5	Lattice nonembeddings and intervals in the recursively enumerable degrees - Cholak, Downey - 1993
5	Embedding lattices with top preserved below non-GL 2 degrees - Fejer - 1989
5	Soare, Dynamic properties of computably enumerable sets, In: Computability, Enumerability, Unsolvability: Directions in Recursion Theory - Harrington, I - 1996
5	Sublattices of the recursively enumerable degrees - Thomason - 1971
4	Intervals without critical triples - Cholak, Downey, et al. - 1998
3	Interpolating d.r.e. and REA degrees between r.e. degrees - Arslanov, Lempp, et al. - 1994
3	Array nonrecursive degrees and lattice embeddings of the diamond - Downey - 1993
3	wtt-degrees and T-degrees of r.e. sets - Stob - 1983
2	A contiguous nonbranching degree - Downey - 1989
2	Contiguity and distributivity in the enumerable degrees - Downey, Lempp - 1997
2	Abstract complexity theory and the degrees of unsolvability - Schaeffer - 1998
1	Sets recursively enumerable in high degrees - Cooper - 1972
1	The R.E. WTT-Structure of Certain Turing Degrees - Schweiter - 1987
1	Correction to promptly simple theorem - Soare - 1998
1	Embedding M5. Unpublished handwritten notes - Stob - 1980
1	On Embedding of the Lattice 1-3-1 into the Recursively Enumerable Degrees - Weinstein - 1988
1	A new reducibility between Turing- and wtt-reducibility - Yuefei - 1994