Codings on linear orders and algorithmic independence of natural relations (Q2263111): Difference between revisions

@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3949052
@@ Property / cites work: Q3949052 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive linear orders with recursive successivities
+Normal rank
@@ Property / cites work @@
+Recursively Categorical Linear Orderings
@@ Property / cites work: Recursively Categorical Linear Orderings / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
+Normal rank
@@ Property / cites work @@
+Computability on linear orderings enriched with predicates
+Normal rank
@@ Property / cites work @@
+Every Low 2 Boolean Algebra has a Recursive Copy
@@ Property / cites work: Every Low 2 Boolean Algebra has a Recursive Copy / rank @@
+Normal rank
@@ Property / cites work @@
+Low linear orderings
@@ Property / cites work: Low linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Initial segments of computable linear orders with additional computable predicates
+Normal rank
@@ Property / cites work @@
+Q4249724
@@ Property / cites work: Q4249724 / rank @@
+Normal rank
@@ Property / cites work @@
+Δ 2 0 -copies of linear orderings
@@ Property / cites work: Δ 2 0 -copies of linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
+Normal rank