1-generic splittings of computably enumerable degrees (Q2576946): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:29, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | 1-generic splittings of computably enumerable degrees |
scientific article |
Statements
1-generic splittings of computably enumerable degrees (English)
0 references
29 December 2005
0 references
A set \(G\subseteq\omega\) is 1-generic if, for any \(e\in\omega\), there is a string \(\sigma\subset G\) such that \(\{e\}^\sigma(e)\downarrow\) or \(\forall\tau\supseteq\sigma\,\,\{e\}^\tau(e)\uparrow\). Generic degrees were introduced and studied intensively by C. Jockusch and others. R. Soare proved that the degree \textbf{0}\('\) can be split into two 1-generic degrees, but the general question of which degrees are joins of incomparable 1-generic degrees is still open. The author made a significant progress towards a solution of the problem by showing that every non-zero computably enumerable degree can be split into two 1-generic degrees. As a corollary he obtains that no two c.e. degrees bound the same class of 1-generic degrees.
0 references
computably enumerable degrees
0 references
1-generic degrees
0 references
splittings
0 references