Cupping with random sets-Reference-Cited by-同舟云学术

Cupping with random sets

Published:2014-04-16 Issue:8 Volume:142 Page:2871-2879
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Day Adam,Miller Joseph

Abstract

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/2014-142-08/S0002-9939-2014-11997-6/S0002-9939-2014-11997-6.pdf

Reference18 articles.

1. The Denjoy alternative for computable functions;Bienvenu, Laurent,2012

2. Theory and Applications of Computability;Downey, Rodney G.,2010

3. Relativizing Chaitin’s halting probability;Downey, Rod;J. Math. Log.,2005

4. Difference randomness;Franklin, Johanna N. Y.;Proc. Amer. Math. Soc.,2011

5. Using random sets as oracles;Hirschfeldt, Denis R.;J. Lond. Math. Soc. (2),2007

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two More Characterizations of K-Triviality;Notre Dame Journal of Formal Logic;2018-01-01

2. HIGHER RANDOMNESS AND GENERICITY;Forum of Mathematics, Sigma;2017

3. USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS;The Bulletin of Symbolic Logic;2016-09

4. LEBESGUE DENSITY AND CLASSES;The Journal of Symbolic Logic;2016-03

5. Density, forcing, and the covering problem;Mathematical Research Letters;2015