Initial segments of computable linear orders with computable natural relations (Q308863): Difference between revisions

@@ Property / cites work @@
+Recursive linear orders with recursive successivities
+Normal rank
@@ Property / cites work @@
+Autostability of models
@@ Property / cites work: Autostability of models / rank @@
+Normal rank
@@ Property / cites work @@
+Recursively Categorical Linear Orderings
@@ Property / cites work: Recursively Categorical Linear Orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Linear orderings of low degree
@@ Property / cites work: Linear orderings of low degree / rank @@
+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 @@
+Computability on linear orderings enriched with predicates
+Normal rank
@@ Property / cites work @@
+Scattered linear orderings with no computable presentation
+Normal rank
@@ Property / cites work @@
+On initial segments of computable linear orders
@@ Property / cites work: On initial segments of computable linear orders / rank @@
+Normal rank
@@ Property / cites work @@
+Initial segments of computable linear orders with additional computable predicates
+Normal rank