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

@@ 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