Hypersimplicity and semicomputability in the weak truth table degrees (Q2576639): Difference between revisions

@@ Property / author @@
-George Barmpalias
@@ Property / author: George Barmpalias / rank @@
-Normal rank
@@ Property / author @@
+George Barmpalias
@@ Property / author: George Barmpalias / rank @@
+Normal rank
@@ 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.1007/s00153-005-0288-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1979450836
@@ Property / OpenAlex ID: W1979450836 / rank @@
+Normal rank
@@ Property / cites work @@
+The approximation structure of a computably approximable real
+Normal rank
@@ Property / cites work @@
+Approximation representations for \(\Delta_2\) reals
+Normal rank
@@ Property / cites work @@
+Approximation representations for reals and their wtt‐degrees
+Normal rank
@@ Property / cites work @@
+Semirecursive Sets and Positive Reducibility
@@ Property / cites work: Semirecursive Sets and Positive Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. The theory of functions and sets of natural numbers
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. Vol. II
@@ Property / cites work: Classical recursion theory. Vol. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank