COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362): Difference between revisions

@@ Property / cites work @@
+Enumerations in computable structure theory
@@ Property / cites work: Enumerations in computable structure theory / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerations, countable structures and Turing degrees
+Normal rank
@@ Property / cites work @@
+On the recursive functions of ordinal numbers
@@ Property / cites work: On the recursive functions of ordinal numbers / rank @@
+Normal rank
@@ Property / cites work @@
+[Russian Text Ignored]
@@ Property / cites work: [Russian Text Ignored] / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040890
@@ Property / cites work: Q4040890 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
+Normal rank
@@ Property / cites work @@
+Recursive linear orders with recursive successivities
+Normal rank
@@ Property / cites work @@
+Pairs of recursive structures
@@ Property / cites work: Pairs of recursive structures / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of orderings not isomorphic to recursive linear orderings
+Normal rank
@@ Property / cites work @@
+Spectra of highn and non-lown degrees
@@ Property / cites work: Spectra of highn and non-lown degrees / rank @@
+Normal rank