Some effectively infinite classes of enumerations (Q1210351): Difference between revisions

@@ Property / cites work @@
+Q3863873
@@ Property / cites work: Q3863873 / rank @@
+Normal rank
@@ Property / cites work @@
+On computable enumerations. II
@@ Property / cites work: On computable enumerations. II / 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 @@
+A unique positive enumeration
@@ Property / cites work: A unique positive enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q3262783
@@ Property / cites work: Q3262783 / rank @@
+Normal rank
@@ Property / cites work @@
+Godel Numberings Versus Friedberg Numberings
@@ Property / cites work: Godel Numberings Versus Friedberg Numberings / rank @@
+Normal rank
@@ Property / cites work @@
+A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Gödel numberings of partial recursive functions
@@ Property / cites work: Gödel numberings of partial recursive functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank