TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (Q3521597): Difference between revisions

@@ Property / author @@
-Rodney G. Downey
@@ Property / author: Rodney G. Downey / rank @@
-Normal rank
@@ Property / author @@
+Rodney G. Downey
@@ Property / author: Rodney G. Downey / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Embeddings of \(N_5\) and the contiguous degrees
@@ Property / cites work: Embeddings of \(N_5\) and the contiguous degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
+Normal rank
@@ Property / cites work @@
+Contiguity and distributivity in the enumerable Turing degrees
+Normal rank
@@ Property / cites work @@
+Lattice nonembeddings and initial segments of the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+Structural interactions of the recursively enumerable T- and W-degrees
+Normal rank
@@ Property / cites work @@
+Degree theoretic definitions of the low<sub>2</sub> recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
+Normal rank
@@ Property / cites work @@
+Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
+Normal rank
@@ Property / cites work @@
+A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
+Normal rank
@@ Property / cites work @@
+Not every finite lattice is embeddable in the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+Interpretability and Definability in the Recursively Enumerable Degrees
+Normal rank
@@ Property / cites work @@
+Dynamic notions of genericity and array noncomputability
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3521597