Density, forcing, and the covering problem
classification
🧮 math.LO
keywords
forcingcomputecomputesconjunctioncoveringdensityeveryk-trivial
read the original 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.
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.