How enumeration reductibility yields extended Harrington non-splitting (Q3503759): Difference between revisions

@@ Property / author @@
-Mariya Ivanova Soskova
@@ Property / author: Mariya Ivanova Soskova / rank @@
-Normal rank
@@ Property / author @@
+Mariya Ivanova Soskova
@@ Property / author: Mariya Ivanova Soskova / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2178/jsl/1208359064
+Normal rank
@@ Property / OpenAlex ID @@
+W2150152177
@@ Property / OpenAlex ID: W2150152177 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degrees less than 0'
@@ Property / cites work: On the degrees less than 0' / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees joining to <b>0</b>′
@@ Property / cites work: Degrees joining to <b>0</b>′ / rank @@
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. Vol. II
@@ Property / cites work: Classical recursion theory. Vol. II / rank @@
+Normal rank
@@ Property / cites work @@
+Logic year 1979--80, The University of Connecticut, USA
+Normal rank
@@ Property / cites work @@
+The \(n\)-rea enumeration degrees are dense
@@ Property / cites work: The \(n\)-rea enumeration degrees are dense / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding and nonbounding minimal pairs in the enumeration degrees
+Normal rank
@@ Property / cites work @@
+Q4417312
@@ Property / cites work: Q4417312 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3503759