Definable incompleteness and Friedberg splittings (Q3149989): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.2178/jsl/1190150104
+Normal rank
@@ Property / OpenAlex ID @@
+W2104910355
@@ Property / OpenAlex ID: W2104910355 / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of the lattice of recursively enumerable sets: Orbits
+Normal rank
@@ Property / cites work @@
+Friedberg splittings of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+The intervals of the lattice of recursively enumerable sets determined by major subsets
+Normal rank
@@ Property / cites work @@
+Definable properties of the computably enumerable sets
+Normal rank
@@ Property / cites work @@
+The Δ₃⁰-automorphism method and noninvariant classes of degrees
+Normal rank
@@ Property / cites work @@
+Post's program and incomplete recursively enumerable sets.
+Normal rank
@@ Property / cites work @@
+TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
+Normal rank
@@ Property / cites work @@
+Jumps of Hemimaximal Sets
@@ Property / cites work: Jumps of Hemimaximal Sets / rank @@
+Normal rank