scientific article; zbMATH DE number 4004171
[For the entire collection see Zbl 0556.00008.] Let \(\omega =\{0,1,2,...\}\), \(\omega_ 2\) be the power set of \(\omega\) and let \(A^{[e]}=\{x:<e,x>\in A\}\). Let \(J_ e(A)=A\oplus W^ A_ e\). An operator on \(^{\omega}2\) of the form \(J_ e\) for some e is called an REA operator. For \(n<\omega\), an operator J on \(^{\omega}2\) is called n-REA if J is a composition \(J_{e_ n}\circ...\circ J_{e_ 1}\) of n REA operators. An operator J is called \(\omega\)-REA if there is a recursive function f such that \((J(A))^{[e]}=(J_{f(e)}\circ J_{f(e-1)}\circ...\circ J_{f(0)})(A)\) for all \(A\subseteq \omega\) and all \(e\in \omega\). A degree \(\underset \tilde{} b\) is called a minimal cover of a degree \(\underset \tilde{} a\) if \(\underset \tilde{} b>\underset \tilde{} a\) and no degree \(\underset \tilde{} c\) satisfies \(\underset \tilde{} b>\underset \tilde{} c>\underset \tilde{} a\). In this paper sketches of proofs of many interesting results are given. The main result asserts that every degree \(\geq 0^{(\omega)}\) is a minimal cover. This result follows from the following theorems. Theorem 4. If \(\alpha\leq \omega\), J is an \(\alpha\)-REA operator, and \(0^{(\alpha)}\leq_ TC\), then there is a set A such that \(J(A)\equiv_ T0^{(\alpha)}\oplus A\equiv_ TC.\) Theorem 5. There is an \(\omega\)-REA operator J such that for all A the degree of J(A) is a minimal cover of that of A. A refinement of the main result shows that the set of degrees of arithmetical sets is definable in the structure \(<{\mathcal D},\leq >\), where \({\mathcal D}\) is the set of degrees and \(\leq\) its usual partial ordering.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755447)