ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355): Difference between revisions

@@ Property / cites work @@
+A construction for recursive linear orderings
@@ Property / cites work: A construction for recursive linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Computable structures and the hyperarithmetical hierarchy
+Normal rank
@@ Property / cites work @@
+Degree spectra of the successor relation of computable linear orderings
+Normal rank
@@ Property / cites work @@
+Every recursive Boolean algebra is isomorphic to one with incomplete atoms
+Normal rank
@@ Property / cites work @@
+On computable self-embeddings of computable linear orderings
+Normal rank
@@ Property / cites work @@
+Some effects of Ash-Nerode and other decidability conditions on degree spectra
+Normal rank
@@ Property / cites work @@
+Uncountable degree spectra
@@ Property / cites work: Uncountable degree spectra / rank @@
+Normal rank
@@ Property / cites work @@
+The possible Turing degree of the nonzero member in a two element degree spectrum
+Normal rank
@@ Property / cites work @@
+Degree Spectra of Relations on Computable Structures
+Normal rank
@@ Property / cites work @@
+Degree spectra and computable dimensions in algebraic structures
+Normal rank
@@ Property / cites work @@
+Degrees of orderings not isomorphic to recursive linear orderings
+Normal rank
@@ Property / cites work @@
+Degrees coded in jumps of orderings
@@ Property / cites work: Degrees coded in jumps of orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Relations Intrinsically Recursive in Linear Orders
+Normal rank
@@ Property / cites work @@
+The -spectrum of a linear order
@@ Property / cites work: The -spectrum of a linear order / rank @@
+Normal rank