Cupping with random sets
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čera, who introduced both cuppability notions.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2012
- DOI:
- 10.48550/arXiv.1206.1603
- arXiv:
- arXiv:1206.1603
- Bibcode:
- 2012arXiv1206.1603D
- Keywords:
-
- Mathematics - Logic