Cone avoiding closed sets
Logic
2016-02-12 v1
Abstract
We prove that for an arbitrary subtree of with each element extendable to a path, a given countable class closed under disjoint union, and any set , if none of the members of strongly -enumerate for any , then there exists an infinite set contained in either or such that for every , also does not strongly -enumerate . We give applications of this result, which include: (1) doesn't imply ; (2) (Ambos-Spies et al.2004) is strictly weaker than ; (3) (Kjos-Hanssen 2009) for any Martin-L\"{o}f random set either or contains an infinite subset that does not compute any Martin-L\"{o}f random set; etc. We also discuss further generalizations of this result.
Keywords
Cite
@article{arxiv.1602.03777,
title = {Cone avoiding closed sets},
author = {Lu Liu},
journal= {arXiv preprint arXiv:1602.03777},
year = {2016}
}
Comments
22 pages