Metarecursively enumerable sets and their metadegrees (Q5614653): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2307/2270325
@@ Property / full work available at URL: https://doi.org/10.2307/2270325 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2092093189
@@ Property / OpenAlex ID: W2092093189 / rank @@
+Normal rank
@@ Property / cites work @@
+Three theorems on the degrees of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Metarecursively enumerable sets and admissible ordinals
+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 @@
+TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
+Normal rank
@@ Property / cites work @@
+A maximal set which is not complete
@@ Property / cites work: A maximal set which is not complete / rank @@
+Normal rank