Computable positive and Friedberg numberings in hyperarithmetic (Q2213918): Difference between revisions

@@ Property / cites work @@
+The Meta-R.E. sets, but not the Π<sub>1</sub><sup>1</sup> sets, can be enumerated without repetition
+Normal rank
@@ Property / cites work @@
+Partial decidable presentations in hyperarithmetic
+Normal rank
@@ Property / cites work @@
+Positive presentations of families in relation to reducibility with respect to enumerability
+Normal rank
@@ Property / cites work @@
+Q4075450
@@ Property / cites work: Q4075450 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040890
@@ Property / cites work: Q4040890 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5741347
@@ Property / cites work: Q5741347 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
+Normal rank
@@ Property / cites work @@
+Q4973206
@@ Property / cites work: Q4973206 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4795523
@@ Property / cites work: Q4795523 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5476771
@@ Property / cites work: Q5476771 / rank @@
+Normal rank
@@ Property / cites work @@
+Positive presentations of families relative to \(e\)-oracles
+Normal rank
@@ Property / cites work @@
+Q2709299
@@ Property / cites work: Q2709299 / rank @@
+Normal rank