On the existence of a strong minimal pair (Q5501923): Difference between revisions

@@ Property / arXiv ID @@
+.03591
@@ Property / arXiv ID: 1610.03591 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice embeddings into the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+The undecidability of the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Pairs of Recursively Enumerable Degrees
+Normal rank
@@ Property / cites work @@
+A recursively enumerable degree which will not split over all lesser ones
+Normal rank
@@ Property / cites work @@
+The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
+Normal rank
@@ Property / cites work @@
+Degrees of Unsolvability. (AM-55)
@@ Property / cites work: Degrees of Unsolvability. (AM-55) / 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 @@
+The recursively enumerable degrees are dense
@@ Property / cites work: The recursively enumerable degrees are dense / rank @@
+Normal rank
@@ Property / cites work @@
+Non-bounding constructions
@@ Property / cites work: Non-bounding constructions / rank @@
+Normal rank
@@ Property / cites work @@
+Working below a high recursively enumerable degree
+Normal rank
@@ Property / cites work @@
+Extension of embeddings in the computably enumerable degrees
+Normal rank
@@ Property / cites work @@
+A minimal pair of recursively enumerable degrees
@@ Property / cites work: A minimal pair of recursively enumerable degrees / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1723234438
@@ Property / OpenAlex ID: W1723234438 / rank @@
+Normal rank