An undecidable linear order that is \(n\)-decidable for all \(n\) (Q5937834): Difference between revisions

@@ Property / cites work @@
+Q4249724
@@ Property / cites work: Q4249724 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of games to the completeness problem for formalized theories
+Normal rank
@@ Property / cites work @@
+Q3230355
@@ Property / cites work: Q3230355 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective procedures in field theory
@@ Property / cites work: Effective procedures in field theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764115
@@ Property / cites work: Q4764115 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+Q3949052
@@ Property / cites work: Q3949052 / rank @@
+Normal rank