Working below a high recursively enumerable degree (Q4276023): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2275099
@@ Property / full work available at URL: https://doi.org/10.2307/2275099 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2077721565
@@ Property / OpenAlex ID: W2077721565 / rank @@
+Normal rank
@@ Property / cites work @@
+The jump is definable in the structure of the degrees of unsolvability
+Normal rank
@@ Property / cites work @@
+Working below a \(low_ 2\) recursively enumerable degree
+Normal rank
@@ Property / cites work @@
+Q3329452
@@ Property / cites work: Q3329452 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Recursively Enumerable Sets and Degrees of Unsolvability
+Normal rank
@@ Property / cites work @@
+Initial segments of degrees below 0′
@@ Property / cites work: Initial segments of degrees below 0′ / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
+Normal rank
@@ Property / cites work @@
+The undecidability of the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+Minimal degrees and the jump operator
@@ Property / cites work: Minimal degrees and the jump operator / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4276023