论文信息 - Density, forcing, and the covering problem - 字舞流文

Density, forcing, and the covering problem

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.

Adam R. Day | Joseph S. Miller | A. Day

[1] André Nies,et al. The Denjoy alternative for computable functions , 2012, STACS.

[2] André Nies,et al. Using random sets as oracles , 2007 .

[3] C. Spector. On Degrees of Recursive Unsolvability , 1956 .

[4] Adam R. Day,et al. Cupping with random sets , 2012, 1206.1603.

[5] Noam Greenberg,et al. COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS , 2013, The Bulletin of Symbolic Logic.

[6] Klaus Ambos-Spies,et al. Degrees of Unsolvability , 2014, Computational Logic.

[7] Johanna N. Y. Franklin,et al. DIFFERENCE RANDOMNESS , 2022 .

[8] A. Nies. Lowness properties and randomness , 2005 .