Noncappable enumeration degrees below 0e′ (Q3128477): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2307/2275820
@@ Property / full work available at URL: https://doi.org/10.2307/2275820 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2005529528
@@ Property / OpenAlex ID: W2005529528 / rank @@
+Normal rank
@@ Property / cites work @@
+Properly Σ2 Enumeration Degrees
@@ Property / cites work: Properly Σ2 Enumeration Degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
+Normal rank
@@ Property / cites work @@
+Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense
+Normal rank
@@ Property / cites work @@
+Enumeration reducibility and partial degrees
@@ Property / cites work: Enumeration reducibility and partial degrees / rank @@
+Normal rank
@@ Property / cites work @@
+On minimal pairs of enumeration degrees
@@ Property / cites work: On minimal pairs of enumeration degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3329452
@@ Property / cites work: Q3329452 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility and Completeness for Sets of Integers
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank

Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477): Difference between revisions