The Π3-theory of the -enumeration degrees is undecidable (Q3416114): Difference between revisions

@@ Property / cites work @@
+Enumeration reducibility and partial degrees
@@ Property / cites work: Enumeration reducibility and partial degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding the diamond in the Σ<sub>2</sub> enumeration degrees
+Normal rank
@@ Property / cites work @@
+Definability in the enumeration degrees
@@ Property / cites work: Definability in the enumeration degrees / rank @@
+Normal rank
@@ Property / cites work @@
+On the degrees less than 0'
@@ Property / cites work: On the degrees less than 0' / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable fragments of elementary theories
@@ Property / cites work: Undecidable fragments of elementary theories / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding finite lattices into the Σ<sub>2</sub><sup>0</sup> enumeration degrees
+Normal rank
@@ Property / cites work @@
+The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
+Normal rank
@@ Property / cites work @@
+ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
+Normal rank
@@ Property / cites work @@
+The \(n\)-rea enumeration degrees are dense
@@ Property / cites work: The \(n\)-rea enumeration degrees are dense / rank @@
+Normal rank
@@ Property / cites work @@
+Some Special Pairs of Σ2 e-Degrees
@@ Property / cites work: Some Special Pairs of Σ2 e-Degrees / rank @@
+Normal rank

The Π<sub>3</sub>-theory of the -enumeration degrees is undecidable (Q3416114): Difference between revisions