Cupping with random sets

Adam R. Day, Joseph S. Miller · Proceedings of the American Mathematical Society · 2014

We prove that a set is K K -trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K K -trivial if and only if it is not ML-cuppable. These results settle a question of Kučera, who introduced both cuppability notions.

Read the paper · More papers on PaperTik