Automorphisms ofη-like computable linear orderings and Kierstead's conjecture (Q2958211): Difference between revisions

@@ Property / cites work @@
+Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
+Normal rank
@@ Property / cites work @@
+On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
+Normal rank
@@ Property / cites work @@
+Q5619076
@@ Property / cites work: Q5619076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5619077
@@ Property / cites work: Q5619077 / rank @@
+Normal rank
@@ Property / cites work @@
+Low linear orderings
@@ Property / cites work: Low linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Increasing <i>η</i>  -representable degrees
@@ Property / cites work: Increasing <i>η</i> -representable degrees / rank @@
+Normal rank
@@ Property / cites work @@
+On limitwise monotonicity and maximal block functions
+Normal rank
@@ Property / cites work @@
+<i>η</i>-representation of sets and degrees
@@ Property / cites work: <i>η</i>-representation of sets and degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees in Which the Recursive Sets are Uniformly Recursive
+Normal rank
@@ Property / cites work @@
+Computable shuffle sums of ordinals
@@ Property / cites work: Computable shuffle sums of ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. The theory of functions and sets of natural numbers
+Normal rank

Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211): Difference between revisions