Degree theoretic definitions of the low_2 recursively enumerable sets

Degree theoretic definitions of the low_2 recursively enumerable sets (1995)

Cached

Download Links

by Rod Downey , Richard A. Shore

Venue:	J. SYMBOLIC LOGIC
Citations:	7 - 5 self

BibTeX

@ARTICLE{Downey95degreetheoretic,
    author = {Rod Downey and Richard A. Shore},
    title = { Degree theoretic definitions of the low_2 recursively enumerable sets},
    journal = {J. SYMBOLIC LOGIC},
    year = {1995},
    volume = {60},
    pages = {727--756}
}

Bookmark

OpenURL

Abstract

Citations

411	Recursively Enumerable Sets and Degrees - Soare - 1987
283	Classical Recursion Theory - Odifreddi - 1999
103	Π 0 1 classes and degrees of theories - Soare - 1972
66	Degrees of Unsolvability - Lerman - 1983
43	Classes of recursively enumerable sets and degrees of unsolvability - Martin - 1966
41	Comparison of polynomial-time reducibilities - Ladner, Lynch, et al. - 1975
26	Array nonrecursive sets and multiple permitting arguments - Downey, Jockusch, et al. - 1990
21	Minimal degrees and the jump operator - Cooper - 1973
21	On the lattice of recursively enumerable sets - Lachlan - 1968
18	Degrees in which recursive sets are uniformly recursive. Canadian Journal of Mathematics, 24:1092– 1099 - Jockusch - 1972
17	Double jumps of minimal degrees - Posner - 1978
15	Recursively enumerable generic sets - Maass - 1982
14	Degrees of recursively enumerable sets which have no maximal supersets - Lachlan
14	Working below a high recursively enumerable degree - Shore, Slaman
13	Lattice nonembeddings and initial segments of the recursively enumerable degrees - Downey - 1990
13	On the degrees of index sets - Yates - 1969
12	jump classes and strong reducibilities - Downey, Jockusch - 1987
12	Axiomatizable theories with few axiomatizable extensions - Martin, Pour-El - 1970
12	Reducibility orderings: theories, definability and automorphisms - Nerode, Shore - 1980
10	Second order logic and first order theories of reducibility orderings, inThe Kleene Symposium - Nerode, Shore
9	Working below a low2 recursively enumerable degree - Shore, Slaman
8	Rigidity and definability in the noncomputable universe - Cooper - 1994
7	Lattice embeddings below a nonlow2 recursively enumerable degree - Downey, Shore - 1996
5	Three theorems on tt-degrees - Dëgtev - 1978
4	Array nonrecursive sets and lattice embeddings of the diamond - Downey
2	1981], Hierarchies of sets and degrees below 0 ′ ,inLogic Year 1979-80 - Epstein, Haas, et al.
1	tt– andm–degrees - Degtev
1	Recursively enumerable m– andtt–degrees I: the quantity of m–degrees - Downey
1	Completely mitotic recursively enumerable degrees - Downey, Slaman
1	A direct construction of a minimal tt–degree,inRecursion Theory Week (K.Ambos–Spies,G.Müller and - Fejer, Shore
1	On tt–degreesofr.e.T–degrees - Kobzev - 1973
1	Interpreting true arithmetic in the theory of the tt and wtt degrees below 0 ′ , in preparation - Nies, Shore
1	The structure of the degrees of unsolvability, inRecursion Theory - Shore