Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822): Difference between revisions

@@ Property / cites work @@
+Q2885275
@@ Property / cites work: Q2885275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2709299
@@ Property / cites work: Q2709299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934289
@@ Property / cites work: Q4934289 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4513962
@@ Property / cites work: Q4513962 / 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 @@
+Q4286756
@@ Property / cites work: Q4286756 / rank @@
+Normal rank
@@ Property / cites work @@
+Classifications of definable subsets
@@ Property / cites work: Classifications of definable subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4956005
@@ Property / cites work: Q4956005 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable structures and the hyperarithmetical hierarchy
+Normal rank
@@ Property / cites work @@
+Q3949052
@@ Property / cites work: Q3949052 / rank @@
+Normal rank
@@ Property / cites work @@
+A construction for recursive linear orderings
@@ Property / cites work: A construction for recursive linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Orderings with αth Jump Degree 0 (α)
@@ Property / cites work: Orderings with αth Jump Degree 0 (α) / rank @@
+Normal rank
@@ Property / cites work @@
+Ehrenfeucht-Fraïssé games on ordinals
@@ Property / cites work: Ehrenfeucht-Fraïssé games on ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764115
@@ Property / cites work: Q4764115 / rank @@
+Normal rank
@@ Property / cites work @@
+There is no classification of the decidably presentable structures
+Normal rank