Cupping with random sets
classification
🧮 math.LO
keywords
k-trivialml-cuppableonlybelowcuppabilitycuppingfurtherintroduced
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.