The $\forall \exists $-theory of the effectively closed Medvedev degrees is decidable (Q2655138): Difference between revisions

@@ Property / cites work @@
+A splitting theorem for the Medvedev and Muchnik lattices
+Normal rank
@@ Property / cites work @@
+Q4934277
@@ Property / cites work: Q4934277 / rank @@
+Normal rank
@@ Property / cites work @@
+Density of the Medvedev lattice of \(\Pi^0_1\) classes
+Normal rank
@@ Property / cites work @@
+Q4249723
@@ Property / cites work: Q4249723 / rank @@
+Normal rank
@@ Property / cites work @@
+The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
+Normal rank
@@ Property / cites work @@
+Q3329452
@@ Property / cites work: Q3329452 / rank @@
+Normal rank
@@ Property / cites work @@
+Working below a \(low_ 2\) recursively enumerable degree
+Normal rank
@@ Property / cites work @@
+Mass Problems and Randomness
@@ Property / cites work: Mass Problems and Randomness / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of the recursively enumerable Turing degrees
+Normal rank
@@ Property / cites work @@
+Extension of embeddings in the computably enumerable degrees
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank

The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138): Difference between revisions