## Mass problems and almost everywhere domination

### Cached

### Download Links

- [www.math.psu.edu]
- [ftp.math.psu.edu]
- [www.math.psu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Mathematical Logic Quarterly |

Citations: | 10 - 7 self |

### BibTeX

@ARTICLE{Simpson_massproblems,

author = {Stephen G. Simpson},

title = {Mass problems and almost everywhere domination},

journal = {Mathematical Logic Quarterly},

year = {},

volume = {53},

pages = {2007}

}

### OpenURL

### Abstract

Mathematical Logic Quarterly, 53, 2007, pp. 483–492. We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-Löf random, respectively. Let b1, b2, b3 be the degrees of unsolvability of the mass problems associated with the sets AED, MLR×AED, MLR∩AED respectively. Let Pw be the lattice of degrees of unsolvability of mass problems associated with nonempty Π 0 1 subsets of 2 ω.Let1 and 0 be the top and bottom elements of Pw. We show that inf(b1, 1) andinf(b2, 1) andinf(b3, 1) belongtoPw and that 0 < inf(b1, 1) < inf(b2, 1) < inf(b3, 1) < 1. Under the natural embedding of the recursively enumerable Turing degrees into Pw, weshow that inf(b1, 1) andinf(b3, 1) but not inf(b2, 1) are comparable with some recursively enumerable Turing degrees other than 0 and 0 ′. In order to make this paper more self-contained, we exposit the proofs of some recent