DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES (Q4460756): Difference between revisions

@@ 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 @@
+Jumps of quasi-minimal enumeration degrees
@@ Property / cites work: Jumps of quasi-minimal enumeration degrees / 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 @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Defining the Turing jump
@@ Property / cites work: Defining the Turing jump / rank @@
+Normal rank