Highness and bounding minimal pairs

Highness and bounding minimal pairs (1993)

Cached

Download Links

[www.mcs.vuw.ac.nz]
[math.cornell.edu]

Other Repositories/Bibliography

DBLP

by Rodney G. Downey , Richard A. Shore

Venue:	Math. Logic Quarterly
Citations:	3 - 2 self

BibTeX

@ARTICLE{Downey93highnessand,
    author = {Rodney G. Downey and Richard A. Shore},
    title = {Highness and bounding minimal pairs},
    journal = {Math. Logic Quarterly},
    year = {1993},
    pages = {475--491}
}

Bookmark

OpenURL

Abstract

We show the existence of a high r.e. degree bounding only joins of minimal pairs and of a high2 nonbounding r.e. degree. 0

Citations

43	Classes of recursively enumerable sets and degrees of unsolvability - Martin - 1966
40	On the degrees less than 0 - Sacks
30	Automorphisms of the lattice of recursively enumerable sets: Orbits - Downey, Stob - 1992
27	A recursively enumerable degree which will not split over all lesser ones - Lachlan
26	Interpolation and embedding in the recursively enumerable degrees - Robinson - 1971
14	Degrees of recursively enumerable sets which have no maximal supersets - Lachlan
14	Working below a high recursively enumerable degree - Shore, Slaman
12	Minimal pairs and high recursively enumerable degrees - Cooper - 1974
9	Bounding minimal pairs - Lachlan - 1979
9	Working below a low2 recursively enumerable degree - Shore, Slaman
5	1990a], Notes on the 0 priority method with special attention to density results - Downey - 1990
4	Jumps of hemimaximal sets - Downey, Stob - 1991
3	Degrees of classes of r.e - Shoenfield - 1976
3	Soare, "Recursively enumerable sets and degrees - I - 1987
2	The recursively enumerable degrees as a substructure of the ∆ 0 2-degrees. Hand written notes - Slaman - 1983
1	Density and infima in the recursively enumerable degrees, in preparation - Downey, Shore
1	Minimal pairs - Downey, Stob
1	Soare, New methods for automorphisms of the recursively enumerable sets and applications to the low 2 sets, in preparation - Harrington, Lachlan, et al.
1	Soare, A solution of Post's program; r.e. sets automorphic to complete sets; and new noninvariant jump classes of r,e, degrees, in preparation - Harrington, I
1	Splitting and density cannot be combined below a high recursively enumerable degree, in preparation - Shore, Slaman
1	The recursively enumerable degrees as a substructure of the \Delta 2 degrees - Slaman
1	Tree arguments in recursion theory and the 0 ′′′ priority method - Soare - 1985