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öf random set either or contains an infinite subset that does not compute any Martin-Löf random set; etc. We also discuss further generalizations of this result.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.