Complete Recursively Enumerable Sets (Q5536627): Difference between revisions

@@ label / en / label / en @@
+Complete Recursively Enumerable Sets
@@ Property / author @@
+Alistair H. Lachlan
@@ Property / author: Alistair H. Lachlan / 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/2036145
@@ Property / full work available at URL: https://doi.org/10.2307/2036145 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4244426146
@@ Property / OpenAlex ID: W4244426146 / rank @@
+Normal rank
@@ Property / title @@
+Complete Recursively Enumerable Sets (English)
@@ Property / title: Complete Recursively Enumerable Sets (English) / rank @@
+Normal rank
@@ Property / cites work @@
+Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
+Normal rank
@@ Property / cites work @@
+Completeness, the Recursion Theorem, and Effectively Simple Sets
+Normal rank
@@ Property / cites work @@
+Creative sets
@@ Property / cites work: Creative sets / rank @@
+Normal rank
@@ Property / cites work @@
+Effectively Simple Sets
@@ Property / cites work: Effectively Simple Sets / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5536627