THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2558322769
@@ Property / OpenAlex ID: W2558322769 / rank @@
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. Vol. II
@@ Property / cites work: Classical recursion theory. Vol. II / rank @@
+Normal rank
@@ Property / cites work @@
+Computably enumerable equivalence relations
@@ Property / cites work: Computably enumerable equivalence relations / rank @@
+Normal rank
@@ Property / cites work @@
+Periodicity in generations of automata
@@ Property / cites work: Periodicity in generations of automata / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Positive Equivalence Relations
@@ Property / cites work: A Note on Positive Equivalence Relations / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibilities among equivalence relations induced by recursively enumerable structures
+Normal rank
@@ Property / cites work @@
+Graphs realised by r.e. equivalence relations
@@ Property / cites work: Graphs realised by r.e. equivalence relations / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2976337