Density, forcing, and the covering problem
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.