Density, forcing, and the covering problem

Autor:	Day, Adam R., Miller, Joseph S.
Rok vydání:	2013
Předmět:	Mathematics - Logic
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1304.2789 Zobrazit plný text záznamu View this record from Arxiv