The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867): Difference between revisions

@@ Property / cites work @@
+The recursively enumerable degrees have infinitely many one-types
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets and degrees
@@ Property / cites work: Recursively enumerable sets and degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. Vol. II
@@ Property / cites work: Classical recursion theory. Vol. II / rank @@
+Normal rank
@@ Property / cites work @@
+Strong reducibilities
@@ Property / cites work: Strong reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+The weak truth table degrees of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Conference in mathematical logic, London 1970
@@ Property / cites work: Conference in mathematical logic, London 1970 / rank @@
+Normal rank