Splitting theorems and the jump operator (Q1295399): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Rodney G. Downey / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Sh. T. Ishmukhametov / rank | |||
Normal rank |
Revision as of 20:04, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Splitting theorems and the jump operator |
scientific article |
Statements
Splitting theorems and the jump operator (English)
0 references
8 November 1999
0 references
Two sets \(A_1\) and \(A_2\) split \(A\) (written: \(A=A_1\sqcup A_2\)) if \(A=A_1\cup A_2\), and \(A_1\cap A_2=\emptyset\). This splitting is called proper if both \(A_1\) and \(A_2\) are noncomputable. J. B. Remmel asked if a high computably enumerable (c.e.) set can be split into two (c.e.) sets one of which is high. The authors give a negative answer to this question by constructing a high c.e. set all of whose proper splittings consist of \(\text{low}_2\) c.e. sets.
0 references
high computably enumerable set
0 references
degrees
0 references
proper splittings
0 references