Density, forcing, and the covering problem
Logic
2013-04-11 v1
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.
Keywords
Cite
@article{arxiv.1304.2789,
title = {Density, forcing, and the covering problem},
author = {Adam R. Day and Joseph S. Miller},
journal= {arXiv preprint arXiv:1304.2789},
year = {2013}
}