A minimal pair of recursively enumerable degrees (Q5519131): Difference between revisions

@@ Property / Wikidata QID @@
+Q56430706
@@ Property / Wikidata QID: Q56430706 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2269807
@@ Property / full work available at URL: https://doi.org/10.2307/2269807 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2051601785
@@ Property / OpenAlex ID: W2051601785 / 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 @@
+Degrees of Unsolvability. (AM-55)
@@ Property / cites work: Degrees of Unsolvability. (AM-55) / rank @@
+Normal rank
@@ Property / cites work @@
+TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets of positive integers and their decision problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5519131