On computable self-embeddings of computable linear orderings (Q3655260): Difference between revisions

@@ Property / author @@
-Rodney G. Downey
@@ Property / author: Rodney G. Downey / rank @@
-Normal rank
@@ Property / author @@
+Rodney G. Downey
@@ Property / author: Rodney G. Downey / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2153991166
@@ Property / OpenAlex ID: W2153991166 / rank @@
+Normal rank
@@ Property / cites work @@
+On self-embeddings of computable linear orderings
@@ Property / cites work: On self-embeddings of computable linear orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126392
@@ Property / cites work: Q3126392 / rank @@
+Normal rank
@@ Property / cites work @@
+Every recursive Boolean algebra is isomorphic to one with incomplete atoms
+Normal rank
@@ Property / cites work @@
+A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
+Normal rank
@@ Property / cites work @@
+Q3949052
@@ Property / cites work: Q3949052 / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of orderings not isomorphic to recursive linear orderings
+Normal rank
@@ Property / cites work @@
+Concerning similarity transformations of linearly ordered sets
+Normal rank
@@ Property / cites work @@
+On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3655260