刘嘉忆攻克世界难题.pdfVIP

Cone avoid closed sets induced by non-enumerable trees within partitions Jiayi Liu Department of Mathematics Central South University Temporal but legal name is Lu Liu Sep 2011 g.jiayi.liu@ Main Lemma To state the main result we begin by the following definitions. Definition 1 Let Dn be the canonical representation of finite set of 2 . An enumeration of T 2 is a h such that nDhn T . Moreover, h is k -enumeration iff nDhn k ; non-trivial iff n Dhn n; strong iff it is a k -enumeration for some k ; Main Lemma The main Lemma is: Theorem 2 Given C, and Q is a closed set (of 2) such that, Q does not admit a non-trivial strong enumeration computable in C; then for any set A, there exists an infinite subset G of either A or A such that G C does not compute any non-trivial strong enumeration of Q. Frame of construction: Requirements RA : GAC is not a non-trivial strong eenumeration of e e Q, i.e. one of the following is true: 1 GAC is not total ; e 2 nGAC n Q ; e 3 nCGA n e; e 4 n CGA n n e Similarly for RA : i GAC 1 i is not total ; 2 n GAC n Q ; i 3 nCGA n i ; i 4 (n CGA n n; i We will satisfy requirements