Cupping with random sets
Logic
2012-06-11 v1
Abstract
We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These results settle a question of Ku\v{c}era, who introduced both cuppability notions.
Cite
@article{arxiv.1206.1603,
title = {Cupping with random sets},
author = {Adam R. Day and Joseph S. Miller},
journal= {arXiv preprint arXiv:1206.1603},
year = {2012}
}