Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy (Q646830): Difference between revisions

@@ Property / cites work @@
+Q5619076
@@ Property / cites work: Q5619076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5619077
@@ Property / cites work: Q5619077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816068
@@ Property / cites work: Q3816068 / rank @@
+Normal rank
@@ Property / cites work @@
+D.R.E. Degrees and the Nondiamond Theorem
@@ Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Pairs of Recursively Enumerable Degrees
+Normal rank
@@ Property / cites work @@
+The d.r.e. degrees are not dense
@@ Property / cites work: The d.r.e. degrees are not dense / rank @@
+Normal rank
@@ Property / cites work @@
+The recursively enumerable degrees are dense
@@ Property / cites work: The recursively enumerable degrees are dense / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511553
@@ Property / cites work: Q4511553 / rank @@
+Normal rank