Relatively computably enumerable reals (Q535150): Difference between revisions

A real is an infinite binary sequence \(X \in 2^\omega\) in this paper. A real \(X\) is called relatively c.e. if it is c.e. in some real \(Y\) which is not above \(X\) (i.e., \(X \not\leq_T Y\)), and a real \(X\) is called relatively s.a. (simple and above) if there is a real \(Y <_T X\) such that \(X\) is c.e. in \(Y\) but the complement \(\overline{X}\) does not contain any infinite subset which is c.e. in \(Y\). This paper proves the following two results: (1) Every \(\Pi_1^0\) class contains a member which is not relatively c.e. (2) Any \(1\)-generic real is relatively s.a.